Strategy for data transmission over binary channels with noiseless feedback and upper bound on the number of questions in searching with lies

V.B. Balakirsky

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

Abstract

A transmission strategy that allows the sender to deliver any of M messages to the receiver over a binary channel when at most e errors can occur is presented. The total number of bits required by the strategy differs from the known lower bound by 3e. This statement simultaneously gives a new upper bound on the number of questions in the process of searching with lies known as the "Ulam's game".
Original languageEnglish
Title of host publicationProceedings 2000 IEEE International Symposium on Information Theory, June 25-30, Sorrento, Italy
Place of PublicationPiscataway
PublisherInstitute of Electrical and Electronics Engineers
Pages376-376
Number of pages1
ISBN (Print)0-7803-5857-0
DOIs
Publication statusPublished - 2000
Eventconference; IEEE International Symposium on Information Theory; 2000-06-25; 2000-06-30 -
Duration: 25 Jun 200030 Jun 2000

Conference

Conferenceconference; IEEE International Symposium on Information Theory; 2000-06-25; 2000-06-30
Period25/06/0030/06/00
OtherIEEE International Symposium on Information Theory

Fingerprint Dive into the research topics of 'Strategy for data transmission over binary channels with noiseless feedback and upper bound on the number of questions in searching with lies'. Together they form a unique fingerprint.

Cite this