Search Results

Documents authored by Bhandari, Siddharth


Document
Vanishing Spaces of Random Sets and Applications to Reed-Muller Codes

Authors: Siddharth Bhandari, Prahladh Harsha, Ramprasad Saptharishi, and Srikanth Srinivasan

Published in: LIPIcs, Volume 234, 37th Computational Complexity Conference (CCC 2022)


Abstract
We study the following natural question on random sets of points in 𝔽₂^m: Given a random set of k points Z = {z₁, z₂, … , z_k} ⊆ 𝔽₂^m, what is the dimension of the space of degree at most r multilinear polynomials that vanish on all points in Z? We show that, for r ≤ γ m (where γ > 0 is a small, absolute constant) and k = (1-ε)⋅binom(m, ≤ r) for any constant ε > 0, the space of degree at most r multilinear polynomials vanishing on a random set Z = {z_1,…, z_k} has dimension exactly binom(m, ≤ r) - k with probability 1 - o(1). This bound shows that random sets have a much smaller space of degree at most r multilinear polynomials vanishing on them, compared to the worst-case bound (due to Wei (IEEE Trans. Inform. Theory, 1991)) of binom(m, ≤ r) - binom(log₂ k, ≤ r) ≫ binom(m, ≤ r) - k. Using this bound, we show that high-degree Reed-Muller codes (RM(m,d) with d > (1-γ) m) "achieve capacity" under the Binary Erasure Channel in the sense that, for any ε > 0, we can recover from (1-ε)⋅binom(m, ≤ m-d-1) random erasures with probability 1 - o(1). This also implies that RM(m,d) is also efficiently decodable from ≈ binom(m, ≤ m-(d/2)) random errors for the same range of parameters.

Cite as

Siddharth Bhandari, Prahladh Harsha, Ramprasad Saptharishi, and Srikanth Srinivasan. Vanishing Spaces of Random Sets and Applications to Reed-Muller Codes. In 37th Computational Complexity Conference (CCC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 234, pp. 31:1-31:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)


Copy BibTex To Clipboard

@InProceedings{bhandari_et_al:LIPIcs.CCC.2022.31,
  author =	{Bhandari, Siddharth and Harsha, Prahladh and Saptharishi, Ramprasad and Srinivasan, Srikanth},
  title =	{{Vanishing Spaces of Random Sets and Applications to Reed-Muller Codes}},
  booktitle =	{37th Computational Complexity Conference (CCC 2022)},
  pages =	{31:1--31:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-241-9},
  ISSN =	{1868-8969},
  year =	{2022},
  volume =	{234},
  editor =	{Lovett, Shachar},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2022.31},
  URN =		{urn:nbn:de:0030-drops-165934},
  doi =		{10.4230/LIPIcs.CCC.2022.31},
  annote =	{Keywords: Reed-Muller codes, polynomials, weight-distribution, vanishing ideals, erasures, capacity}
}
Document
RANDOM
Ideal-Theoretic Explanation of Capacity-Achieving Decoding

Authors: Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, and Madhu Sudan

Published in: LIPIcs, Volume 207, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021)


Abstract
In this work, we present an abstract framework for some algebraic error-correcting codes with the aim of capturing codes that are list-decodable to capacity, along with their decoding algorithm. In the polynomial ideal framework, a code is specified by some ideals in a polynomial ring, messages are polynomials and their encoding is the residue modulo the ideals. We present an alternate way of viewing this class of codes in terms of linear operators, and show that this alternate view makes their algorithmic list-decodability amenable to analysis. Our framework leads to a new class of codes that we call affine Folded Reed-Solomon codes (which are themselves a special case of the broader class we explore). These codes are common generalizations of the well-studied Folded Reed-Solomon codes and Univariate Multiplicity codes, while also capturing the less-studied Additive Folded Reed-Solomon codes as well as a large family of codes that were not previously known/studied. More significantly our framework also captures the algorithmic list-decodability of the constituent codes. Specifically, we present a unified view of the decoding algorithm for ideal-theoretic codes and show that the decodability reduces to the analysis of the distance of some related codes. We show that good bounds on this distance lead to capacity-achieving performance of the underlying code, providing a unifying explanation of known capacity-achieving results. In the specific case of affine Folded Reed-Solomon codes, our framework shows that they are list-decodable up to capacity (for appropriate setting of the parameters), thereby unifying the previous results for Folded Reed-Solomon, Multiplicity and Additive Folded Reed-Solomon codes.

