Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > KEYWORD > CODING THEORY:
Reports tagged with Coding theory:
TR06-128 | 5th October 2006
Shankar Kalyanaraman, Chris Umans

#### On obtaining pseudorandomness from error-correcting codes.

A number of recent results have constructed randomness extractors
and pseudorandom generators (PRGs) directly from certain
error-correcting codes. The underlying construction in these
results amounts to picking a random index into the codeword and
outputting $m$ consecutive symbols (the codeword is obtained from
the weak random source in the case ... more >>>

TR07-073 | 3rd August 2007
Parikshit Gopalan, Subhash Khot, Rishi Saket

#### Hardness of Reconstructing Multivariate Polynomials over Finite Fields

We study the polynomial reconstruction problem for low-degree
multivariate polynomials over finite fields. In the GF[2] version of this problem, we are given a set of points on the hypercube and target values $f(x)$ for each of these points, with the promise that there is a polynomial over GF[2] of ... more >>>

TR07-089 | 13th September 2007
Parikshit Gopalan, Venkatesan Guruswami

#### Deterministic Hardness Amplification via Local GMD Decoding

We study the average-case hardness of the class NP against
deterministic polynomial time algorithms. We prove that there exists
some constant $\mu > 0$ such that if there is some language in NP
for which no deterministic polynomial time algorithm can decide L
correctly on a $1- (log n)^{-\mu}$ fraction ... more >>>

TR07-098 | 2nd October 2007
Tali Kaufman, Simon Litsyn, Ning Xie

#### Breaking the $\epsilon$-Soundness Bound of the Linearity Test over GF(2)

For Boolean functions that are $\epsilon$-far from the set of linear functions, we study the lower bound on the rejection probability (denoted $\textsc{rej}(\epsilon)$) of the linearity test suggested by Blum, Luby and Rubinfeld. The interest in this problem is partly due to its relation to PCP constructions and hardness of ... more >>>

TR11-064 | 23rd April 2011
Mark Braverman

#### Towards deterministic tree code constructions

We present a deterministic operator on tree codes -- we call tree code product -- that allows one to deterministically combine two tree codes into a larger tree code. Moreover, if the original tree codes are efficiently encodable and decodable, then so is their product. This allows us to give ... more >>>

TR13-046 | 27th March 2013
Venkatesan Guruswami, Chaoping Xing

#### Optimal rate list decoding of folded algebraic-geometric codes over constant-sized alphabets

We construct a new list-decodable family of asymptotically good algebraic-geometric (AG) codes over fixed alphabets. The function fields underlying these codes are constructed using class field theory, specifically Drinfeld modules of rank $1$, and designed to have an automorphism of large order that is used to fold" the AG code. ... more >>>

TR13-118 | 2nd September 2013
Mahdi Cheraghchi, Venkatesan Guruswami

#### Capacity of Non-Malleable Codes

Non-malleable codes, introduced by Dziembowski, Pietrzak and Wichs (ICS 2010), encode messages $s$ in a manner so that tampering the codeword causes the decoder to either output $s$ or a message that is independent of $s$. While this is an impossible goal to achieve against unrestricted tampering functions, rather surprisingly ... more >>>

TR13-121 | 4th September 2013
Mahdi Cheraghchi, Venkatesan Guruswami

#### Non-Malleable Coding Against Bit-wise and Split-State Tampering

Revisions: 1

Non-malleable coding, introduced by Dziembowski, Pietrzak and Wichs (ICS 2010), aims for protecting the integrity of information against tampering attacks in situations where error-detection is impossible. Intuitively, information encoded by a non-malleable code either decodes to the original message or, in presence of any tampering, to an unrelated message. Non-malleable ... more >>>

TR14-087 | 12th July 2014
Abhishek Bhowmick, Shachar Lovett

#### List decoding Reed-Muller codes over small fields

Revisions: 1

The list decoding problem for a code asks for the maximal radius up to which any ball of that radius contains only a constant number of codewords. The list decoding radius is not well understood even for well studied codes, like Reed-Solomon or Reed-Muller codes.

Fix a finite field $\mathbb{F}$. ... more >>>

TR14-127 | 11th October 2014
Alexandros G. Dimakis, Anna Gal, Ankit Singh Rawat, Zhao Song

#### Batch Codes through Dense Graphs without Short Cycles

Consider a large database of $n$ data items that need to be stored using $m$ servers.
We study how to encode information so that a large number $k$ of read requests can be performed \textit{in parallel} while the rate remains constant (and ideally approaches one).
This problem is equivalent ... more >>>

TR14-165 | 3rd December 2014
Venkatesan Guruswami, Ameya Velingker

#### An Entropy Sumset Inequality and Polynomially Fast Convergence to Shannon Capacity Over All Alphabets

We prove a lower estimate on the increase in entropy when two copies of a conditional random variable $X | Y$, with $X$ supported on $\mathbb{Z}_q=\{0,1,\dots,q-1\}$ for prime $q$, are summed modulo $q$. Specifically, given two i.i.d. copies $(X_1,Y_1)$ and $(X_2,Y_2)$ of a pair of random variables $(X,Y)$, with $X$ ... more >>>

TR15-014 | 18th January 2015
Noga Alon, Mark Braverman, Klim Efremenko, Ran Gelles, Bernhard Haeupler

#### Reliable Communication over Highly Connected Noisy Networks

We consider the task of multiparty computation performed over networks in
the presence of random noise. Given an $n$-party protocol that takes $R$
rounds assuming noiseless communication, the goal is to find a coding
scheme that takes $R'$ rounds and computes the same function with high
probability even when the ... more >>>

TR16-040 | 16th March 2016
Baris Aydinlioglu, Eric Bach

#### Affine Relativization: Unifying the Algebrization and Relativization Barriers

Revisions: 3

We strengthen existing evidence for the so-called "algebrization barrier". Algebrization --- short for algebraic relativization --- was introduced by Aaronson and Wigderson (AW) in order to characterize proofs involving arithmetization, simulation, and other "current techniques". However, unlike relativization, eligible statements under this notion do not seem to have basic closure ... more >>>

TR16-090 | 27th May 2016
Bernhard Haeupler, Ameya Velingker

#### Bridging the Capacity Gap Between Interactive and One-Way Communication

We study the communication rate of coding schemes for interactive communication that transform any two-party interactive protocol into a protocol that is robust to noise.

Recently, Haeupler (FOCS '14) showed that if an $\epsilon > 0$ fraction of transmissions are corrupted, adversarially or randomly, then it is possible to ... more >>>

TR16-166 | 1st November 2016
Mark Braverman, Ran Gelles, Michael A. Yitayew

#### Optimal Resilience for Short-Circuit Noise in Formulas

Revisions: 1

We show an efficient method for converting a logic circuit of gates with fan-out 1 into an equivalent circuit that works even if some fraction of its gates are short-circuited, i.e., their output is short-circuited to one of their inputs. Our conversion can be applied to any circuit with fan-in ... more >>>

TR16-192 | 25th November 2016
Oded Goldreich, Tom Gur

#### Universal Locally Verifiable Codes and 3-Round Interactive Proofs of Proximity for CSP

Revisions: 1 , Comments: 1

Universal locally testable codes (Universal-LTCs), recently introduced in our companion paper [GG16], are codes that admit local tests for membership in numerous possible subcodes, allowing for testing properties of the encoded message. In this work, we initiate the study of the NP analogue of these codes, wherein the testing procedures ... more >>>

TR17-064 | 20th April 2017
Venkatesan Guruswami, Chaoping Xing, chen yuan

#### Subspace Designs based on Algebraic Function Fields

Subspace designs are a (large) collection of high-dimensional subspaces $\{H_i\}$ of $\F_q^m$ such that for any low-dimensional subspace $W$, only a small number of subspaces from the collection have non-trivial intersection with $W$; more precisely, the sum of dimensions of $W \cap H_i$ is at most some parameter $L$. The ... more >>>

TR17-126 | 7th August 2017
Swastik Kopparty, Shubhangi Saraf

#### Local Testing and Decoding of High-Rate Error-Correcting Codes

We survey the state of the art in constructions of locally testable
codes, locally decodable codes and locally correctable codes of high rate.

more >>>

ISSN 1433-8092 | Imprint