Linear-Time Encodable/Decodable Codes With Near-Optimal Rate
From MaRDI portal
Recommendations
Cited in
(40)- On the limits of gate elimination
- Reliable communication over highly connected noisy networks
- Linear-size constant-query IOPs for delegating computation
- A coding scheme that increases the code rate
- Using low-density parity-check codes to improve the McEliece cryptosystem
- Rate-1, linear time and additively homomorphic UC commitments
- Optimal Index Codes With Near-Extreme Rates
- Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications
- Linear-time encodable and decodable error-correcting codes
- Linear time adaptive arithmetic coding
- Endcoding Complexity Versus Minimum Distance
- Improved Nearly-MDS Expander Codes
- Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets
- Linear time encodable and list decodable codes
- The (d,k) subcode of a linear block code
- scientific article; zbMATH DE number 1504652 (Why is no real title available?)
- scientific article; zbMATH DE number 1512691 (Why is no real title available?)
- Explicit rateless codes for memoryless binary-input output-symmetric channels
- Erasures vs. errors in local decoding and property testing
- On the Optimal Achievable Rates for Linear Computation With Random Homologous Codes
- Efficient error-correcting codes for sliding windows
- A combination of testability and decodability by tensor products
- Efficient List Decoding of Explicit Codes with Optimal Redundancy
- Efficiently decodable codes meeting Gilbert-Varshamov bound for low rates
- Fast interactive coding against adversarial noise
- List-Decoding with Double Samplers
- Actively secure arithmetic computation and VOLE with constant computational overhead
- Erasures versus errors in local decoding and property testing
- Rate amplification and query-efficient distance amplification for linear LCC and LDC
- How to recover a secret with O(n) additions
- Hardness amplification within NP against deterministic algorithms
- Lightweight transparent zero-knowledge proofs for cross-domain statements
- Asymptotically-good RLCCs with \((\log n)^{2+o(1)}\) queries
- Explicit time and space efficient encoders exist only with random access
- Pseudorandom linear codes are list-decodable to capacity
- Capacity-achieving gray codes
- When do low-rate concatenated codes approach the Gilbert-Varshamov bound?
- Linear-time accumulation schemes
- List-recovery of random linear codes over small fields
- Linear tree codes and the problem of explicit constructions
This page was built for publication: Linear-Time Encodable/Decodable Codes With Near-Optimal Rate
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3546963)
