scientific article; zbMATH DE number 7559374

DOI10.4230/LIPICS.MFCS.2020.3MaRDI QIDQ5089160zbMATH OpenFDO

Authors Mary Wootters

Publication date 18 July 2022

Full work available at URL https://doi.org/10.4230/LIPICS.MFCS.2020.3

zbMATH Keywords

error correcting codeslist-decoding

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• Average-radius list-recoverability of random linear codes
• Efficiently decodable codes meeting Gilbert-Varshamov bound for low rates
• Every list-decodable code for high noise has abundant near-optimal rate puncturings
• scientific article; zbMATH DE number 3133919 (Why is no real title available?)
• scientific article; zbMATH DE number 3174791 (Why is no real title available?)
• scientific article; zbMATH DE number 5764881 (Why is no real title available?)
• scientific article; zbMATH DE number 3760081 (Why is no real title available?)
• scientific article; zbMATH DE number 7758311 (Why is no real title available?)
• Improved list-decodability of random linear binary codes
• Local list recovery of high-rate tensor codes and applications
• On the list decodability of random linear codes with large error rates
• On the List-Decodability of Random Linear Codes
• Restricted isometry of Fourier matrices and list decodability of random linear codes

This page was built for publication:

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