Constructions of Binary Constant-Weight Quasi-Cyclic Codes and Quasi-Cyclically Permutable Codes
Main Article Content
Abstract
A theorem is proven showing how to obtain a constant-weight binary quasi-cyclic code from a p^r-ary linear cyclic code, where p is a prime and r is a positive integer, r ≥ 1, by using a representation of the elements of a Galois field, GF(p^r ), as cyclic shifts of a binary p^r -tuple. From this theorem, constructions are derived for two classes of constant-weight binary quasi-cyclic codes. These two classes are shown to achieve the Johnson upper bound on the number of codewords asymptot- ically for long blocklengths. A quasi-cyclically permutable (QCP) code is a binary code such that the codewords are quasi-cyclically distinct and have cyclic order equal to the code blocklength. A technique is described for selecting virtually the maximum number of cyclically distinct codewords of full cyclic order from Reed-Solomon (RS) codes and from Berlekamp-Justesen (BJ) codes, both known to be maximum distance separable codes. Those cyclically distinct codewords of full cyclic order from RS codes and from BJ codes are mapped to binary to produce two classes of asymptotically optimum constant-weight quasi- cyclic codes and two classes of asymptotically optimum constant- weight QCP codes. An application of QCP codes is introduced to construct protocol-sequence sets for the M-active-out-of-T users collision channel without feedback, allowing more users than strict cyclically permutable codes with the same blocklength and minimum distance.
Downloads
Article Details
![Creative Commons License](http://i.creativecommons.org/l/by/4.0/88x31.png)
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors who publish in this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors can enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) before and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
___________
Accepted 2024-07-02
Published 2024-07-08