Bounds and constructions for ternary constant-composition codes
From MaRDI portal
Publication:4544766
DOI10.1109/18.971741zbMath1059.94046OpenAlexW2155659880MaRDI QIDQ4544766
Patric R. J. Östergård, Galina T. Bogdanova, Mattias Svanström
Publication date: 4 August 2002
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.971741
Related Items (16)
A construction of optimal constant composition codes ⋮ Completely reducible super-simple designs with block size four and related super-simple packings ⋮ Decompositions of Edge-Colored Digraphs: A New Technique in the Construction of Constant-Weight Codes and Related Families ⋮ Room squares with super-simple property ⋮ Construction of optimal ternary constant weight codes via Bhaskar Rao designs ⋮ Optimal ternary constant-composition codes with weight four and distance three ⋮ A new combinatorial approach to the construction of constant composition codes ⋮ QPlus: computer package for coding theory research and education ⋮ Optimal ternary constant-composition codes with weight four and distance six ⋮ Completely reducible super-simple designs with block size five and index two ⋮ On the construction of \(q\)-ary equidistant codes ⋮ NEW TERNARY AND QUATERNARY CONSTANT-WEIGHT EQUIDISTANT CODES ⋮ 4‐*GDD(6n)s and Related Optimal Quaternary Constant‐Weight Codes ⋮ Constructions of optimal GDRP\((n,\lambda ;v)\)'s of type \(\lambda^1\mu^{m - 1}\) ⋮ On constant composition codes ⋮ On the constructions of constant-composition codes from perfect nonlinear functions
Uses Software
This page was built for publication: Bounds and constructions for ternary constant-composition codes
