Abstract
A new class of cyclic codes of length 2n over GF(q) is proposed, where q is a prime of the form 8m ± 3 and n > 3 is an integer. These codes are defined in terms of their generator polynomials. These codes have many properties analogous to those of duadic codes. Generator polynomials of some duadic codes of length pn over GF(q) are also discussed, where p is an odd prime, n is an integer and q = ρ or ρ2 for some prime ρ.
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 callMore From: International Journal of Information and Coding Theory
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.
