Constructions of binary constant-weight cyclic codes and cyclically permutable codes
From MaRDI portal
Publication:4008327
DOI10.1109/18.135636zbMath0749.94019OpenAlexW2133322225MaRDI QIDQ4008327
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
Reed-Solomon codesminimum distancecollision channel without feedbackJohnson upper bound\(p\)-ary linear cyclic codeBerlekamp-Justesen maximum-distance-separable codesconstant- weight cyclically permutable codesconstant-weight binary cyclic codelow-rate Plotkin upper boundprotocol-sequence
Related Items (33)
The completion of optimal cyclic quaternary codes of weight 3 and distance 3 ⋮ New explicit binary constant weight codes from Reed-Solomon codes ⋮ On the weight distributions of some cyclic codes ⋮ Optimal strongly conflict-avoiding codes of even length and weight three ⋮ Optimal equi-difference conflict-avoiding codes of odd length and weight three ⋮ Equidistant frequency permutation arrays and related constant composition codes ⋮ A tight asymptotic bound on the size of constant-weight conflict-avoiding 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. ⋮ Certain diagonal equations and conflict-avoiding codes of prime lengths ⋮ New families of asymptotically optimal doubly periodic arrays with ideal correlation constraints ⋮ New optimal constructions of conflict-avoiding codes of odd length and weight 3 ⋮ A new construction for \(q\)-ary constant weight codes ⋮ Unified combinatorial constructions of optimal optical orthogonal codes ⋮ Conflict-avoiding codes and cyclic triple systems ⋮ Classification of optimal \((v,k,1)\) binary cyclically permutable constant weight codes with \(k=5, 6\) and \(7\) and small lengths ⋮ Recursion polynomials of unfolded sequences ⋮ Cyclically permutable representations of cyclic codes ⋮ Coding for a multiple access OR channel: A survey ⋮ Constructions of cyclic quaternary constant-weight codes of weight three and distance four ⋮ Optical orthogonal codes and arcs in \(\mathrm{PG}(d,q)\) ⋮ A new series of optimal tight conflict-avoiding codes of weight 3 ⋮ Classes of optical orthogonal codes from ARCS in root subspaces ⋮ On the nonperiodic cyclic equivalance classes of Hamming codes and BCH codes ⋮ Optimal Tight Equi‐Difference Conflict‐Avoiding Codes of Length n = 2k ± 1 and Weight 3 ⋮ Optimal conflict-avoiding codes of length \(n\equiv 0\pmod{16}\) and weight 3 ⋮ On the cyclic order distribution and partitioning of linear cyclic codes ⋮ Improved linear programming bound on sizes of doubly constant-weight codes ⋮ Necessary and sufficient conditions for tight equi-difference conflict-avoiding codes of weight three ⋮ Several classes of \((2^{m}-1,w,2)\) optical orthogonal codes ⋮ Classification of optimal \((v, 4, 1)\) binary cyclically permutable constant-weight codes and cyclic \(2\)-\((v, 4, 1)\) designs with \(v \leq 76\). ⋮ Maximum \(w\)-cyclic holey group divisible packings and their application to three-dimensional optical orthogonal codes ⋮ 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
