|
Problemy Peredachi Informatsii, 1987, Volume 23, Issue 2, Pages 40–49
(Mi ppi801)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Coding Theory
Fast Correlation Decoding of Reed–Muller Codes
Yu. D. Karyakin
Abstract:
A fast correlation decoding algorithm is described for the binary Reed–Muller code. A comparative analysis of the decoding complexity of RM codes of various orders is presented.
Received: 11.04.1985 Revised: 30.01.1986
Citation:
Yu. D. Karyakin, “Fast Correlation Decoding of Reed–Muller Codes”, Probl. Peredachi Inf., 23:2 (1987), 40–49; Problems Inform. Transmission, 23:3 (1987), 121–129
Linking options:
https://www.mathnet.ru/eng/ppi801 https://www.mathnet.ru/eng/ppi/v23/i2/p40
|
Statistics & downloads: |
Abstract page: | 477 | Full-text PDF : | 301 | First page: | 1 |
|