Towards deterministic tree code constructions

DOI10.1145/2090236.2090250zbMath1348.94095MaRDI QIDQ2826052

Mark Braverman

Publication date: 7 October 2016

Published in: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2090236.2090250

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

94B25: Combinatorial codes

Related Items

Sparse MDS Matrices over Small Fields: A Proof of the GM-MDS Conjecture, Synchronization Strings: Channel Simulations and Interactive Coding for Insertions and Deletions, Efficient Error-Correcting Codes for Sliding Windows, Palette-alternating tree codes, Fast Interactive Coding against Adversarial Noise, Interactive communication with unknown noise rate, Interactive Coding for Interactive Proofs, List and Unique Coding for Interactive Communication in the Presence of Adversarial Noise

Cites Work

• Unnamed Item
• The reproducible properties of correct forecasts
• The dimensions of individual strings and sequences
• Effective Strong Dimension in Algorithmic Information and Computational Complexity
• The Complexity of Forecast Testing
• The Well-Calibrated Bayesian
• Asymptotic calibration
• Dimension in Complexity Classes
• Universal prediction
• THE FRACTIONAL DIMENSION OF A SET DEFINED BY DECIMAL PROPERTIES