New LP-Based Upper Bounds in the Rate-Vs.-Distance Problem for Binary Linear Codes
Sign Up to like & getrecommendations! Published in 2023 at "IEEE Transactions on Information Theory"
DOI: 10.1109/tit.2023.3236660
Abstract: We develop a new family of linear programs, that yield upper bounds on the rate of binary linear codes of a given distance. Our bounds apply only to linear codes. Delsarte’s LP is the weakest… read more here.
Keywords: upper bounds; linear codes; bounds rate; binary linear ... See more keywords