Abstract
In this paper, we investigate the LCD repeated-root cyclic codes of length \(n=n'p^r\) over the finite field \(\mathbb {F}_q\), where gcd\((n',p)=1\). We give a necessary and sufficient condition for a repeated-root cyclic code to be LCD over \(\mathbb {F}_q\). We also determine the minimum distance of LCD repeated-root cyclic codes over \(\mathbb {F}_q\). Finally, we give the enumeration of LCD repeated-root cyclic codes of length n over \(\mathbb {F}_q\).
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.