Efficient Multi-Point Local Decoding of Reed-Muller Codes via Interleaved Codex

Reed-Muller codes are among the most important classes of locally correctable codes. Currently local decoding of Reed-Muller codes is based on decoding on lines or quadratic curves to recover one single coordinate. To recover multiple coordinates simultaneously, the naive way is to repeat the local decoding for recovery of a single coordinate. This decoding algorithm might be more expensive, i.e., require higher query complexity. In this paper, we focus on Reed-Muller codes with usual parameter regime, namely, the total degree of evaluation polynomials is $d=\Theta({q})$, where $q$ is the code alphabet size (in fact, $d$ can be as big as $q/4$ in our setting). By introducing a novel variation of codex, i.e., interleaved codex (the concept of codex has been used for arithmetic secret sharing \cite{C11,CCX12}), we are able to locally recover arbitrarily large number $k$ of coordinates of a Reed-Muller code simultaneously at the cost of querying $O(q^2k)$ coordinates. It turns out that our local decoding of Reed-Muller codes shows ({\it perhaps surprisingly}) that accessing $k$ locations is in fact cheaper than repeating the procedure for accessing a single location for $k$ times. Our estimation of success error probability is based on error probability bound for $t$-wise linearly independent variables given in \cite{BR94}

Concatenated Quantum Codes Constructible in Polynomial Time: Efficient Decoding and Error Correction

A method for concatenating quantum error-correcting codes is presented. The method is applicable to a wide class of quantum error-correcting codes known as Calderbank-Shor-Steane (CSS) codes. As a result, codes that achieve a high rate in the Shannon theoretic sense and that are decodable in polynomial time are presented. The rate is the highest among those known to be achievable by CSS codes. Moreover, the best known lower bound on the greatest minimum distance of codes constructible in polynomial time is improved for a wide range.Comment: 16 pages, 3 figures. Ver.4: Title changed. Ver.3: Due to a request of the AE of the journal, the present version has become a combination of (thoroughly revised) quant-ph/0610194 and the former quant-ph/0610195. Problem formulations of polynomial complexity are strictly followed. An erroneous instance of a lower bound on minimum distance was remove

Dynamics for holographic codes

We describe how to introduce dynamics for the holographic states and codes introduced by Pastawski, Yoshida, Harlow and Preskill. This task requires the definition of a continuous limit of the kinematical Hilbert space which we argue may be achieved via the semicontinuous limit of Jones. Dynamics is then introduced by building a unitary representation of a group known as Thompson's group T, which is closely related to the conformal group in 1+1 dimensions. The bulk Hilbert space is realised as a special subspace of the semicontinuous limit Hilbert space spanned by a class of distinguished states which can be assigned a discrete bulk geometry. The analogue of the group of large bulk diffeomorphisms is given by a unitary representation of the Ptolemy group Pt, on the bulk Hilbert space thus realising a toy model of the AdS/CFT correspondence which we call the Pt/T correspondence.Comment: 40 pages (revised version submitted to journal). See video of related talk: https://www.youtube.com/watch?v=xc2KIa2LDF