Lee metric codes over integer residue rings (Corresp.)
- 1 March 1979
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 25 (2) , 250-254
- https://doi.org/10.1109/tit.1979.1056017
Abstract
A method for constructing Lee metric codes over arbitrary alphabet sizes using the elementary concepts of module theory is presented. The codes possess a high degree of symmetry. Codes with two information symbols over arbitrary alphabet sizes are cyclic reversible. For alphabet sizes which are a power of two or an odd prime number, codes with one information symbol are reversible and equidistant, and codes having more than two information symbols are quasi-cyclic reversible. Binary Reed-Muller codes arise as subcodes of the codes presented. A method of constructing equidistant Lee metric codes analogous to maximum length shift register codes is presented.Keywords
This publication has 6 references indexed in Scilit:
- On channels and codes for the Lee metricInformation and Control, 1971
- Lessons on Rings, Modules and MultiplicitiesPublished by Cambridge University Press (CUP) ,1968
- An upper bound on minimum distance for a k-ary codeInformation and Control, 1968
- Some properties of nonbinary error-correcting codesIEEE Transactions on Information Theory, 1958
- A class of multiple-error-correcting codes and the decoding schemeTransactions of the IRE Professional Group on Information Theory, 1954
- Application of Boolean algebra to switching circuit design and to error detectionTransactions of the I.R.E. Professional Group on Electronic Computers, 1954