Multilevel Pseudocyclic Codes
Valdemar C. da Rocha, Ricardo M. Campello de Souza, Patrick Guy Farrell · Journal of Information and Optimization Sciences · 1990
Multilevel pseudocyclic codes based on algebraic properties of polynomials over Galois fields are constructed. These are consta cyclic random error-correcting codes of length n over GF(p s ), where n=(p ms –1)/r, p is an odd prime number and m, s and r are integers. Their minimum distance is guaranteed by a B.C.H. type lower bound. Examples are given, including the construction of negacyclic codes as well as of t-error correcting maximum distance separable codes. Most techniques for decoding cyclic codes are applicable to these codes due to their similar structure.