Covering Properties of Convolutional Codes and Associated Lattices

IEEE Transactions on Information Theory

Volumn 41, Issue 3, 1995, Pages 732-746

  Rabinovich, Asya ^b   Fishburn, Peter C ^a  

^a LUCENT TECHNOLOGIES   (United States)

^b STANFORD UNIVERSITY   (United States)

Author keywords

Convolutional codes; covering radius; infinite dimensional binary lattices; trellis coded quantization

Indexed keywords

ALGORITHMS; BINARY CODES; DYNAMIC PROGRAMMING; GRAPH THEORY; MARKOV PROCESSES; PROBABILITY; SET THEORY; TRELLIS CODES; VECTORS;

COVERING RADIUS; GOLAY CODE; INFINITE DIMENSIONAL BINARY LATTICES; METRIC FUNCTION; TRELLIS CODED QUANTIZATION;

CONVOLUTIONAL CODES;

EID: 0029304929     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.382019     Document Type: Article

References (16)

1. A. R. Calderbank, “Covering machines,” Discrete Math., vol. 106/107, pp. 105–110, 1992.
2. A. R. Calderbank and P. C. Fishburn, “The second moment of a convolutional code,” IEEE Trans. Inform. Theory, vol. 40, pp. 166–174, Jan. 1994.
3. A. R. Calderbank, P. C. Fishburn, and P. H. Siegel, “Metric functions for magnetic recording channels,” IBM Res. Rep. RJ 9092 (80905), Nov. 16, 1992.
4. A. R. Calderbank, J. E. Mazo, and H. M. Shapiro, “Upper bounds on the minimum distance of trellis codes,” Bell Syst. Tech. J, vol. 62, no. 8, pp. 2617–2646, 1983.
5. 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, 1987.
6. G. D. Cohen, M. G. Karpovsky, H. F. Mattson, Jr., and J. R. Schatz, “Covering radius—Survey and recent results,” IEEE Trans. Inform. Theory, vol. IT-31, pp. 328–343, May 1985.
7. J. H. Conway and N. J. A. Sloane, “A fast encoding method for lattice codes and quantizers,” IEEE Trans. Inform. Theory, vol. IT-29, pp. 820–824, 1983.
8. —, Sphere Packings, Lattices, and Groups. New York: Springer-Verlag, 1988.
9. G. D. Forney, Jr., “Coset codes—Part I: Introduction and geometrical classification,” IEEE Trans. Inform. Theory, vol. 34, pp. 1123–1151, 1988.
10. G. D. Forney, Jr., “Coset codes — Part II: Binary lattices and related codes,” IEEE Trans. Inform. Theory, vol. IT-34, pp. 1152–1187, 1988.
11. —, “Trellis shaping,” IEEE Trans. Inform. Theory, vol. 38, pt. 1, pp. 281–300, 1992.
12. R. L. Graham and N. J. A. Sloane, “On the covering radius of codes,” IEEE Trans. Inform. Theory, vol. IT-31, pp. 385–401, 1985.
13. R. Laroia, N. Favardin, and S. Tretter, “On SVQ shaping of multidimensional constellations—High-rate large-dimensional constellations,” IEEE Trans. Inform. Theory, to appear.
14. S. Lin and D. J. Costello, Jr., Error Control Coding. Englewood Cliffs, NJ: Prentice-Hall, 1983.
15. M. W. Marcellin and T. R. Fischer, “Trellis coded quantization of memoryless and Gauss—Markov sources,” IEEE Trans. Commun., vol. 38, pp. 82–93, 1990.
16. B. H. Marcus, P. H. Siegel, and J. K. Wolf, “Finite-state modulation codes for data storage,” IEEE J. Selected Areas Commun., vol. 10, pp. 5–37, 1992.