On List Recovery of High-Rate Tensor Codes

DOI10.1109/TIT.2020.3023962MaRDI QIDQ5151710zbMATH OpenOpenAlexFDO

Authors Swastik Kopparty, Nicolas Resch, Noga Ron-Zewi, Shashwat Silas, Shubhangi Saraf

Publication date 22 February 2021

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

Full work available at URL https://doi.org/10.1109/tit.2020.3023962

Mathematics Subject Classification ID

Decoding (94B35)

Recommendations

• scientific article; zbMATH DE number 7650135
• Local list recovery of high-rate tensor codes and applications
• Efficiently decodable compressed sensing by list-recoverable codes and recursion
• scientific article; zbMATH DE number 7758311
• Bounds for List-Decoding and List-Recovery of Random Linear Codes
• On the theory of list decoding of convolutional codes

Cited in

(5)

• Low-density parity-check codes achieve list-decoding capacity
• scientific article; zbMATH DE number 7758311 (Why is no real title available?)
• scientific article; zbMATH DE number 7650135 (Why is no real title available?)
• Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes
• When do low-rate concatenated codes approach the Gilbert-Varshamov bound?

This page was built for publication: On List Recovery of High-Rate Tensor Codes

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