Abstract
We classify optimal (v, k, 1) binary cyclically permutable constant weight (CPCW) codes with small v and $$k=5, 6$$ and 7. Binary CPCW codes have multiple applications in contemporary communications and are closely related to cyclic binary constant weight codes, difference packings, optical orthogonal codes, cyclic difference families and cyclic block designs. The presented small length codes can be used in relevant applications, as well as with recursive constructions for bigger lengths. We also establish that a (127, 7, 1) cyclic difference family does not exist.
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.
