Algorithm Of Depth And Analyzed Of Complexity

Luo Yuan had given two algorithms about depth of codes over GF(q) in 2000, we can also get another algorithm from the definition. In this paper, we have analysed the complexity of this three algorithms. We compute the complexity in the worst condition and average condition. The algorithms which gave by Lou has been extended to Z_P² in this paper. And then we compute the complexity in the worst condition and average condition. Then we have wrote VC program for this six algorithms. We obtain a series of data. We have carried out the experiment result and theory result comparing.