A construction of optimal constant composition codes
From MaRDI portal
Publication:851744
DOI10.1007/s10623-006-0004-8zbMath1181.94126OpenAlexW2030171660MaRDI QIDQ851744
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
Related Items (25)
A class of linear codes with their complete weight enumerators over finite fields ⋮ Weight distributions for projective binary linear codes from Weil sums ⋮ Complete weight enumerators of some cyclic codes ⋮ Equidistant frequency permutation arrays and related constant composition codes ⋮ Three-weight linear codes from Weil sums ⋮ Complete weight enumerators of three classes of linear codes ⋮ A construction of linear codes and their complete weight enumerators ⋮ Complete weight enumerators of a class of linear codes with two weights ⋮ On the weight distributions of a class of cyclic codes ⋮ Room squares with super-simple property ⋮ Complete weight enumerators of a class of linear codes ⋮ Types of spreads and duality of the parallelisms of \(\mathrm{PG}(3,5)\) with automorphisms of order 13 ⋮ A new combinatorial approach to the construction of constant composition codes ⋮ Optimal ternary constant-composition codes with weight four and distance six ⋮ A class of three-weight linear codes and their complete weight enumerators ⋮ Constructions of optimal GDRP\((n,\lambda ;v)\)'s of type \(\lambda^1\mu^{m - 1}\) ⋮ Complete weight enumerators of a family of three-weight linear codes ⋮ Linear codes from quadratic forms ⋮ A class of linear codes and their complete weight enumerators ⋮ Complete weight enumerators of a class of linear codes over finite fields ⋮ Generalized balanced tournament designs and related codes ⋮ A class of optimal constant composition codes from GDRPs ⋮ Complete weight enumerators of a class of linear codes with two or three weights ⋮ Generalized Balanced Tournament Packings and Optimal Equitable Symbol Weight Codes for Power Line Communications ⋮ Equidistant permutation group codes
Cites Work
- Unnamed Item
- Bounds for permutation arrays
- Existence of balanced incomplete block designs for many sets of treatments
- On resolvable designs
- Constructions of ternary constant-composition codes with weight three
- Frequency permutation arrays
- Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares
- Combinatorial Constructions of Optimal Constant-Composition Codes
- On constant-composition codes over Z/sub q/
- Combinatorial Designs
- Bounds and constructions for ternary constant-composition codes
- Error-correcting codes over an alphabet of four elements
This page was built for publication: A construction of optimal constant composition codes
