On the Svanstrom bound for ternary constant-weight codes

DOI10.1109/18.930943zbMath1017.94031OpenAlexW2162269346MaRDI QIDQ4544648

Victor K. Wei, Fang-Wei Fu, Torleiv Kløve, Yuan Luo

Publication date: 4 August 2002

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.930943

zbMATH Keywords

ternary codesSkolem sequencesconstant-weight codesSvanström bound

Mathematics Subject Classification ID

Bounds on codes (94B65) Other types of codes (94B60)

Related Items (5)

Completely reducible super-simple designs with block size four and related super-simple packings ⋮ Construction of optimal ternary constant weight codes via Bhaskar Rao designs ⋮ Completely reducible super-simple designs with block size five and index two ⋮ 4‐*GDD(6ⁿ)s and Related Optimal Quaternary Constant‐Weight Codes ⋮ Hanani triple packings and optimal \(q\)-ary codes of constant weight three

This page was built for publication: On the Svanstrom bound for ternary constant-weight codes