Sharp threshold rates for random codes

DOI10.4230/LIPICS.ITCS.2021.5MaRDI QIDQ7229288zbMATH OpenFDO

Authors Venkatesan Guruswami, Jonathan Mosheiff, Nicolas Resch, Shashwat Silas, Mary Wootters

Publication date 15 April 2026

Copyright license Creative Commons Attribution 3.0 Unported

Full work available at URL https://doi.org/10.4230/LIPICS.ITCS.2021.5

zbMATH Keywords

coding theoryrandom codessharp thresholds

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• Average-radius list-recoverability of random linear codes
• Beating Fredman-Komlós for Perfect k-Hashing.
• Fredman–Komlós bounds and information theory
• Graphical models, exponential families, and variational inference
• scientific article; zbMATH DE number 3150484 (Why is no real title available?)
• scientific article; zbMATH DE number 3760081 (Why is no real title available?)
• Information Theory and Statistics: A Tutorial
• New bounds for perfect hashing via information theory
• On the List-Decodability of Random Linear Codes
• On the Size of Separating Systems and Families of Perfect Hash Functions
• Pseudorandomness
• Random graphs.
• Sharp thresholds of graph properties, and the k-sat problem
• Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes

This page was built for publication: Sharp threshold rates for random codes

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