New LP-based Upper Bounds in the Rate-vs.-Distance Problem for Linear Codes.
Elyassaf LoyferNati LinialPublished in: CoRR (2022)
Keyphrases
- upper bound
- lower bound
- minimum distance
- linear programming
- upper and lower bounds
- code length
- lower and upper bounds
- error correcting codes
- linear functions
- optimal solution
- distance function
- distance measure
- euclidean distance
- branch and bound algorithm
- linear systems
- worst case
- linear program
- closed form
- integer programming
- error correction