The Property of the Width of a Codeword and Its Resursive Algorithms on the Finite Ring Z4
有限环Z4上码字广度的性质及其递归算法

In coding theory, it is important to study a code and the structure of codewords. In this paper, the width of a codeword on the finite ring Z4 is defined which is a new mathematical character of a codeword. A number of properties on the width of codewords are presented, and two recursive algorithms for computing the width of a codeword on the finite ring Z4 are given. Finally, the relationship between the width and depth of a codeword over the ring Z4 is preliminary discussed.