Bias vs Structure of Polynomials in Large Fields, and Applications in Information Theory

DOI10.1109/tit.2022.3214372arXiv1506.02047OpenAlexW4312616212MaRDI QIDQ6193573

Shachar Lovett, Abhishek Bhowmick

Publication date: 18 March 2024

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

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

zbMATH Keywords

Reed-Muller codesfinite fieldspolynomialsweight distributionlist decoding

Mathematics Subject Classification ID

Information and communication theory, circuits (94-XX)

Related Items (1)

Partition and analytic rank are equivalent over large fields

This page was built for publication: Bias vs Structure of Polynomials in Large Fields, and Applications in Information Theory