Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



TR12-106 | 27th August 2012 16:59

New affine-invariant codes from lifting


Authors: Alan Guo, Madhu Sudan
Publication: 27th August 2012 17:18
Downloads: 2789


In this work we explore error-correcting codes derived from
the ``lifting'' of ``affine-invariant'' codes.
Affine-invariant codes are simply linear codes whose coordinates
are a vector space over a field and which are invariant under
affine-transformations of the coordinate space. Lifting takes codes
defined over a vector space of small dimension and lifts them to higher
dimensions by requiring their restriction to every subspace of
the original dimension to be a codeword of the code being lifted.
While the operation is of interest on its own, this work focusses
on new ranges of parameters that can be obtained by such codes,
in the context of local correction and testing.
In particular we present four interesting ranges of parameters that
can be achieved by such lifts, all of which are new in the context
of affine-invariance and some may be new even in general.
The main highlight is a construction of high-rate codes
with sublinear time decoding. The only prior construction of such
codes is due to Kopparty, Saraf and Yekhanin~\cite{KSY}.
All our codes are extremely simple, being just lifts of various
parity check codes (codes with one symbol of redundancy), and
in the final case, the lift of a Reed-Solomon code.


Comment #1 to TR12-106 | 9th November 2012 00:41

This version is outdated.

Authors: Madhu Sudan
Accepted on: 9th November 2012 00:41


This paper is subsumed by ECCC TR12-149, which includes some additional results.

ISSN 1433-8092 | Imprint