New LP-Based Upper Bounds in the Rate-Vs.-Distance Problem for Binary Linear Codes.
Elyassaf LoyferNati LinialPublished in: IEEE Trans. Inf. Theory (2023)
Keyphrases
- upper bound
- code length
- lower bound
- minimum distance
- error correcting codes
- hamming distance
- gray code
- linear programming
- linear functions
- upper and lower bounds
- error correcting
- distance measure
- branch and bound
- worst case
- lower and upper bounds
- error correction
- linear program
- logical operations
- tight bounds
- optimal solution
- quadratic program
- np hard
- binary codes
- quadratic programming
- approximation algorithms
- euclidean distance
- non binary
- linear systems
- multi class