Coset Codes—Part II: Binary Lattices and Related Codes

IEEE Transactions on Information Theory

Volumn 34, Issue 5, 1988, Pages 1152-1187

  Forney, G David ^a  

^a MOTOROLA INC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84941860379     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.21246     Document Type: Article

References (25)

1. G. D. Forney, Jr., “Coset codes—Part I: Introduction and geometrical classification,” IEEE Trans. Inform. Theory, this issue, pp. 1123–1151.
2. J. H. Conway and N. J. A. Sloane, Sphere Packings, Lattices and Groups. New York: Springer-Verlag, 1988.
3. L. F. Wei, “Trellis-coded modulation with multidimensional constellations,” IEEE Trans. Inform. Theory, vol. IT-33, pp. 483–501, 1987.
4. G. Ungerboeck, “Trellis-coded modulation with redundant signal sets. Part II: State of the art,” IEEE Commun. Mag., vol. 25, no. 2, pp. 12–21, 1987.
5. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. New York: North Holland, 1977.
6. J. K. Wolf, “Efficient maximum likelihood decoding of linear block codes using a trellis,” IEEE Trans. Inform. Theory, vol. IT-24, pp. 76–80, 1978.
7. W. C. Gore, “Further results on product codes,” IEEE Trans. Inform. Theory, vol. IT-16, pp. 446–451, 1970.
8. N. J. A. Sloane and D. S. Whitehead, “A new family of single-error-correcting codes,” IEEE Trans. Inform. Theory, vol. IT-16, pp. 717–719, 1970.
9. M. Plotkin, “Binary codes with specified minimum distances,” IEEE Trans. Inform. Theory, vol. IT-6, pp. 445–450, 1960.
10. E. L. Blokh and V. V. Zyablov, “Coding of generalized concatenated codes,” Problems Inform. Trans., vol. 10, pp. 218–222, 1974.
11. V. A. Zinov’ev, “Generalized concatenated codes,” Problems Inform. Trans., vol. 12, pp. 5–15, 1976.
12. J. Leech and N. J. A. Sloane, “Sphere packings and error-correcting codes,” Can. J. Math., vol. 23, pp. 718–745, 1971.
13. E. S. Barnes and G. E. Wall, “Some extreme forms defined in terms of Abelian groups,” J. Australian Math. Soc., vol. 1, pp. 47–63, 1959.
14. G. D. Forney, Jr., R. G. Gallager, G. R. Lang, F. M. Longstaff, and S. U. Qureshi, “Efficient modulation for band-limited channels,” IEEE J. Select. Areas Commun., vol. SAC-2, pp. 632–647, 1984.
15. E. L. Cusack, “Error control codes for QAM signalling,” Electron. Lett., vol. 20, pp. 62–63, 1984.
16. E. S. Barnes and N. J. A. Sloane, “New lattice packings of spheres,” Can. J. Math., vol. 35, pp. 117–130, 1983.
17. A. Bos, J. H. Conway, and N. J. A. Sloane, “Further lattice packings in high dimensions,” Mathematika, vol. 29, pp. 171–180, 1982.
18. N. J. A. Sloane, S. M. Reddy, and C. L. Chen, “New binary codes,” IEEE Trans. Inform. Theory, vol. IT-18, pp. 503–510, 1972.
19. N. J. A. Sloane, “Tables of sphere packings and spherical codes,” IEEE Trans. Inform. Theory, vol. IT-27, pp. 327–338, 1981.
20. J. H. Conway and N. J. A. Sloane, “Decoding techniques for codes and lattices, including the Golay code and the Leech lattice,” IEEE Trans. Inform. Theory, vol. IT-32, pp. 41–50, 1986.
21. G. D. Forney, Jr., “Review of random tree codes,” NASA Ames Res. Cen., Contract NAS2-3637, NASA CR 73176, Final Rep., Dec. 1967, Appx. A.
22. A. J. Viterbi, “Error bounds for convolutional codes and an asymptotically optimum decoding algorithm,” IEEE Trans. Inform. Theory, vol. IT-13, pp. 260–269, 1967.
23. R. W. D. Booth, M. A. Herro and G. Solomon, “Convolutional coding techniques for certain quadratic residue codes,” in Proc. 1975 Int. Telemetering Conf., pp. 168–177.
24. G. Solomon and H. C. A. van Tilborg, “A connection between block and convolutional codes,” SIAM J. Appl. Math., vol. 37, pp. 358–369, 1979.
25. G. D. Forney, Jr., “Coset codes III: Ternary codes, lattices, and trellis codes,” in preparation.