Please use this identifier to cite or link to this item:
|Title:||Folded codes from function field towers and improved optimal rate list decoding||Authors:||Guruswami, Venkatesan
|Issue Date:||2012||Source:||Guruswami, V., & Xing, C. (2012). Folded codes from function field towers and improved optimal rate list decoding. Proceedings of the 44th symposium on Theory of Computing - STOC '12, 339-350.||Abstract:||We give a new construction of algebraic codes which are efficiently list decodable from a fraction 1-R-ε of adversarial errors where R is the rate of the code, for any desired positive constant ε. The worst-case list size output by the algorithm is O(1/ε), matching the existential bound for random codes up to constant factors. Further, the alphabet size of the codes is a constant depending only on ε - it can be made exp(Õ(1/ ε 2)) which is not much worse than the non-constructive exp(1/ε) bound of random codes. The code construction is Monte Carlo and has the claimed list decoding property with high probability. Once the code is (efficiently) sampled, the encoding/decoding algorithms are deterministic with a running time O ε(N c) for an absolute constant c, where N is the code's block length. Our construction is based on a careful combination of a linear-algebraic approach to list decoding folded codes from towers of function fields, with a special form of subspace-evasive sets. Instantiating this with the explicit "asymptotically good" Garcia-Stichtenoth (GS for short) tower of function fields yields the above parameters. To illustrate the method in a simpler setting, we also present a construction based on Hermitian function fields, which offers similar guarantees with a list-size and alphabet size polylogarithmic in the block length N. In comparison, algebraic codes achieving the optimal trade-off between list decodability and rate based on folded Reed-Solomon codes have a decoding complexity of N Ω(1/ε), an alphabet size of N Ω(1/ε2), and a list size of O(1/ε 2) (even after combination with subspace-evasive sets). Thus we get an improvement over the previous best bounds in all three aspects simultaneously, and are quite close to the existential random coding bounds. Along the way, we shed light on how to use automorphisms of certain function fields to enable list decoding of the folded version of the associated algebraic-geometric codes.||URI:||https://hdl.handle.net/10356/99006
|DOI:||http://dx.doi.org/10.1145/2213977.2214009||Fulltext Permission:||none||Fulltext Availability:||No Fulltext|
|Appears in Collections:||SPMS Conference Papers|
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.