Linear time encodable and list decodable codes

DOI10.1145/780542.780562MaRDI QIDQ3581290zbMATH OpenOpenAlexFDO

Authors Venkatesan Guruswami, Piotr Indyk

Publication date 16 August 2010

Published in Proceedings of the thirty-fifth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/780542.780562

Mathematics Subject Classification ID

Cryptography (94A60) Decoding (94B35) Other types of codes (94B60)

Recommendations

• scientific article; zbMATH DE number 1263215
• Linear-time encodable and decodable error-correcting codes
• Linear Time Encoding of LDPC Codes
• Linear-Time Erasure List-Decoding of Expander Codes
• Linear-Time Encodable/Decodable Codes With Near-Optimal Rate
• Linear time decoding of regular expander codes
• Linear-time decoding of regular expander codes
• On the List-Decodability of Random Linear Codes
• On the list-decodability of random linear codes
• Automata, Languages and Programming

Cited in

(12)

• Extractor Codes
• Linear-Time Encodable/Decodable Codes With Near-Optimal Rate
• List-Decoding with Double Samplers
• Rate-1, linear time and additively homomorphic UC commitments
• Linear time adaptive arithmetic coding
• scientific article; zbMATH DE number 7758311 (Why is no real title available?)
• Synchronization strings: list decoding for insertions and deletions
• Singleton-type bounds for list-decoding and list-recovery, and related results
• Automata, Languages and Programming
• Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets
• Local list recovery of high-rate tensor codes and applications
• Nearly optimal pseudorandomness from hardness

This page was built for publication: Linear time encodable and list decodable codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3581290)