scientific article; zbMATH DE number 7378662
From MaRDI portal
Publication:5009547
DOI10.4230/LIPIcs.APPROX-RANDOM.2018.50MaRDI QIDQ5009547
Publication date: 4 August 2021
Full work available at URL: https://arxiv.org/abs/1801.07839
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Theory of codes with maximum rank distance
- Bounds for codes in the case of list decoding of finite volume
- Bilinear forms over a finite field, with applications to coding theory
- Linear-time list recovery of high-rate expander codes
- A new rank metric codes based encryption scheme
- Pseudorandomness
- Explicit List-Decodable Rank-Metric and Subspace Codes via Subspace Designs
- On List-Decodability of Random Rank Metric Codes and Subspace Codes
- Combinatorial Limitations of Average-Radius List-Decoding
- It'll Probably Work Out
- Error-correcting codes for list decoding
- A Unified Construction of Space–Time Codes With Optimal Rate–Diversity Tradeoff
- Maximum rank distance codes as space~time codes
- Designing a Rank Metric Based McEliece Cryptosystem
- Two Theorems on List Decoding
- Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
- On the Decoder Error Probability of Bounded Rank-Distance Decoders for Maximum RankDistance Codes
- Coding for Errors and Erasures in Random Network Coding
- A Rank-Metric Approach to Error Control in Random Network Coding
- Combinatorial bounds for list decoding
- Local List Recovery of High-Rate Tensor Codes and Applications
- Every list-decodable code for high noise has abundant near-optimal rate puncturings
- Limits to List Decoding of Random Codes
- On the List-Decodability of Random Linear Codes
- List Decoding of Binary Codes–A Brief Survey of Some Recent Results
- Bounds on List Decoding of Rank-Metric Codes
- Folded codes from function field towers and improved optimal rate list decoding
- Subspace evasive sets
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- List decoding reed-solomon, algebraic-geometric, and gabidulin subcodes up to the singleton bound
- On the list decodability of random linear codes with large error rates
- Restricted Isometry of Fourier Matrices and List Decodability of Random Linear Codes
- Maximum-rank array codes and their application to crisscross error correction
This page was built for publication:
