|
Problemy Peredachi Informatsii, 2007, Volume 43, Issue 3, Pages 66–74
(Mi ppi19)
|
|
|
|
This article is cited in 3 scientific papers (total in 3 papers)
Coding Theory
List Decoding of Binary First-Order Reed-Muller Codes
I. I. Dumera, G. A. Kabatianskyb, C. Tavernierc a University of California, Riverside
b A. A. Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences
c Thales Communication
Abstract:
A list decoding algorithm is designed for the first-order binary Reed–Muller codes
of length $n$ that reconstructs all codewords located within the ball of radius
$\frac n2(1-\varepsilon)$ about the received vector and has the complexity of
$\mathcal O(n\ln^2(\min\{\varepsilon^{-2},n\}))$ binary operations.
Received: 15.05.2007
Citation:
I. I. Dumer, G. A. Kabatiansky, C. Tavernier, “List Decoding of Binary First-Order Reed-Muller Codes”, Probl. Peredachi Inf., 43:3 (2007), 66–74; Problems Inform. Transmission, 43:3 (2007), 225–232
Linking options:
https://www.mathnet.ru/eng/ppi19 https://www.mathnet.ru/eng/ppi/v43/i3/p66
|
Statistics & downloads: |
Abstract page: | 759 | Full-text PDF : | 327 | References: | 80 | First page: | 8 |
|