List decoding of the first-order binary Reed-Muller codes

I. I. Dumer, G. A. Kabatiansky, C. Tavernier

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)

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 n/2(1 - ε) about the received vector and has the complexity of O(nln2(min{ε-2, n })) binary operations.

Original languageEnglish
Pages (from-to)225-232
Number of pages8
JournalProblems of information transmission
Volume43
Issue number3
DOIs
Publication statusPublished - Sep 2007
Externally publishedYes

Fingerprint

Dive into the research topics of 'List decoding of the first-order binary Reed-Muller codes'. Together they form a unique fingerprint.

Cite this