New LP-based Upper Bounds in the Rate-vs.-Distance Problem for Linear Codes

G. Szegö, Orthogonal polynomials . American Mathematical Soc., 1939, vol. 23

1939

Earlier work this paper cites.

E. N. Gilbert, “A comparison of signalling alphabets,” The Bell system technical journal , vol. 31, no. 3, pp. 504–522, 1952

1952

Earlier work this paper cites.

R. R. Varshamov, “Estimate of the number of signals in error correcting codes,” Docklady Akad. Nauk, SSSR , vol. 117, pp. 739–741, 1957

1957

Earlier work this paper cites.

P. Delsarte, “An algebraic approach to the association schemes of coding theory,” Philips Res. Rep. Suppl. , vol. 10, pp. vi+–97, 1973

1973

Earlier work this paper cites.

R. McEliece, E. Rodemich, H. Rumsey, and L. Welch, “New upper bounds on the rate of a code via the delsarte-macwilliams inequalities,” IEEE transactions on Information Theory , vol. 23, no. 2, pp. 157–166, 1977

1977

Earlier work this paper cites.

A. Barg and D. B. Jaffe, “Numerical results on the asymptotic rate of binary codes.” Codes and Association Schemes , vol. 56, pp. 25–32, 1999

1999

Earlier work this paper cites.

J. Friedman and J.-P. Tillich, “Generalized alon–boppana theorems and error-correcting codes,” SIAM Journal on Discrete Mathematics , vol. 19, no. 3, pp. 700–718, 2005

2005

Earlier work this paper cites.

M. Navon and A. Samorodnitsky, “On delsarte’s linear programming bounds for binary codes,” in 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS’05) . IEEE, 2005, pp. 327–336

2005

Earlier work this paper cites.

A. Schrijver, “New code upper bounds from the terwilliger algebra and semidefinite programming,” IEEE Transactions on Information Theory , vol. 51, no. 8, pp. 2859–2866, 2005

2005

Cited alongside, same era.

A. M. Barg and D. Y. Nogin, “Spectral approach to linear programming bounds on codes,” Problems of Information Transmission , vol. 42, no. 2, pp. 77–89, 2006

2006

Cited alongside, same era.

D. L. Applegate, W. Cook, S. Dash, and D. G. Espinoza, “Exact solutions to linear programming problems,” Operations Research Letters , vol. 35, no. 6, pp. 693–699, 2007

2007

Cited alongside, same era.

A. Barg and D. Nogin, “A functional view of upper bounds on codes,” in Coding and cryptology . World Scientific, 2008, pp. 15–24

2008

Cited alongside, same era.

——, “Linear programming bounds for codes via a covering argument,” Discrete & Computational Geometry , vol. 41, no. 2, pp. 199–207, 2009

R. O’Donnell, Analysis of boolean functions . Cambridge University Press, 2014

2014

Later among the works it cites.

C. F. Dunkl and Y. Xu, Orthogonal polynomials of several variables . Cambridge University Press, 2014, no. 155

2014

Later among the works it cites.

——, “Iterative refinement for linear programming,” INFORMS Journal on Computing , vol. 28, no. 3, pp. 449–464, 2016

2016

Later among the works it cites.

G. Gamrath, D. Anderson, K. Bestuzheva, W.-K. Chen, L. Eifler, M. Gasse, P. Gemander, A. Gleixner, L. Gottwald, K. Halbig et al. , “The scip optimization suite 7.0,” 2020

2020

Later among the works it cites.

L. N. Coregliano, F. G. Jeronimo, and C. Jones, “A complete linear programming hierarchy for linear codes,” arXiv preprint arXiv:2112.09221 , 2021

Original

2021

Later among the works it cites.