Succinct Representation of Codes with Applications to Testing

DOI10.1007/978-3-642-03685-9_40zbMath1255.94082arXiv0905.2919OpenAlexW2151626804MaRDI QIDQ3638901

Madhu Sudan, Tali Kaufman, Elena Grigorescu

Publication date: 28 October 2009

Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

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

zbMATH Keywords

locally testable codesaffine/cyclic invariancesingle orbit

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Cyclic codes (94B15) Randomized algorithms (68W20)

Related Items (7)

2-transitivity is insufficient for local testability ⋮ Symmetric LDPC codes and local testing ⋮ Sparse affine-invariant linear codes are locally testable ⋮ Limitation on the Rate of Families of Locally Testable Codes ⋮ Invariance in Property Testing ⋮ Symmetric LDPC Codes and Local Testing ⋮ On Sums of Locally Testable Affine Invariant Properties

This page was built for publication: Succinct Representation of Codes with Applications to Testing