scientific article; zbMATH DE number 7250144
From MaRDI portal
Publication:5121892
DOI10.4230/LIPIcs.CCC.2018.4zbMath1441.68037MaRDI QIDQ5121892
Nicolas Resch, Xing, Chaoping, Venkatesan Guruswami
Publication date: 22 September 2020
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Linear codes (general theory) (94B05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (2)
Almost affinely disjoint subspaces ⋮ An asymptotically optimal construction of almost affinely disjoint subspaces
Cites Work
- Expansion in SL\(_2(\mathbb R)\) and monotone expanders
- Towards dimension expanders over finite fields
- Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in
- Expanders and dimensional expansion
- Theory of codes with maximum rank distance
- Entropy waves, the zig-zag graph product, and new constant-degree expanders
- Deterministic extraction from weak random sources.
- Explicit subspace designs
- Dimension expanders
- Explicit List-Decodable Rank-Metric and Subspace Codes via Subspace Designs
- Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes
- Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
- Linear-Algebraic List Decoding for Variants of Reed–Solomon Codes
- On identity testing of tensors, low-rank recovery and compressed sensing
- Folded codes from function field towers and improved optimal rate list decoding
- Subspace evasive sets
- Locally Decodable Codes with Two Queries and Polynomial Identity Testing for Depth 3 Circuits
- List decoding reed-solomon, algebraic-geometric, and gabidulin subcodes up to the singleton bound
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication:
