Energy-minimizing error-correcting codes

P. Delsarte, “Bounds for unrestricted codes, by linear programming,” Philips Research Reports , vol. 27, pp. 272–289, 1972

1972

Earlier work this paper cites.

——, “An algebraic approach to the association schemes of coding theory,” Philips Research Reports Suppl. , vol. 10, 1973

1973

Earlier work this paper cites.

F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes . Amsterdam, the Netherlands: North-Holland Publishing Co., 1977

1977

Earlier work this paper cites.

M. R. Best, A. E. Brouwer, F. J. MacWilliams, A. M. Odlyzko, and N. J. A. Sloane, “Bounds for binary codes of length less than 25,” IEEE Trans. Inf. Theory , vol. 24, no. 1, pp. 81–93, Jan. 1978, doi: 10.1109/TIT.1978.1055827

1978

Earlier work this paper cites.

J. Simonis and C. de Vroedt, “A simple proof of the Delsarte inequalities,” Designs, Codes and Cryptography , vol. 1, no. 1, pp. 77–82, 1991, doi: 10.1007/BF00123961

1991

Earlier work this paper cites.

A. Ashikhmin and J. Simonis, “On the Delsarte inequalities,” Linear Algebra Applicat. , vol. 269, no. 1–3, pp. 197–217, Jan. 1998, doi: 10.1016/S0024-3795(97)00065-7

1998

Earlier work this paper cites.

P. Delsarte and V. I. Levenshtein, “Association schemes and coding theory,” IEEE Trans. Inf. Theory , vol. 44, no. 6, pp. 2477–2504, Oct. 1998, doi: 10.1109/18.720545

1998

Earlier work this paper cites.

A. Ashikhmin and A. Barg, “Binomial moments of the distance distribution: bounds and applications,” IEEE Trans. Inf. Theory , vol. 45, no. 2, pp. 438–452, Mar. 1999, doi: 10.1109/18.748994

1999

Cited alongside, same era.

V. A. Yudin, “The minimum of potential energy of a system of point charges,” Discrete Math. Applicat. , vol. 3, no. 1, pp. 75–81, 1993, doi: 10.1515/dma.1993.3.1.75

Original

2000

Cited alongside, same era.

A. Ashikhmin, A. Barg, and S. Litsyn, “Estimates of the distance distribution of codes and designs,” IEEE Trans. Inf. Theory , vol. 47, no. 3, pp. 1050–1061, Mar. 2001, doi: 10.1109/18.915662

2001

Cited alongside, same era.

G. Ferrari and K. M. Chugg, “Linear programming-based optimization of the distance spectrum of linear block codes,” IEEE Trans. Inf. Theory , vol. 49, no. 7, pp. 1794–1800, Jul. 2003, doi: 10.1109/TIT.2003.813483

2003

Cited alongside, same era.

D. Gijswijt, A. Schrijver, and H. Tanaka, “New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming,” J. Combinatorial Theory Series A , vol. 113, no. 8, pp. 1719–1731, Nov. 2006, doi: 10.1016/j.jcta.2006.03.010

2006

Later among the works it cites.

H. Cohn and A. Kumar, “Universally optimal distribution of points on spheres,” J. Amer. Math. Soc. , vol. 20, no. 1, pp. 99–148, Jan. 2007, doi: 10.1090/S0894-0347-06-00546-7

2007

Later among the works it cites.

T. Kløve, Codes for Error Detection . Hackensack, NJ: World Scientific Publishing Co., 2007, doi: 10.1142/9789812770516

2007

Later among the works it cites.

H. Cohn, “Order and disorder in energy minimization,” in Proceedings of the International Congress of Mathematicians , vol. IV. New Delhi, India: Hindustan Book Agency, 2010, pp. 2416–2443, doi: 10.1142/9789814324359_0152

2010

Later among the works it cites.