Average-radius list-recoverability of random linear codes

MaRDI QIDQ4607923zbMATH OpenFDO

Authors Atri Rudra, Mary Wootters

Publication date 15 March 2018

Full work available at URL http://dl.acm.org/citation.cfm?id=3175312

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Decoding (94B35)

Recommendations

• On the list-decodability of random linear codes
• On the list decodability of random linear codes with large error rates
• Limits to List Decoding Random Codes
• Combinatorial Limitations of Average-Radius List Decoding
• Every list-decodable code for high noise has abundant near-optimal rate puncturings

Cited in

(16)

• Combinatorial Limitations of Average-Radius List Decoding
• On the list-decodability of random linear codes
• It'll probably work out: improved list-decoding through random operations
• Improved list-decodability of random linear binary codes
• Low-density parity-check codes achieve list-decoding capacity
• scientific article; zbMATH DE number 7559374 (Why is no real title available?)
• Restricted isometry of Fourier matrices and list decodability of random linear codes
• On the list decodability of random linear codes with large error rates
• Restricted isometry of Fourier matrices and list decodability of random linear codes
• scientific article; zbMATH DE number 7650135 (Why is no real title available?)
• scientific article; zbMATH DE number 7758311 (Why is no real title available?)
• Singleton-type bounds for list-decoding and list-recovery, and related results
• Nearly optimal pseudorandomness from hardness
• Sharp threshold rates for random codes
• Near-optimal list-recovery of linear code families
• List-recovery of random linear codes over small fields

This page was built for publication: Average-radius list-recoverability of random linear codes

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