Weight Distribution and List-Decoding Size of Reed–Muller Codes
From MaRDI portal
Publication:5271939
DOI10.1109/TIT.2012.2184841zbMath1365.94517OpenAlexW2030633623MaRDI QIDQ5271939
Tali Kaufman, Shachar Lovett, Ely Porat
Publication date: 12 July 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2012.2184841
Related Items (11)
Nonlinearity measures of random Boolean functions ⋮ Quantified Derandomization: How to Find Water in the Ocean ⋮ List Decoding of Binary Codes–A Brief Survey of Some Recent Results ⋮ List-decoding Barnes-Wall lattices ⋮ Error-correction capability of Reed-Muller codes ⋮ On weight distributions for a class of codes with parameters of Reed-Muller codes ⋮ On the Bias of Reed--Muller Codes over Odd Prime Fields ⋮ Random low-degree polynomials are hard to approximate ⋮ Unnamed Item ⋮ On hitting-set generators for polynomials that vanish rarely ⋮ Reed-Muller Codes
This page was built for publication: Weight Distribution and List-Decoding Size of Reed–Muller Codes