Answers are grounded in this paper and cite their sources.
Department of Information Theory University of Lund Box 118 S‐ 221 00 Lund ‐ Sweden In this paper we consider the global‐list decoding algorithm for convolutional codes. We introduce the notion of the L‐list minimum distance and prove lower and upper bounds for if. Furthermore, we derive lower and upper bounds for the decoding error probability of the global‐' list decoding.
No takes yet. Share an insight, caveat, or question.
Zigangirov et al. (1993) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: