Recursive Decoding and Its Performance for Low-Rate Reed–Muller Codes

DOI10.1109/TIT.2004.826632zbMath1296.94166arXiv1703.05306OpenAlexW2103524940MaRDI QIDQ3546822

I. I. Dumer

Publication date: 21 December 2008

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1703.05306

zbMATH Keywords

recursive decodingPlotkin constructionReed-Muller codes.Decoding threshold

Mathematics Subject Classification ID

Bounds on codes (94B65) Decoding (94B35)

Related Items (3)

Recursive error correction for general Reed--Muller codes ⋮ An improved list decoding algorithm for the second order Reed-Muller codes and its applications ⋮ Reed-Muller Codes

This page was built for publication: Recursive Decoding and Its Performance for Low-Rate Reed–Muller Codes