A construction of optimal constant composition codes
From MaRDI portal
Publication:851744
DOI10.1007/S10623-006-0004-8zbMATH Open1181.94126OpenAlexW2030171660MaRDI QIDQ851744FDOQ851744
Authors: Cunsheng Ding, Jianxing Yin 
Publication date: 22 November 2006
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-006-0004-8
Recommendations
- Constructions of a class of optimal constant composition codes
- Combinatorial Constructions of Optimal Constant-Composition Codes
- A new combinatorial approach to the construction of constant composition codes
- Constant composition codes as subcodes of linear codes
- A Construction for Constant-Composition Codes
Cites Work
- Combinatorial Designs
- Title not available (Why is that?)
- Bounds for permutation arrays
- Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares
- On constant-composition codes over Z/sub q/
- On resolvable designs
- Frequency permutation arrays
- Constructions of ternary constant-composition codes with weight three
- Combinatorial Constructions of Optimal Constant-Composition Codes
- Bounds and constructions for ternary constant-composition codes
- Error-correcting codes over an alphabet of four elements
- Existence of balanced incomplete block designs for many sets of treatments
Cited In (35)
- Construction of constant composition codes based on cyclic codes
- A Family of Optimal Constant-Composition Codes
- On constant-composition codes over Z/sub q/
- A Construction for Constant-Composition Codes
- Three-weight linear codes from Weil sums
- Room squares with super-simple property
- Generalized balanced tournament designs and related codes
- Constant composition codes as subcodes of linear codes
- On the constructions of constant-composition codes from perfect nonlinear functions
- Types of spreads and duality of the parallelisms of \(\mathrm{PG}(3,5)\) with automorphisms of order 13
- Weight distributions for projective binary linear codes from Weil sums
- Combinatorial Constructions of Optimal Constant-Composition Codes
- The PBD-Closure of Constant-Composition Codes
- Complete weight enumerators of some cyclic codes
- Equidistant permutation group codes
- Complete weight enumerators of a class of linear codes
- Constructions of optimal GDRP\((n,\lambda ;v)\)'s of type \(\lambda^1\mu^{m - 1}\)
- A class of optimal constant composition codes from GDRPs
- Complete weight enumerators of three classes of linear codes
- A New Construction for Constant-Composition Codes
- Optimal ternary constant-composition codes with weight four and distance six
- A class of linear codes and their complete weight enumerators
- Complete weight enumerators of a class of linear codes over finite fields
- Complete weight enumerators of a class of linear codes with two or three weights
- Complete weight enumerators of a class of linear codes with two weights
- Equidistant frequency permutation arrays and related constant composition codes
- A new combinatorial approach to the construction of constant composition codes
- A class of three-weight linear codes and their complete weight enumerators
- Complete weight enumerators of a family of three-weight linear codes
- A construction of linear codes and their complete weight enumerators
- A class of linear codes with their complete weight enumerators over finite fields
- Generalized balanced tournament packings and optimal equitable symbol weight codes for power line communications
- Linear codes from quadratic forms
- A construction and bounds of constant composition codes
- On the weight distributions of a class of cyclic codes
This page was built for publication: A construction of optimal constant composition codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q851744)
