Abstract

A cyclic code of length n over the ring Z2m of integer of modulo 2m is a linear code with property that if the codeword (c0, c1, cn-1) in āˆˆ C then the cyclic shift (c1, c2, c0) in math āˆˆ C. Quadratic residue (abbreviated QR) codes are a particularly interesting family of cyclic codes. We define such family of codes in terms of their idem potent generators and show that these codes also have many good properties which are analogous in many respects to properties of binary QR codes. Such codes constructed are self-orthogonal. And we also discuss their minimum hamming weight.

Full Text
Paper version not known

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 call

Disclaimer: 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.