Abstract
Block codes were the earliest type of codes to be investigated and still remain the subject of the overwhelming bulk of modern coding research. On the other hand, convolutional codes have proved to be equal or superior to block codes in performance in many practical applications and are generally simpler than comparable block codes to implement. In the coding of block codes, each of the n∔k redundancy (or parity-check) symbols in a codeword depends only on the corresponding k information symbols of the codeword and not on any other information symbols. This means that the encoder of block codes is memoryless.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Bibliography
P. Elias, “Coding for Noisy Channels”, IRE Conv. Rec., Part 4, pp.37–47, 1955.
E. A. Bucher and J. A. Heller, “Error probability bounds for systematic convolutional codes”, IEEE Trans. Inform. Theory, Vol. IT-16, pp.219–224, March 1970.
J. L. Massey and M. K. Sain, “Codes, automata, and continuous systems: explicit interconnections”, IEEE Trans. Automatic Control, Vol. AC-12, pp.644–650, Dec. 1967.
D. G. Forney, Jr., “Convolutional codes I: algebraic structure”, IEEE Trans. Inform. Theory, Vol. IT-16, pp. 720–738, Nov. 1970.
L.R. Bahl, C. D. Cullum, W. D. Frazer, and F. Jelinek, “An efficient algorithm for computing free distance”, IEEE Trans. Inform. Theory, Vol. IT-18, pp. 437–439, May 1972.
K. J. Larsen, “Comments on ‘An efficient algorithm for computing free distance’”, IEEE Trans. Inform. Theory, Vol. IT-19, pp.577–579, July 1973.
J. M. Wozencraft and B. Reiffen, Sequential Decoding, Cambridge, Mass.: MIT Press, 1961.
R. M. Fano, “A heuristic discussion of probabilistic decoding”, IEEE Trans. Inform. Theory, Vol. IT-9, pp. 64–74, Apr. 1963.
F. Jelenik, “A fast sequential decoding algorithm using a stack”, IBM J. Research and Development, Vol. 13, pp.675–685, Nov. 1969.
J. L. Massey, Threshold Decoding, Cambridge, Mass.: MIT Press, 1963.
I. S. Reed, “A class of multiple-error-correcting codes and the decoding scheme”, IRE Trans., Vol. IT-4, pp.38–49, Sept. 1954.
A. J. Viterbi, “Error bounds for convolutional codes and an asymptotically optimum decoding algorithm”, IEEE Trans. Inform. Theory, Vol. IT-13, pp. 260–269, April 1967.
J. K. Omura, “On the Viterbi decoding algorithm”, IEEE Trans. Inform. Theory, Vol. IT-15, pp. 177–179, Jan. 1969.
G. D. Forney, Jr., “The Viterbi algorithm”, Proc. IEEE, 61, pp. 268–278, March 1973.
G. D. Forney, Jr., “Convolutional Code II: Maximum likelihood decoding”, Information and Control, 25, pp.222–266, July 1974.
Shu Lin and D. J. Costello, Jr. Error Control Coding: Fundamentals and Applications, Englewood Cliffs, NJ: Prentice-Hall, 1983.
E. Paaske, “Short binary convolutional codes with maximal free distance for rate 2/3 and 3/4”, IEEE Trans. Inform. Theory, vol. IT-20, pp.683–688, Sept. 1974.
J. B. Cain, G. C. Clark, and J. M. Geist, “Punctured convolutional codes of rate (n-l)/n and simplified maximum likelihood decoding”, IEEE Trans. on Inform. Theory, Vol. IT-25, No. 1, pp.97–101, Jan. 1979.
A. J. Viterbi, “Convolutional codes and their performance in communication systems”, IEEE Trans. on Communication, Vol. COM-19, pp.751–772, Oct. 1971.
J. M. Wozencraft and I. M. Jacobs, Principles of Communication Engineering, New York: John Wiley & Sons, 1965.
J. A. Heller and I. M. Jacobs, “Viterbi decoding for satellite and space communication,” IEEE Trans, on Communications, vol. COM-19, pp.835–848, Oct. 1971.
http://www.hideki.iis.u-tokyo.ac.jp/~robert/codes.html.
G. C. Clark, Jr. and J. B. Cain, Error-Correction Coding for Digital Communications, Plenum Press, New York, 1981.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer Science+Business Media New York
About this chapter
Cite this chapter
Reed, I.S., Chen, X. (1999). Fundamentals of Convolutional Codes. In: Error-Control Coding for Data Networks. The Springer International Series in Engineering and Computer Science, vol 508. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-5005-1_8
Download citation
DOI: https://doi.org/10.1007/978-1-4615-5005-1_8
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7273-8
Online ISBN: 978-1-4615-5005-1
eBook Packages: Springer Book Archive