Information and coding theory
Provisional editorial order for Top Open Problems: Millennium Prize Problems first, followed by assessed difficulty tiers; the unassessed remainder keeps its previous catalogue order. About rankings
Browse by subject
Search this collection by problem ID, title, classification, subject, provider, or model.
Search results
No matching problems. Try another search or clear a filter.
58 records · Search and filter
- Math-5280 Reduction of Guessing Problems to Source Compression
- Math-5281 Universal Compression with Large Unknown Alphabets
- Math-5282 Mutual-Information Bounds and Dimension-Free Dual Sudakov Minoration
- Math-5301 Restriction Condensation of Deterministic Communication Complexity
- Math-5309 Output Length and Error of Seedless Extractors
- Math-5328 Minimal Assumptions for Additive Randomized Encodings
- Math-5344 Griesmer Bounds and Solomon–Stiffler Constructions in Other Metrics
- Math-5345 Iterative Quantum LDPC Constructions from Weaker Seeds