Interpolation by convolutional codes, overload distortion, and the erasure channel

IEEE Transactions on Information Theory

Volumn 45, Issue 1, 1999, Pages 94-105

  Calderbank, A R ^a   Duel Hallen, Alexandra ^a   Fishburn, Peter C ^a   Rabinovich, Asya ^a  

^a AT AND T LABS RESEARCH   (United States)

Author keywords

Convolutional codes; Digital quantization; Erasure channel; Overload distortion; Subsequence matching

Indexed keywords

BINARY CODES; DECODING; INTERPOLATION; ITERATIVE METHODS; MARKOV PROCESSES; PROBABILITY DISTRIBUTIONS;

DIGITAL QUANTIZATION;

CONVOLUTIONAL CODES;

EID: 0032663818     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.746774     Document Type: Article

References (6)

1. M. R. Best, M. V. Burnashev, Y. Levy, A. Rabinovich, P. C. Fishburn, A. R. Calderbank, and D. J. Costello, Jr., "On a technique to calculate the exact performance of a convolutional code," IEEE Trans. Inform. Theory, vol. 41, pp. 441-447, Mar. 1995.
2. A. R. Calderbank, P. C. Fishburn, and A. Rabinovich, "Covering properties of convolutional codes and associated lattices," IEEE Trans. Inform. Theory, vol. 41, pp. 732-746, May 1995.
3. W. Feller, An Introduction to Probability Theory and its Applications, 2nd ed. New York: Wiley, 1957, vol. I, ch. XVI.
4. G. D. Forney, Jr., "Convolutional codes I: Algebraic structure," IEEE Trans. Inform. Theory, vol. IT16, pp. 720-738, Nov. 1970.
5. S. Lin and D. J. Costello, Jr., Error Control Coding. Englewood Cliffs, NJ: Prentice-Hall, 1983.
6. M. W. Marcellin and T. R. Fischer, "Trellis coded quantization of memoryless and Gauss-Markov sources," IEEE Trans. Commun., vol. 38, pp. 82-92, Jan. 1990.