Error Bounds for Convolutional Codes and an Asymptotically Optimum Decoding Algorithm

Viterbi, A. J. (1967). Error Bounds for Convolutional Codes and an Asymptotically Optimum Decoding Algorithm. IEEE Transactions on Information Theory, 260-269.

Type

Journal article

Intellectual base

Primary research

Year

1967

DOI

10.1109/tit.1967.1054010

Link

https://doi.org/10.1109/tit.1967.1054010

Cited by

1 citation across 1 artifact.

Domain-specific

• Viterbi Error Rate
  • Viterbi's original maximum-likelihood sequence-decoding formulation and Forney's exposition explain why decoder output errors have burst and path-merging structure rather than behaving as independent raw channel errors.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:6d6ff099349c · see in the full table