New Inequalities for q-ary Constant-Weight Codes
Hyun Kwang Kim, Phan Thanh Toan
TL;DR
This paper introduces new inequalities for q-ary constant-weight codes by applying double counting techniques to improve existing bounds, advancing the theoretical understanding of these codes.
Contribution
The paper develops novel inequalities for q-ary constant-weight codes using double counting, extending Delsarte inequalities and providing tighter bounds.
Findings
Derived new inequalities for q-ary constant-weight codes.
Improved bounds for code parameters using the new inequalities.
Extended Delsarte inequalities to constant-weight codes.
Abstract
Using double counting, we prove Delsarte inequalities for -ary codes and their improvements. Applying the same technique to -ary constant-weight codes, we obtain new inequalities for -ary constant-weight codes.
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.
Taxonomy
TopicsCoding theory and cryptography · graph theory and CDMA systems · Advanced Wireless Communication Techniques