The Sizes of Optimal q-Ary Codes of Weight Three and Distance Four: A Complete Solution
Yeow Meng Chee, Son Hoang Dau, Alan C. H. Ling, and San Ling
TL;DR
This paper introduces new constructive methods to fully determine the sizes of optimal q-ary codes with constant weight three and minimum distance four, advancing coding theory knowledge.
Contribution
The paper presents two novel constructive techniques that complete the classification of optimal q-ary codes of weight three and distance four.
Findings
Complete characterization of optimal q-ary codes of weight three and distance four.
Introduction of two new constructive techniques for code determination.
Advancement in the theoretical understanding of code sizes.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.