Improved Upper Bounds on the Reliability Function of the Gaussian Channel
暂无分享,去创建一个
[1] A. Barg,et al. Distance distribution of binary codes and the error probability of decoding , 2004, IEEE Transactions on Information Theory.
[2] J. Seidel,et al. Spherical codes and designs , 1977 .
[3] Simon Litsyn,et al. A new upper bound on the reliability function of the Gaussian channel , 2000, Proceedings of the 1999 IEEE Information Theory and Communications Workshop (Cat. No. 99EX253).
[4] Simon Litsyn,et al. New Upper Bounds on Error Exponents , 1999, IEEE Trans. Inf. Theory.
[5] Alexander Barg,et al. Binomial Moments of the Distance Distribution: Bounds and Applications , 1999, IEEE Trans. Inf. Theory.
[6] C. Shannon. Probability of error for optimal codes in a Gaussian channel , 1959 .
[7] N. J. A. Sloane,et al. Sphere Packings, Lattices and Groups , 1987, Grundlehren der mathematischen Wissenschaften.
[8] Elwyn R. Berlekamp,et al. Lower Bounds to Error Probability for Coding on Discrete Memoryless Channels. II , 1967, Inf. Control..
[9] Nathan Linial,et al. On the distance distribution of codes , 1995, IEEE Trans. Inf. Theory.
[10] J. Seidel,et al. BOUNDS FOR SYSTEMS OF LINES, AND JACOBI POLYNOMIALS , 1975 .
[11] Marat V. Burnashev,et al. Sharpening of an Upper Bound for the Reliability Function of a Binary Symmetric Channel , 2005, Probl. Inf. Transm..
[12] N. J. A. Sloane,et al. The Coxeter–Todd lattice, the Mitchell group, and related sphere packings , 1983, Mathematical Proceedings of the Cambridge Philosophical Society.
[13] Robert J. McEliece,et al. New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities , 1977, IEEE Trans. Inf. Theory.