The Sizes of Optimal q-Ary Codes of Weight Three and Distance Four: A Complete Solution

DOI10.1109/TIT.2007.915885zbMATH Open1311.94113arXiv0803.3658OpenAlexW2127725198MaRDI QIDQ3604626FDOQ3604626

Authors: Yeow Meng Chee, Son Hoang Dau, Alan C. H. Ling, San Ling 

Publication date: 24 February 2009

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

Abstract: This correspondence introduces two new constructive techniques to complete the determination of the sizes of optimal q-ary codes of constant weight three and distance four.

Full work available at URL: https://arxiv.org/abs/0803.3658

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Cited In (8)

• Hanani triple packings and optimal \(q\)-ary codes of constant weight three
• 4-\({}^{\ast}\text{GDD}(6^n)\)s and related optimal quaternary constant-weight codes
• Completely reducible super-simple designs with block size four and related super-simple packings
• On a class of optimal constant weight codes
• Decompositions of edge-colored digraphs: a new technique in the construction of constant-weight codes and related families
• A family of diameter perfect constant-weight codes from Steiner systems
• Completely reducible super-simple designs with block size five and index two
• Two-weight codes: upper bounds and new optimal constructions

This page was built for publication: The Sizes of Optimal $q$-Ary Codes of Weight Three and Distance Four: A Complete Solution

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604626)