New Codes on High Dimensional Expanders

by   Irit Dinur, et al.

We describe a new parameterized family of symmetric error-correcting codes with low-density parity-check matrices (LDPC). Our codes can be described in two seemingly different ways. First, in relation to Reed-Muller codes: our codes are functions on a subset of 𝔽^n whose restrictions to a prescribed set of affine lines has low degree. Alternatively, they are Tanner codes on high dimensional expanders, where the coordinates of the codeword correspond to triangles of a 2-dimensional expander, such that around every edge the local view forms a Reed-Solomon codeword. For some range of parameters our codes are provably locally testable, and their dimension is some fixed power of the block length. For another range of parameters our codes have distance and dimension that are both linear in the block length, but we do not know if they are locally testable. The codes also have the multiplication property: the coordinate-wise product of two codewords is a codeword in a related code. The definition of the codes relies on the construction of a specific family of simplicial complexes which is a slight variant on the coset complexes of Kaufman and Oppenheim. We show a novel way to embed the triangles of these complexes into 𝔽^n, with the property that links of edges embed as affine lines in 𝔽^n. We rely on this embedding to lower bound the rate of these codes in a way that avoids constraint-counting and thereby achieves non-trivial rate even when the local codes themselves have arbitrarily small rate, and in particular below 1/2.


page 1

page 2

page 3

page 4


Locally Recoverable codes with local error detection

A locally recoverable code is an error-correcting code such that any era...

Lifted Projective Reed-Solomon Codes

Lifted Reed-Solomon codes, introduced by Guo, Kopparty and Sudan in 2013...

Locally recoverable J-affine variety codes

We prove that subfield-subcodes over finite fields F_q of some J-affine ...

High dimensional expansion implies amplified local testability

In this work we show that high dimensional expansion implies locally tes...

Multiple-Layer Integrated Interleaved Codes: A Class of Hierarchical Locally Recoverable Codes

The traditional definition of Integrated Interleaved (II) codes generall...

Optimal (r,δ)-LRCs from zero-dimensional affine variety codes and their subfield-subcodes

We introduce zero-dimensional affine variety codes (ZAVCs) which can be ...

Locally Testable Codes with constant rate, distance, and locality

A locally testable code (LTC) is an error-correcting code that has a pro...

Please sign up or login with your details

Forgot password? Click here to reset