|
Problemy Peredachi Informatsii, 1972, Volume 8, Issue 3, Pages 21–26
(Mi ppi850)
|
|
|
|
Coding Theory
Majority Decoding of Linear Codes
G. K. Kladov
Abstract:
An $M$-decoding procedure is described, which generalizes the conventional one-step majority-decoding procedures. It is shown that any linear code correcting an error set closed under multiplication by elements of the basic field can be $M$-decoded. In particular, all binary linear codes can be $M$-decoded.
Received: 13.03.1971
Citation:
G. K. Kladov, “Majority Decoding of Linear Codes”, Probl. Peredachi Inf., 8:3 (1972), 21–26; Problems Inform. Transmission, 8:3 (1972), 194–198
Linking options:
https://www.mathnet.ru/eng/ppi850 https://www.mathnet.ru/eng/ppi/v8/i3/p21
|
|