Energy-Minimizing Error-Correcting Codes
暂无分享,去创建一个
[1] Vladimir I. Levenshtein,et al. Krawtchouk polynomials and universal bounds for codes and designs in Hamming spaces , 1995, IEEE Trans. Inf. Theory.
[2] Nicolas Sourlas,et al. Spin-glass models as error-correcting codes , 1989, Nature.
[3] Cornelis de Vroedt,et al. A simple proof of the Delsarte inequalities , 1991, Des. Codes Cryptogr..
[4] John P. Robinson,et al. An Optimum Nonlinear Code , 1967, Inf. Control..
[5] Juriaan Simonis,et al. On the Delsarte inequalities , 1998 .
[6] Tor Helleseth,et al. The simplex codes and other even-weight binary linear codes for error correction , 2004, IEEE Transactions on Information Theory.
[7] P. Delsarte. Bounds for unrestricted codes, by linear programming , 1972 .
[8] Salvatore Torquato,et al. New Conjectural Lower Bounds on the Optimal Density of Sphere Packings , 2006, Exp. Math..
[9] Joseph A. Thas,et al. M. D. S. codes and arcs in projective spaces: a survey , 1993 .
[10] V. Yudin,et al. The minimum of potential energy of a System of point charges , 1993 .
[11] Gianluigi Ferrari,et al. Linear programming-based optimization of the distance spectrum of linear block codes , 2003, IEEE Transactions on Information Theory.
[12] Alexander Schrijver,et al. New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming , 2006, J. Comb. Theory, Ser. A.
[13] Alex Samorodnitsky,et al. On the Optimum of Delsarte's Linear Program , 2001, J. Comb. Theory, Ser. A.
[14] N. J. A. Sloane,et al. Bounds for binary codes of length less than 25 , 1978, IEEE Trans. Inf. Theory.
[15] A. Barg,et al. Binomial moments of the distance distribution: bounds and applications , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).
[16] Philippe Delsarte,et al. Association Schemes and Coding Theory , 1998, IEEE Trans. Inf. Theory.
[17] Niek Bouman,et al. Energy Minimization of Repelling Particles on a Toric Grid , 2012, SIAM J. Discret. Math..
[18] Henry Cohn,et al. Three-point bounds for energy minimization , 2011, 1103.0485.
[19] Andrea Montanari,et al. Modern Coding Theory: The Statistical Mechanics and Computer Science Point of View , 2007, ArXiv.
[20] Henry Cohn,et al. Order and disorder in energy minimization , 2010, 1003.3053.
[21] Torleiv Kløve,et al. Codes for Error Detection , 2007, Series on Coding Theory and Cryptology.
[22] William J. Martin,et al. Commutative association schemes , 2008, Eur. J. Comb..
[23] Alexander Schrijver,et al. New code upper bounds from the Terwilliger algebra and semidefinite programming , 2005, IEEE Transactions on Information Theory.
[24] R. J. McEliece. The Theory of Information and Coding: Student Edition , 2004 .
[25] Simon Litsyn,et al. Estimates of the distance distribution of codes and designs , 2001, IEEE Trans. Inf. Theory.
[26] Alexander Barg,et al. Binomial Moments of the Distance Distribution: Bounds and Applications , 1999, IEEE Trans. Inf. Theory.
[27] Olof Heden,et al. A survey of perfect codes , 2008, Adv. Math. Commun..
[28] O. Antoine,et al. Theory of Error-correcting Codes , 2022 .
[29] Henry Cohn,et al. Universally optimal distribution of points on spheres , 2006, math/0607446.
[30] V. Levenshtein. Designs as maximum codes in polynomial metric spaces , 1992 .
[31] P. Delsarte. AN ALGEBRAIC APPROACH TO THE ASSOCIATION SCHEMES OF CODING THEORY , 2011 .