Abstract
Linear q-ary codes of growing length n/spl rarr//spl infin/ and designed distance /spl delta/ are studied. At first, we examine cyclic codes defined by the sets of code zeros {g/sup i/|i=q/sup s/+1, q/sup s+1/+1, /spl middot//spl middot//spl middot/, q/sup s+/spl delta/-2/+1} over a primitive element g of GF(q/sup m/). Then special cubic varieties are designed and employed in order to attain distances /spl delta/=5, 6. The resulting double-error-correcting codes of length n=q/sup m/ have r/spl les/2m+[m/3]+1 parity check symbols, and reduce the best known redundancy by [2m/3] symbols. A decoding procedure of complexity O(rn) operations is also considered.
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.
