On Low-Complexity Maximum-Likelihood Decoding of Convolutional Codes
From MaRDI portal
Publication:3604863
DOI10.1109/TIT.2008.2006461zbMath1319.94111arXiv0711.3077MaRDI QIDQ3604863
Publication date: 24 February 2009
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0711.3077
hidden Markov modelconvolutional codemaximum-likelihood (ML) decodingcoding complexityViterbi algorithm (VA)
This page was built for publication: On Low-Complexity Maximum-Likelihood Decoding of Convolutional Codes