A class of optimal constant composition codes from GDRPs

DOI10.1007/S10623-008-9214-6zbMath1181.94134OpenAlexW2073905497MaRDI QIDQ1009096

Jianxing Yin, Jie Yan

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)

Related Items (6)

Complete weight enumerators of some linear codes and their applications ⋮ Generalized balanced tournament designs with block size four ⋮ Room squares with super-simple property ⋮ Optimal ternary constant-composition codes with weight four and distance six ⋮ Two series of equitable symbol weight codes meeting the Plotkin bound ⋮ Near generalized balanced tournament designs with block sizes 4 and 5

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A construction of optimal constant composition codes
• Constructions of optimal GDRP\((n,\lambda ;v)\)'s of type \(\lambda^1\mu^{m - 1}\)
• Generalized balanced tournament designs and related codes
• On constant composition codes
• Cyclotomy and difference families in elementary Abelian groups
• Combinatorial Constructions of Optimal Constant-Composition Codes
• On constant-composition codes over Z/sub q/
• The PBD-Closure of Constant-Composition Codes
• Construction of Room Squares

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