A new combinatorial approach to the construction of constant composition codes

DOI10.1007/S11425-008-0036-9MaRDI QIDQ931533zbMATH OpenOpenAlexFDO

Authors Jianxing Yin, Yu Tang

Publication date 25 June 2008

Published in Science in China. Series A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11425-008-0036-9

zbMATH Keywords

binary constant weight codescombinatorial designcomposition codesconstant composition codesoptimal constant

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Combinatorial codes (94B25)

Review text

The main purpose of this paper is to introduce a feasible combinatorial approach to obtain optimal constant composition codes which are generalization of binary constant weight codes. The approach followed is different from the known ones used in the constructions of constant composition codes (CCCs). The construction uses the notion of a transversal design. The authors have illustrated the application of this approach to two types of optimal CCCs also. The approach taken in this paper may result in some more types of optimal CCCs.

Recommendations

• A New Construction for Constant-Composition Codes
• A construction and bounds of constant composition codes
• A construction of optimal constant composition codes
• Constructions of a class of optimal constant composition codes
• Combinatorial Constructions of Optimal Constant-Composition Codes
• A Construction for Constant-Composition Codes
• On constant composition codes
• Construction of constant composition codes based on cyclic codes
• Algebraic Constructions of Constant Composition Codes
• scientific article; zbMATH DE number 218228

Cites work

• A construction of optimal constant composition codes
• A Family of Optimal Constant-Composition Codes
• A survey on maximum distance holey packings
• Algebraic Constructions of Constant Composition Codes
• Bounds and constructions for ternary constant-composition codes
• Combinatorial Constructions of Optimal Constant-Composition Codes
• Constructions of ternary constant-composition codes with weight three
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 3252237 (Why is no real title available?)
• scientific article; zbMATH DE number 2235051 (Why is no real title available?)
• Maximum distance holey packings and related codes
• On constant composition codes
• On constant-composition codes over Z/sub q/
• ON THE CONSTRUCTION OF BALANCED INCOMPLETE BLOCK DESIGNS
• Optimal constant weight codes over \(Z_k\) and generalized designs
• Packing designs with equal-sized holes
• The CRC handbook of combinatorial designs
• The PBD-Closure of Constant-Composition Codes

Cited in

(13)

• A class of optimal constant composition codes from GDRPs
• Constant composition codes as subcodes of linear codes
• On the constructions of constant-composition codes from perfect nonlinear functions
• Room squares with super-simple property
• A Family of Optimal Constant-Composition Codes
• Combinatorial Constructions of Optimal Constant-Composition Codes
• Constructions of a class of optimal constant composition codes
• Optimal ternary constant-composition codes with weight four and distance six
• New Construction of Complementary Sequence (or Array) Sets and Complete Complementary Codes
• A New Construction for Constant-Composition Codes
• Generic constructions for partitioned difference families with applications: a unified combinatorial approach
• A construction of optimal constant composition codes
• Constructions of optimal GDRP\((n,\lambda ;v)\)'s of type \(\lambda^1\mu^{m - 1}\)

This page was built for publication: A new combinatorial approach to the construction of constant composition codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q931533)