Abstract
Parallelly to the block codes, the convolutional codes are the second important family of error correcting codes. They are the most important subset of so called tree codes, where some additional limitations are imposed (finite memory order, time invariance, linearity). They were first introduced in the “systematic” form by Elias in 1955 [46] as an alternative to block codes.
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 subscriptionsAuthor information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this chapter
Cite this chapter
Ivaniš, P., Drajić, D. (2017). Convolutional Codes and Viterbi Algorithm. In: Information Theory and Coding - Solved Problems. Springer, Cham. https://doi.org/10.1007/978-3-319-49370-1_7
Download citation
DOI: https://doi.org/10.1007/978-3-319-49370-1_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-49369-5
Online ISBN: 978-3-319-49370-1
eBook Packages: EngineeringEngineering (R0)