List decoding of Reed-Muller codes up to the Johnson bound with almost linear complexity

Ilya Dumer, Grigory Kabatiansky, Cédric Tavernier

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

24 Citations (Scopus)

Abstract

A new deterministic list decoding algorithm is proposed for general Reed-Muller codes RM(s, m) of length n = 2m and distance d = 2 m-s. Given n and d, the algorithm performs beyond the bounded distance threshold of d/2 and has a low complexity order of nms-1 for any decoding radius T that is less than the Johnson bound.

Original languageEnglish
Title of host publicationProceedings - 2006 IEEE International Symposium on Information Theory, ISIT 2006
Pages138-142
Number of pages5
DOIs
Publication statusPublished - 2006
Externally publishedYes
Event2006 IEEE International Symposium on Information Theory, ISIT 2006 - Seattle, WA, United States
Duration: 9 Jul 200614 Jul 2006

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8101

Conference

Conference2006 IEEE International Symposium on Information Theory, ISIT 2006
Country/TerritoryUnited States
CitySeattle, WA
Period9/07/0614/07/06

Fingerprint

Dive into the research topics of 'List decoding of Reed-Muller codes up to the Johnson bound with almost linear complexity'. Together they form a unique fingerprint.

Cite this