An improvement of the tree code construction

Authors:
Marcin Peczarski
Affiliations:
Institute of Informatics, Warsaw University, Warsaw, Poland
Venue:
Information Processing Letters
Year:
2006

Citing 3
Cited 3

Deterministic coding for interactive communication

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
A coding theorem for distributed computation

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Coding for interactive communication

IEEE Transactions on Information Theory - Part 1

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
Tree codes and a conjecture on exponential sums

Proceedings of the 5th conference on Innovations in theoretical computer science

Quantified Score

Hi-index	0.95

Visualization

Abstract

An improvement of the randomized construction for tree codes is presented. This construction, in contrary to the original one, almost surely gives a good code and uses smaller alphabet.