Averaging bounds for lattices and linear codes

IEEE Transactions on Information Theory

Volumn 43, Issue 6, 1997, Pages 1767-1773

  Loeliger, Hans Andrea ^a,b,c  

^a IEEE   (Switzerland)

^b LINKÖPING UNIVERSITY   (Sweden)

^c Endora Tech AG   (Switzerland)

Author keywords

Coded modulation; Lattices; Linear codes; Minkowski Hlawka theorem; Random coding; Shaping

Indexed keywords

AMPLITUDE MODULATION; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTATIONAL COMPLEXITY; DECODING; ENCODING (SYMBOLS); RANDOM PROCESSES; SPURIOUS SIGNAL NOISE; WHITE NOISE;

COMBINATORIAL PACKING; LINEAR CODES; MINKOWSKI HLAWKA THEOREM; RANDOM CODING; SPHERICALLY SHAPED LATTICE CODES;

CODES (SYMBOLS);

EID: 0031276871     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.641543     Document Type: Article

References (21)

1. A. R. Calderbank and N. J. A. Sloane, "New trellis codes based on lattices and cosets," IEEE Trans. Inform. Theory, vol. IT-33, pp. 177-195, Mar. 1987.
2. G. D. Forney, Jr., "Coset codes-Part I: Introduction and geometrical classification," IEEE Trans. Inform. Theory, vol. 34, pp. 1123-1151, Sept. 1988.
3. G. D. Forney, Jr. and L.-F. Wei, "Multidimensional constellations - Part I: Introduction, figures of merit, and generalized cross constellations," J, Select. Areas Commun., vol. 7, pp. 877-892, Aug. 1989.
4. R. de Buda, "The upper error bound of a new near-optimal code," IEEE Trans. Inform. Theory, vol. IT-21, pp. 441-445, July 1975.
5. _, "Some optimal codes have structure," IEEE J. Select. Areas Commun., vol. 7, pp. 893-899, Aug. 1989.
6. G. Poltyrev, "On coding without restrictions for the AWGN channel," IEEE Trans. Inform. Theory, vol. 40, pp. 409-417, Mar. 1994.
7. C. E. Shannon, "Probability of error for optimal codes in a Gaussian channel," Bell Syst. Tech. J., vol. 38, pp. 611-656, 1959.
8. T. Linder, Ch. Schlegel, and K. Zeger, "Corrected proof of de Buda's theorem," IEEE Trans. Inform. Theory, vol. 39, pp. 1735-1737, Sept. 1993.
9. E. Hlawka, "Zur Geometrie der Zahlen," Math. Z, vol. 49, pp. 285-312, 1944.
10. J. W. S. Cassels, An Introduction to the Geometry of Numbers. New York: Springer-Verlag, 1959 (Grundlehren der mathematischen Wissenschaften, vol. 99).
11. C. A. Rogers, Packing and Covering. Cambridge, U.K.: Cambridge Univ. Press, 1964.
12. P. M. Gruber and C. G. Lekkerkerker, Geometry of Numbers. Amsterdam, The Netherlands: Elsevier, 1987.
13. D. Hubert, "Mathematische Probleme," Arch. Math. Phys., vol. 1, pp. 44-63 and 213-237, 1901.
14. J. A. Rush and N. J. A. Sloane, "An improvement to the Minkowski-Hlawka bound for packing superballs," Mathematika, vol. 34, pp. 8-18, 1987.
15. J. A. Rush, "A lower bound on packing density," Invent. Math., vol. 98, pp. 499-509, 1989.
16. J. H. Conway and N. J. A. Sloane, Sphere Packings, Lattices and Groups. New York: Springer-Verlag, 1988 (Grundlehren der mathematischen Wissenschaften, vol. 290).
17. M. A. Tsfasman and S. G. Vlǎduţ, Algebraic-Geometric Codes. Norwell, MA: Kluwer, 1991.
18. P. Delsarte and P. Piret, "Algebraic constructions of Shannon codes for regular channels," IEEE Trans. Inform. Theory, vol. IT-28, pp. 593-599, July 1982.
19. H.-A. Loeliger, "On the basic averaging arguments for linear codes," in Communications and Cryptography: Two Sides of One Tapestry, (festschrift in honor of James L. Massey on the occasion of his 60th birthday), R. E. Blahut et al., Eds. Norwell, MA: Kluwer, 1994, pp. 251-261.
20. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: Wiley, 1991.
21. M. Magalhäes de Oliveira and G. Battail, "A capacity theorem for lattice codes on Gaussian channels," in Proc. SBT/IEEE Int. Telecommunications Symp. (Rio de Janeiro, Brazil, Sept. 3-6, 1990).