A class of optimal constant composition codes from GDRPs

DOI10.1007/S10623-008-9214-6MaRDI QIDQ1009096zbMATH OpenOpenAlexFDO

Authors Jie Yan, Jianxing Yin

Publication date 31 March 2009

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10623-008-9214-6

zbMATH Keywords

constant composition codes

Mathematics Subject Classification ID

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

Recommendations

• Constructions of a class of optimal constant composition codes
• A construction of optimal constant composition codes
• A construction and bounds of constant composition codes
• A New Construction for Constant-Composition Codes
• Combinatorial Constructions of Optimal Constant-Composition Codes
• A new combinatorial approach to the construction of constant composition codes
• A Family of Optimal Constant-Composition Codes
• On constant composition codes
• On optimal constacyclic codes
• Construction of optimal codes from a class of constacyclic codes

Cites work

• scientific article; zbMATH DE number 1522575 (Why is no real title available?)
• scientific article; zbMATH DE number 1382769 (Why is no real title available?)
• scientific article; zbMATH DE number 917328 (Why is no real title available?)
• A construction of optimal constant composition codes
• Combinatorial Constructions of Optimal Constant-Composition Codes
• Construction of Room Squares
• Constructions of optimal GDRP\((n,\lambda ;v)\)'s of type \(\lambda^1\mu^{m - 1}\)
• Cyclotomy and difference families in elementary Abelian groups
• Generalized balanced tournament designs and related codes
• On constant composition codes
• On constant-composition codes over Z/sub q/
• The CRC handbook of combinatorial designs
• The PBD-Closure of Constant-Composition Codes

Cited in

(12)

• Generalized balanced tournament designs with block size four
• Room squares with super-simple property
• Near generalized balanced tournament designs with block sizes 4 and 5
• Constant composition codes as subcodes of linear codes
• Combinatorial Constructions of Optimal Constant-Composition Codes
• The PBD-Closure of Constant-Composition Codes
• Complete weight enumerators of some linear codes and their applications
• Constructions of optimal GDRP\((n,\lambda ;v)\)'s of type \(\lambda^1\mu^{m - 1}\)
• Approximate generalized Steiner systems and near-optimal constant weight codes
• Optimal ternary constant-composition codes with weight four and distance six
• Two series of equitable symbol weight codes meeting the Plotkin bound
• Constructions of a class of optimal constant composition codes

This page was built for publication: A class of optimal constant composition codes from GDRPs

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