The Sizes of Optimal $q$-Ary Codes of Weight Three and Distance Four: A Complete Solution
From MaRDI portal
Publication:3604626
DOI10.1109/TIT.2007.915885zbMath1311.94113arXiv0803.3658OpenAlexW2127725198MaRDI QIDQ3604626
San Ling, Alan C. H. Ling, Son Hoang Dau, Yeow Meng Chee
Publication date: 24 February 2009
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0803.3658
Related Items (7)
A family of diameter perfect constant-weight codes from Steiner systems ⋮ Completely reducible super-simple designs with block size four and related super-simple packings ⋮ Decompositions of Edge-Colored Digraphs: A New Technique in the Construction of Constant-Weight Codes and Related Families ⋮ Completely reducible super-simple designs with block size five and index two ⋮ 4‐*GDD(6n)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: The Sizes of Optimal $q$-Ary Codes of Weight Three and Distance Four: A Complete Solution
