A lower bound for ternary constant weight codes

DOI10.1109/18.623164zbMath0884.94030OpenAlexW2024315045MaRDI QIDQ4371910

Mattias Svanström

Publication date: 21 January 1998

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

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

zbMATH Keywords

boundternary codesconstant-weight codes

Mathematics Subject Classification ID

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

Related Items (7)

The completion of optimal cyclic quaternary codes of weight 3 and distance 3 ⋮ 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 ⋮ Two-weight codes: upper bounds and new optimal constructions ⋮ Hanani triple packings and optimal \(q\)-ary codes of constant weight three

This page was built for publication: A lower bound for ternary constant weight codes