On the locality of codeword symbols in non-linear codes

DOI10.1016/J.DISC.2014.01.016MaRDI QIDQ2440947zbMATH OpenOpenAlexFDO

Authors Sergey Yekhanin, Michael A. Forbes

Publication date 20 March 2014

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1303.3921

zbMATH Keywords

nonlinear codeslocalityerror-correcting codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Other types of codes (94B60)

Abstract: Consider a possibly non-linear (n,K,d)_q code. Coordinate i has locality r if its value is determined by some r other coordinates. A recent line of work obtained an optimal trade-off between information locality of codes and their redundancy. Further, for linear codes meeting this trade-off, structure theorems were derived. In this work we give a new proof of the locality / redundancy trade-off and generalize structure theorems to non-linear codes.

Recommendations

• On the Locality of Codeword Symbols
• On the Capacity of Locally Decodable Codes
• Information-Theoretic Local Non-malleable Codes and Their Applications
• The minimum locality of linear codes
• On the Hamming bound for nonbinary localized-error-correcting codes
• On the efficiency of local decoding procedures for error-correcting codes
• Cyclic and Convolutional Codes With Locality
• Codes With Locality in the Rank and Subspace Metrics
• Coding for channels with localized errors: The non-binary cases
• On locally decodable codes in resource bounded channels

Cites work

• Nonlinear codes from algebraic curves improving the Tsfasman-Vladut-Zink bound
• On the Locality of Codeword Symbols

Cited in

(12)

• Codes for Distributed Storage
• Recursive methods for some problems in coding and random permutations
• The complete hierarchical locality of the punctured simplex code
• Higher Hamming weights for locally recoverable codes on algebraic curves
• RS-like locally recoverable codes with intersecting recovering sets
• Optimal binary linear locally repairable codes with disjoint repair groups
• New bounds on the field size for maximally recoverable codes instantiating grid-like topologies
• Information-Theoretic Local Non-malleable Codes and Their Applications
• Some new constructions of optimal and almost optimal locally repairable codes
• scientific article; zbMATH DE number 7378653 (Why is no real title available?)
• The group structures of automorphism groups of elliptic curves over finite fields and their applications to optimal locally repairable codes
• On Singleton-type bound of locally repairable codes

This page was built for publication: On the locality of codeword symbols in non-linear codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2440947)