Improved list-decodability of random linear binary codes
From MaRDI portal
Publication:5009547
Recommendations
Cites work
- A new rank metric codes based encryption scheme
- A Rank-Metric Approach to Error Control in Random Network Coding
- A Unified Construction of Space–Time Codes With Optimal Rate–Diversity Tradeoff
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Average-radius list-recoverability of random linear codes
- Bilinear forms over a finite field, with applications to coding theory
- Bounds for codes in the case of list decoding of finite volume
- Bounds on List Decoding of Rank-Metric Codes
- Coding for Errors and Erasures in Random Network Coding
- Combinatorial bounds for list decoding
- Combinatorial Limitations of Average-Radius List-Decoding
- Designing a Rank Metric Based McEliece Cryptosystem
- Error-correcting codes for list decoding
- Every list-decodable code for high noise has abundant near-optimal rate puncturings
- Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
- Explicit List-Decodable Rank-Metric and Subspace Codes via Subspace Designs
- Folded codes from function field towers and improved optimal rate list decoding
- scientific article; zbMATH DE number 5764881 (Why is no real title available?)
- scientific article; zbMATH DE number 3760081 (Why is no real title available?)
- scientific article; zbMATH DE number 177612 (Why is no real title available?)
- scientific article; zbMATH DE number 1759459 (Why is no real title available?)
- It'll probably work out: improved list-decoding through random operations
- Limits to List Decoding of Random Codes
- List Decoding of Binary Codes–A Brief Survey of Some Recent Results
- List decoding Reed-Solomon, algebraic-geometric, and Gabidulin subcodes up to the Singleton bound
- Local list recovery of high-rate tensor codes and applications
- Maximum rank distance codes as space~time codes
- Maximum-rank array codes and their application to crisscross error correction
- On List-Decodability of Random Rank Metric Codes and Subspace Codes
- On the Decoder Error Probability of Bounded Rank-Distance Decoders for Maximum RankDistance Codes
- On the list decodability of random linear codes with large error rates
- On the List-Decodability of Random Linear Codes
- Pseudorandomness
- Restricted isometry of Fourier matrices and list decodability of random linear codes
- Subspace evasive sets
- Theory of codes with maximum rank distance
- Two theorems on list decoding (extended abstract)
Cited in
(9)- Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
- Better Binary List-Decodable Codes Via Multilevel Concatenation
- List Decoding of Biorthogonal Codes and the Hadamard Transform With Linear Complexity
- Low-density parity-check codes achieve list-decoding capacity
- scientific article; zbMATH DE number 7559374 (Why is no real title available?)
- Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes
- Improved list-decodability of random linear binary codes
- A criterion for decoding on the binary symmetric channel
- A simplified reduction for error correcting matrix multiplication algorithms
This page was built for publication: Improved list-decodability of random linear binary codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5009547)
