Subspace evasive sets
From MaRDI portal
Publication:5415486
DOI10.1145/2213977.2214010zbMath1286.94109arXiv1110.5696OpenAlexW2052755788MaRDI QIDQ5415486
Publication date: 13 May 2014
Published in: Proceedings of the forty-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1110.5696
Other types of codes (94B60) Decoding (94B35) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (18)
Linear-time list recovery of high-rate expander codes ⋮ Optimal Rate List Decoding over Bounded Alphabets Using Algebraic-geometric Codes ⋮ Explicit subspace designs ⋮ Turán numbers for \(K_{s,t}\)-free graphs: topological obstructions and algebraic constructions ⋮ New MRD codes from linear cutting blocking sets ⋮ Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes ⋮ Local List Recovery of High-Rate Tensor Codes and Applications ⋮ Unnamed Item ⋮ Variety evasive sets ⋮ Group homomorphisms as error correcting codes ⋮ A Quadratic Size-Hierarchy Theorem for Small-Depth Multilinear Formulas ⋮ Lossless dimension expanders via linearized polynomials and subspace designs ⋮ Explicit list-decodable codes with optimal rate for computationally bounded channels ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Some remarks on multiplicity codes ⋮ Low-Density Parity-Check Codes Achieve List-Decoding Capacity ⋮ Unnamed Item
This page was built for publication: Subspace evasive sets
