Abstract
The exact number of nonperiodic cyclic equivalence classes (NCEC) in cyclic code is determined. By NCEC, several algebraic constructions of cyclically permutable (CP) codes are given in this paper. These constructions can yield good (large size) CP codes. Furthermore, we present detailed discussions for some well known cyclic codes. By using the above CP codes, we can obtain good (large size) binary constant weight CP codes and protocol-sequence sets for collision channel without feedback according the methods in [1].
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.