On the Linear Programming Bound for Lee-codes
Helena Astola, Ioan Tabus
TL;DR
This paper refines the linear programming bound for Lee-codes, providing tighter bounds for linear codes, and introduces computational improvements including a recursive method for Lee-number calculation.
Contribution
The paper introduces new refinements to the linear programming bound for Lee-codes and develops a recursive method for computing Lee-numbers, enhancing computational efficiency.
Findings
Refined linear programming bounds for Lee-codes.
A more compact computational program for bounds.
A recursive method for Lee-number computation.
Abstract
Finding the largest code with a given minimum distance is one of the most basic problems in coding theory. In this paper, we study the linear programming bound for codes in the Lee metric. We introduce refinements on the linear programming bound for linear codes in the Lee metric, which give a tighter bound for linear codes. We also discuss the computational aspects of the problem and introduce a more compact program by the obtained refinements, and a recursive method for computing the so-called Lee-numbers, which are important in the computation of the linear programming bound.
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 · DNA and Biological Computing