|
|
Problemy Peredachi Informatsii, 1986, Volume 22, Issue 3, Pages 35–42
(Mi ppi944)
|
|
|
|
This article is cited in 3 scientific papers (total in 3 papers)
Information Theory and Coding Theory
Two Classes of Minimum Generalized Distance Decoding Algorithms
S. I. Kovalev
Abstract:
We consider two classes of erasure, choosing algorithms for decoding in the generalized distance metric with $l<\lceil(d+1)/2\rceil$ decoding attempts. In each class, we identify and investigate algorithms that minimize the loss of distance compared with the Forney algorithm.
Received: 26.04.1983 Revised: 05.10.1985
Citation:
S. I. Kovalev, “Two Classes of Minimum Generalized Distance Decoding Algorithms”, Probl. Peredachi Inf., 22:3 (1986), 35–42; Problems Inform. Transmission, 22:3 (1986), 186–192
Linking options:
https://www.mathnet.ru/eng/ppi944 https://www.mathnet.ru/eng/ppi/v22/i3/p35
|
|