Two series of equitable symbol weight codes meeting the Plotkin bound

DOI10.1007/s10623-013-9846-zzbMath1329.94097OpenAlexW1972713093MaRDI QIDQ488246

Jianxing Yin, Peipei Dai, Jian Min Wang

Publication date: 23 January 2015

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

Full work available at URL: https://doi.org/10.1007/s10623-013-9846-z

zbMATH Keywords

optimalitydesignsequitable symbol weight codes

Mathematics Subject Classification ID

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

Related Items

Optimal almost equisymbol codes based on difference matrices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generalized balanced tournament designs with block size four
• The existence of near generalized balanced tournament designs
• On the construction of \(q\)-ary equidistant codes
• Constructions of optimal GDRP\((n,\lambda ;v)\)'s of type \(\lambda^1\mu^{m - 1}\)
• Generalized balanced tournament designs and related codes
• A class of optimal constant composition codes from GDRPs
• The existence of FGDRP\((3,g^{u})\)'s
• Existence results for generalized balanced tournament designs with block size 3
• Constructions for generalized balanced tournament designs
• The existence of Kirkman squares -- doubly resolvable \((v,3,1)\)-BIBDs
• Generalized Balanced Tournament Designs
• Generalized Balanced Tournament Packings and Optimal Equitable Symbol Weight Codes for Power Line Communications
• Construction of Room Squares