Decoding complexity bound for linear block codes
From MaRDI portal
Publication:911553
zbMath0696.94016MaRDI QIDQ911553
Publication date: 1989
Published in: Problems of Information Transmission (Search for Journal in Brave)
decoding complexity of q-ary block-linear codesL-decoding algorithmmaximum-likelihood decoding algorithmq-ary symmetric memoryles channel
This page was built for publication: Decoding complexity bound for linear block codes