Cite as

Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, and Madhu Sudan. Ideal-Theoretic Explanation of Capacity-Achieving Decoding. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 207, pp. 56:1-56:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)


Copy BibTex To Clipboard

@InProceedings{bhandari_et_al:LIPIcs.APPROX/RANDOM.2021.56,
  author =	{Bhandari, Siddharth and Harsha, Prahladh and Kumar, Mrinal and Sudan, Madhu},
  title =	{{Ideal-Theoretic Explanation of Capacity-Achieving Decoding}},
  booktitle =	{Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021)},
  pages =	{56:1--56:21},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-207-5},
  ISSN =	{1868-8969},
  year =	{2021},
  volume =	{207},
  editor =	{Wootters, Mary and Sanit\`{a}, Laura},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2021.56},
  URN =		{urn:nbn:de:0030-drops-147499},
  doi =		{10.4230/LIPIcs.APPROX/RANDOM.2021.56},
  annote =	{Keywords: List Decodability, List Decoding Capacity, Polynomial Ideal Codes, Multiplicity Codes, Folded Reed-Solomon Codes}
}
Document
On the Probabilistic Degree of OR over the Reals

Authors: Siddharth Bhandari, Prahladh Harsha, Tulasimohan Molli, and Srikanth Srinivasan

Published in: LIPIcs, Volume 122, 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018)


Abstract
We study the probabilistic degree over R of the OR function on n variables. For epsilon in (0,1/3), the epsilon-error probabilistic degree of any Boolean function f:{0,1}^n -> {0,1} over R is the smallest non-negative integer d such that the following holds: there exists a distribution of polynomials Pol in R[x_1,...,x_n] entirely supported on polynomials of degree at most d such that for all z in {0,1}^n, we have Pr_{P ~ Pol}[P(z) = f(z)] >= 1- epsilon. It is known from the works of Tarui (Theoret. Comput. Sci. 1993) and Beigel, Reingold, and Spielman (Proc. 6th CCC 1991), that the epsilon-error probabilistic degree of the OR function is at most O(log n * log(1/epsilon)). Our first observation is that this can be improved to O{log (n atop <= log(1/epsilon))}, which is better for small values of epsilon. In all known constructions of probabilistic polynomials for the OR function (including the above improvement), the polynomials P in the support of the distribution Pol have the following special structure: P(x_1,...,x_n) = 1 - prod_{i in [t]} (1- L_i(x_1,...,x_n)), where each L_i(x_1,..., x_n) is a linear form in the variables x_1,...,x_n, i.e., the polynomial 1-P(bar{x}) is a product of affine forms. We show that the epsilon-error probabilistic degree of OR when restricted to polynomials of the above form is Omega(log (n over <= log(1/epsilon))/log^2 (log (n over <= log(1/epsilon))})), thus matching the above upper bound (up to polylogarithmic factors).

Cite as

Siddharth Bhandari, Prahladh Harsha, Tulasimohan Molli, and Srikanth Srinivasan. On the Probabilistic Degree of OR over the Reals. In 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 122, pp. 5:1-5:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)


Copy BibTex To Clipboard

@InProceedings{bhandari_et_al:LIPIcs.FSTTCS.2018.5,
  author =	{Bhandari, Siddharth and Harsha, Prahladh and Molli, Tulasimohan and Srinivasan, Srikanth},
  title =	{{On the Probabilistic Degree of OR over the Reals}},
  booktitle =	{38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018)},
  pages =	{5:1--5:12},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-093-4},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{122},
  editor =	{Ganguly, Sumit and Pandya, Paritosh},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2018.5},
  URN =		{urn:nbn:de:0030-drops-99044},
  doi =		{10.4230/LIPIcs.FSTTCS.2018.5},
  annote =	{Keywords: Polynomials over reals, probabilistic polynomials, probabilistic degree, OR polynomial}
}
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail