On Z_4-Linear Goethals Codes and KloostermanSums
Designs, Codes and Cryptography - Special issue on designs and codes—a memorial tribute to Ed Assmus
On Weight Distributions of Shifts of Goethals-like Codes
Problems of Information Transmission
On Cosets of Weight 4 of Binary BCH Codes with Minimum Distance 8 and Exponential Sums
Problems of Information Transmission
New completely regular q-ary codes based on Kronecker products
IEEE Transactions on Information Theory
New Kloosterman sums identities over F2m for all m
Finite Fields and Their Applications
From information to exact communication
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 754.90 |
The reduction in communication achievable by interaction is investigated. The model assumes two communicators: an informant having a random variable X, and a recipient having a possibly dependent random variable Y. Both communicators want the recipient to learn X with no probability of error, whereas the informant may or may not learn Y. To that end, they alternate in transmitting messages comprising finite sequences of bits. Messages are transmitted over an error-free channel and are determined by an agreed-upon, deterministic protocol for (X,Y) (i.e. a protocol for transmitting X to a person who knows Y). A two-message protocol is described, and its worst case performance is investigated