|
Problemy Peredachi Informatsii, 1983, Volume 19, Issue 2, Pages 3–7
(Mi ppi1170)
|
|
|
|
This article is cited in 2 scientific papers (total in 2 papers)
Coding Theory
Fast Decoding Algorithms for First-Order Reed–Muller codes
S. N. Litsyn, O. I. Shekhovtsov
Abstract:
The authors propose a decoding algorithm for first-order Reed–Muller codes that requires a linear number of operations in relation to code length.
Received: 10.11.1981
Citation:
S. N. Litsyn, O. I. Shekhovtsov, “Fast Decoding Algorithms for First-Order Reed–Muller codes”, Probl. Peredachi Inf., 19:2 (1983), 3–7; Problems Inform. Transmission, 19:2 (1983), 87–91
Linking options:
https://www.mathnet.ru/eng/ppi1170 https://www.mathnet.ru/eng/ppi/v19/i2/p3
|
Statistics & downloads: |
Abstract page: | 1310 | Full-text PDF : | 723 | First page: | 3 |
|