Bounds and constructions for ternary constant-composition codes
From MaRDI portal
Publication:4544766
DOI10.1109/18.971741zbMATH Open1059.94046OpenAlexW2155659880MaRDI QIDQ4544766FDOQ4544766
Authors: Mattias Svanström, Patric R. J. Östergård, Galina T. Bogdanova 
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
Recommendations
Cited In (24)
- QPlus: computer package for coding theory research and education
- Optimal ternary constant-composition codes with weight four and distance three
- Title not available (Why is that?)
- 4-\({}^{\ast}\text{GDD}(6^n)\)s and related optimal quaternary constant-weight codes
- Enumeration of optimal ternary constant-composition codes
- Room squares with super-simple property
- Constructions of ternary constant-composition codes with weight three
- Completely reducible super-simple designs with block size four and related super-simple packings
- New ternary and quaternary constant-weight equidistant codes
- On the constructions of constant-composition codes from perfect nonlinear functions
- A construction of optimal constant composition codes
- Constructions of optimal GDRP\((n,\lambda ;v)\)'s of type \(\lambda^1\mu^{m - 1}\)
- Decompositions of edge-colored digraphs: a new technique in the construction of constant-weight codes and related families
- On constant composition codes
- Title not available (Why is that?)
- Approximate generalized Steiner systems and near-optimal constant weight codes
- Optimal ternary constant-composition codes with weight four and distance six
- Title not available (Why is that?)
- Completely reducible super-simple designs with block size five and index two
- A new combinatorial approach to the construction of constant composition codes
- On the construction of \(q\)-ary equidistant codes
- Construction of optimal ternary constant weight codes via Bhaskar Rao designs
- Forbiddance and capacity
- Title not available (Why is that?)
Uses Software
This page was built for publication: Bounds and constructions for ternary constant-composition codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4544766)
