Abstract
Cyclic codes are a subclass of linear codes and have efficient encoding and decoding algorithms over finite fields, so they are widely used in many areas such as consumer electronics, data storage systems and communication systems. In this paper, by considering the solutions of certain equations over finite fields, one of the nine conjectures proposed by Ding and Helleseth about optimal cyclic codes in (IEEE Trans Inf Theory 59(9):5898–5904, 2013) is settled. In addition, we make progress toward other two conjectures.
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.
