Linear-Time Encodable/Decodable Codes With Near-Optimal Rate

DOI10.1109/TIT.2005.855587zbMath1310.94209MaRDI QIDQ3546963

Piotr Indyk, Venkatesan Guruswami

Publication date: 21 December 2008

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Decoding (94B35) Channel models (including quantum) in information and communication theory (94A40) Source coding (94A29)

Related Items (17)

On the limits of gate elimination ⋮ Using low-density parity-check codes to improve the McEliece cryptosystem ⋮ Linear-size constant-query IOPs for delegating computation ⋮ Actively secure arithmetic computation and VOLE with constant computational overhead ⋮ Hardness amplification within NP against deterministic algorithms ⋮ Erasures versus errors in local decoding and property testing ⋮ How to recover a secret with \(O(n)\) additions ⋮ Efficient List Decoding of Explicit Codes with Optimal Redundancy ⋮ Efficient Error-Correcting Codes for Sliding Windows ⋮ Reliable communication over highly connected noisy networks ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A coding scheme that increases the code rate ⋮ Rate-1, Linear Time and Additively Homomorphic UC Commitments ⋮ Fast Interactive Coding against Adversarial Noise ⋮ A combination of testability and decodability by tensor products ⋮ List-Decoding with Double Samplers

This page was built for publication: Linear-Time Encodable/Decodable Codes With Near-Optimal Rate