A shortened Viterbi decoding algorithm for terminated rate-<tex>1/N</tex>convolutional codes with hard decisions (Corresp.)

DOI10.1109/TIT.1979.1056015zbMath0393.94021MaRDI QIDQ4175168

Publication date: 1979

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Algorithm Complexity Convolutional Codes Maximum Likelihood Decoding

This page was built for publication: A shortened Viterbi decoding algorithm for terminated rate-<tex>1/N</tex>convolutional codes with hard decisions (Corresp.)