Deterministic coding for interactive communication
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Bounds on Spectra of Codes with Known Dual Distance
Designs, Codes and Cryptography
An improvement of the tree code construction
Information Processing Letters
Error-correcting codes for automatic control
IEEE Transactions on Information Theory
Towards coding for maximum errors in interactive communication
Proceedings of the forty-third annual ACM symposium on Theory of computing
Efficient and Explicit Coding for Interactive Communication
FOCS '11 Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
Towards deterministic tree code constructions
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Coding for interactive communication
IEEE Transactions on Information Theory - Part 1
Class of constructive asymptotically good algebraic codes
IEEE Transactions on Information Theory
Efficient Interactive Coding against Adversarial Noise
FOCS '12 Proceedings of the 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science
Hi-index | 0.00 |
We propose a new conjecture on some exponential sums. These particular sums have not apparently been considered in the literature. Subject to the conjecture we obtain the first effective construction of asymptotically good tree codes. The available numerical evidence is consistent with the conjecture and is sufficient to certify codes for significant-length communications.