Abstract
Almost all nonbinary codes were designed for the Hamming metric. The Lee metric was defined by Lee in 1958. Golomb and Welch (1968) and Berlekamp, 1968a, Berlekamp, 1968b have designed codes for the Lee metric. In this paper, we derive all the discrete, memoryless, symmetric channels matched to the Lee metric, and investigate general properties of Lee metric block codes. Finally, a class of cyclic Lee metric codes is defined and the number of information symbols is discussed.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
