Decoding into the maximum likelihood list using a code lattice

V. V. Zyablov, V. G. Potapov, V. R. Sidorenko

Research output: Contribution to journalArticlepeer-review

4 Citations (Scopus)

Abstract

Let us assume, that the maximum likelihood decoding of a block or convolutional code is implemented by a code lattice with the use of the Viterbi algorithm. It is demonstrated, how to use extra processing of information obtained from the Viterbi decoder for constructing a list of L code words closest to the adopted one. The extra complexity of obtaining the list for L ≪ n is in the order of nL(L+t), wherein n is the length of the code word and t is the number of edges entering the lattice node.

Original languageEnglish
Pages (from-to)3-10
Number of pages8
JournalProblemy Peredachi Informatsii
Volume29
Issue number4
Publication statusPublished - Oct 1992
Externally publishedYes

Fingerprint

Dive into the research topics of 'Decoding into the maximum likelihood list using a code lattice'. Together they form a unique fingerprint.

Cite this