Constructions of binary constant-weight cyclic codes and cyclically permutable codes

DOI10.1109/18.135636MaRDI QIDQ4008327zbMATH OpenOpenAlexFDO

Authors Nguyen Quang A, László Györfi, James L. Massey

Publication date 27 September 1992

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/18.135636

zbMATH Keywords

\(p\)-ary linear cyclic codeBerlekamp-Justesen maximum-distance-separable codescollision channel without feedbackconstant- weight cyclically permutable codesconstant-weight binary cyclic codeJohnson upper boundlow-rate Plotkin upper boundminimum distanceprotocol-sequenceReed-Solomon codes

Mathematics Subject Classification ID

Cyclic codes (94B15) Bounds on codes (94B65)

Recommendations

• Constructions for optimal constant weight cyclically permutable codes and difference families
• Cyclically permutable representations of cyclic codes
• New constructions of optimal cyclically permutable constant weight codes
• scientific article; zbMATH DE number 2077104
• On the constructions of constant-weight codes

Cited in

(45)

• Necessary and sufficient conditions for tight equi-difference conflict-avoiding codes of weight three
• Binary permutation sequences as subsets of Levenshtein codes, spectral null codes, run-length limited codes and constant weight codes
• Optimal constant weight codes over \(Z_k\) and generalized designs
• Periodic distribution of generalized B-J codes and constructions of cyclically permutable (CP) codes.
• Classification of optimal \((v,k,1)\) binary cyclically permutable constant weight codes with \(k=5, 6\) and \(7\) and small lengths
• Constructions of cyclic quaternary constant-weight codes of weight three and distance four
• Improved linear programming bound on sizes of doubly constant-weight codes
• Several classes of \((2^{m}-1,w,2)\) optical orthogonal codes
• On the cyclic order distribution and partitioning of linear cyclic codes
• Maximum \(w\)-cyclic holey group divisible packings and their application to three-dimensional optical orthogonal codes
• The completion of optimal cyclic quaternary codes of weight 3 and distance 3
• Recursion polynomials of unfolded sequences
• New explicit binary constant weight codes from Reed-Solomon codes
• Unified combinatorial constructions of optimal optical orthogonal codes
• Cyclically permutable representations of cyclic codes
• Optical orthogonal codes and arcs in \(\mathrm{PG}(d,q)\)
• Classes of optical orthogonal codes from ARCS in root subspaces
• Optimal equi-difference conflict-avoiding codes of odd length and weight three
• A tight asymptotic bound on the size of constant-weight conflict-avoiding codes
• On the weight distributions of some cyclic codes
• Optimal strongly conflict-avoiding codes of even length and weight three
• scientific article; zbMATH DE number 3873230 (Why is no real title available?)
• Coding for a Multiple Access OR Channel: a Survey
• Generating cyclically permutable codes (Corresp.)
• New optimal constructions of conflict-avoiding codes of odd length and weight 3
• scientific article; zbMATH DE number 2077104 (Why is no real title available?)
• New constructions of optimal cyclically permutable constant weight codes
• Constructions for optimal constant weight cyclically permutable codes and difference families
• Optimal tight equi-difference conflict-avoiding codes of length \(n = 2^{k} \pm 1\) and weight 3
• A new series of optimal tight conflict-avoiding codes of weight 3
• Distance-2 Cyclic Chaining of Constant-Weight Codes
• On the nonperiodic cyclic equivalance classes of Hamming codes and BCH codes
• Certain diagonal equations and conflict-avoiding codes of prime lengths
• A new construction for \(q\)-ary constant weight codes
• Balanced reconstruction codes for single edits
• \(q\)-ary \((1, k)\)-overlap-free codes with given restrictions
• Binary cyclic-gap constant weight codes with low-complexity encoding and decoding
• An update on optimal \((v,4,1)\) binary cyclically permutable constant weight codes and cyclic \(2-(v,4,1)\) designs with small \(v\)
• Perfect three-dimensional optical orthogonal codes with the AM-OPPS/TP property
• Optimal conflict-avoiding codes of length \(n\equiv 0\pmod{16}\) and weight 3
• Classification of optimal \((v, 4, 1)\) binary cyclically permutable constant-weight codes and cyclic \(2\)-\((v, 4, 1)\) designs with \(v \leq 76\).
• Equidistant frequency permutation arrays and related constant composition codes
• New families of asymptotically optimal doubly periodic arrays with ideal correlation constraints
• Conflict-avoiding codes and cyclic triple systems
• Coding for a multiple access OR channel: A survey

This page was built for publication: Constructions of binary constant-weight cyclic codes and cyclically permutable codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4008327)