arXiv 1504.016492015-04-07cs.DScs.CC

The List-Decoding Size of Fourier-Sparse Boolean Functions

Ishay Haviv, Oded Regev

备注：: 16 pages, CCC 2015

英文摘要：

A function defined on the Boolean hypercube is $k$-Fourier-sparse if it has at most $k$ nonzero Fourier coefficients. For a function $f: \mathbb{F}_2^n \rightarrow \mathbb{R}$ and parameters $k$ and $d$, we prove a strong upper bound on the number of $k$-Fourier-sparse Boolean functions that disagree with $f$ on at most $d$ inputs. Our bound implies that the number of uniform and independent random samples needed for learning the class of $k$-Fourier-sparse Boolean functions on $n$ variables exactly is at most $O(n \cdot k \log k)$. As an application, we prove an upper bound on the query complexity of testing Booleanity of Fourier-sparse functions. Our bound is tight up to a logarithmic factor and quadratically improves on a result due to Gur and Tamuz (Chicago J. Theor. Comput. Sci., 2013).

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

List Decoding Barnes-Wall Lattices

The question of list decoding error-correcting codes over finite fields (under the Hamming metric) has been widely studied in recent years. Motivated by the similar discrete structure of linear codes and point lattices in R^N, and their many shared applications across complexity theory, cryptography, and coding theory, we initiate the study of list decoding for lattices. Namely: for a lattice L in R^N, given a target vector r in R^N and a distance parameter d, output the set of all lattice points w in L that are within distance d of r. In this work we focus on combinatorial and algorithmic que…

2012-04-07cs.CCcs.DScs.IT

Optimal rate list decoding via derivative codes

The classical family of $[n,k]_q$ Reed-Solomon codes over a field $\F_q$ consist of the evaluations of polynomials $f \in \F_q[X]$ of degree $< k$ at $n$ distinct field elements. In this work, we consider a closely related family of codes, called (order $m$) {\em derivative codes} and defined over fields of large characteristic, which consist of the evaluations of $f$ as well as its first $m-1$ formal derivatives at $n$ distinct field elements. For large enough $m$, we show that these codes can be list-decoded in polynomial time from an error fraction approaching $1-R$, where $R=k/(nm)$ is the…

2011-06-20cs.CCcs.DScs.IT

在近线性时间内对基于扩展图的码进行达到容量的列表译码

List Decoding Expander-Based Codes up to Capacity in Near-Linear Time

本文提出了基于图正则性引理的新框架，利用近线性时间算法，实现了对基于谱扩展图的码进行达到容量的列表译码和列表恢复，并证明了多种显式构建的新颖组合与算法界限。

2025-07-17cs.CCcs.DScs.IT

折叠里德-所罗门码列表译码的算法改进

Algorithmic Improvements to List Decoding of Folded Reed-Solomon Codes

本文通过改进常维仿射子空间内的剪枝过程，将折叠里德-所罗门码的列表译码时间分别提升至近线性时间和关于 $1/\varepsilon$ 的多项式时间，首次实现达到容量极限的码在近线性时间内完成确定性译码。

2025-08-20cs.DScs.ITmath.IT

解码错误的连续优化

Continuous Optimization for Decoding Errors

本论文提出了基于受限证明系统和抽象正则性引理的列表解码框架，为Tanner codes、AEL和量子LDPC等码设计了多项式时间解码算法，并改进了超越Johnson界的列表大小与纠错半径。

2024-08-26cs.DScs.ITmath.IT

Lattice (List) Decoding Near Minkowski's Inequality

Minkowski proved that any $n$-dimensional lattice of unit determinant has a nonzero vector of Euclidean norm at most $\sqrt{n}$; in fact, there are $2^{Ω(n)}$ such lattice vectors. Lattices whose minimum distances come close to Minkowski's bound provide excellent sphere packings and error-correcting codes in $\mathbb{R}^{n}$. The focus of this work is a certain family of efficiently constructible $n$-dimensional lattices due to Barnes and Sloane, whose minimum distances are within an $O(\sqrt{\log n})$ factor of Minkowski's bound. Our primary contribution is a polynomial-time algorithm that li…

2021-09-09cs.DScs.ITmath.IT

更多相关论文收起更多论文

List Decoding of Direct Sum Codes

We consider families of codes obtained by "lifting" a base code $\mathcal{C}$ through operations such as $k$-XOR applied to "local views" of codewords of $\mathcal{C}$, according to a suitable $k$-uniform hypergraph. The $k$-XOR operation yields the direct sum encoding used in works of [Ta-Shma, STOC 2017] and [Dinur and Kaufman, FOCS 2017]. We give a general framework for list decoding such lifted codes, as long as the base code admits a unique decoding algorithm, and the hypergraph used for lifting satisfies certain expansion properties. We show that these properties are satisfied by the col…

2020-11-11cs.DScs.ITmath.IT

Linear-algebraic list decoding of folded Reed-Solomon codes

Folded Reed-Solomon codes are an explicit family of codes that achieve the optimal trade-off between rate and error-correction capability: specifically, for any $\eps > 0$, the author and Rudra (2006,08) presented an $n^{O(1/\eps)}$ time algorithm to list decode appropriate folded RS codes of rate $R$ from a fraction $1-R-\eps$ of errors. The algorithm is based on multivariate polynomial interpolation and root-finding over extension fields. It was noted by Vadhan that interpolating a linear polynomial suffices if one settles for a smaller decoding radius (but still enough for a statement of th…

2011-06-02cs.DScs.ITmath.IT

Folded Codes from Function Field Towers and Improved Optimal Rate List Decoding

We give a new construction of algebraic codes which are efficiently list decodable from a fraction $1-R-\eps$ of adversarial errors where $R$ is the rate of the code, for any desired positive constant $\eps$. The worst-case list size output by the algorithm is $O(1/\eps)$, matching the existential bound for random codes up to constant factors. Further, the alphabet size of the codes is a constant depending only on $\eps$ - it can be made $\exp(\tilde{O}(1/\eps^2))$ which is not much worse than the lower bound of $\exp(Ω(1/\eps))$. The parameters we achieve are thus quite close to the existenti…

2012-04-18cs.DScs.ITmath.AG

Optimal Error Rates for Interactive Coding II: Efficiency and List Decoding

We study coding schemes for error correction in interactive communications. Such interactive coding schemes simulate any $n$-round interactive protocol using $N$ rounds over an adversarial channel that corrupts up to $ρN$ transmissions. Important performance measures for a coding scheme are its maximum tolerable error rate $ρ$, communication complexity $N$, and computational complexity. We give the first coding scheme for the standard setting which performs optimally in all three measures: Our randomized non-adaptive coding scheme has a near-linear computational complexity and tolerates any er…

2014-04-16cs.DScs.ITmath.IT

随机 Reed-Solomon 码在线性大小字母表上达到列表译码容量

Random Reed-Solomon Codes Achieve List-Decoding Capacity With Linear-Sized Alphabets

本文证明随机 Reed-Solomon 码可在线性域大小 $O(n)$ 下达到列表译码容量，并以超图定向方法将该问题与 GM-MDS 定理直接联系，同时给出随机线性码的近优字母表结果。

2025-08-28cs.DScs.ITmath.CO