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

doi:10.1109/ISIT.2000.866674

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 proceeding › Conference contribution › Academic › peer-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 language	English
Title of host publication	Proceedings 2000 IEEE International Symposium on Information Theory, June 25-30, Sorrento, Italy
Place of Publication	Piscataway
Publisher	Institute of Electrical and Electronics Engineers
Pages	376-376
Number of pages	1
ISBN (Print)	0-7803-5857-0
DOIs	https://doi.org/10.1109/ISIT.2000.866674
Publication status	Published - 2000
Event	2006 IEEE International Symposium on Information Theory, ISIT 2006 - Seattle, United States Duration: 9 Jul 2006 → 14 Jul 2006

Conference

Conference	2006 IEEE International Symposium on Information Theory, ISIT 2006
Abbreviated title	ISIT 2006
Country/Territory	United States
City	Seattle
Period	9/07/06 → 14/07/06
Other	2006 IEEE International Symposium on Information Theory

Access to Document

10.1109/ISIT.2000.866674

Cite this

Balakirsky, V. B. (2000). Strategy for data transmission over binary channels with noiseless feedback and upper bound on the number of questions in searching with lies. In Proceedings 2000 IEEE International Symposium on Information Theory, June 25-30, Sorrento, Italy (pp. 376-376). Article 866674 Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/ISIT.2000.866674

@inproceedings{60493a15230a439cb3d07c0e4b04228c,

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

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{"}.",

author = "V.B. Balakirsky",

year = "2000",

doi = "10.1109/ISIT.2000.866674",

language = "English",

isbn = "0-7803-5857-0",

pages = "376--376",

booktitle = "Proceedings 2000 IEEE International Symposium on Information Theory, June 25-30, Sorrento, Italy",

publisher = "Institute of Electrical and Electronics Engineers",

address = "United States",

note = "2006 IEEE International Symposium on Information Theory, ISIT 2006, ISIT 2006 ; Conference date: 09-07-2006 Through 14-07-2006",

}

Balakirsky, VB 2000, Strategy for data transmission over binary channels with noiseless feedback and upper bound on the number of questions in searching with lies. in Proceedings 2000 IEEE International Symposium on Information Theory, June 25-30, Sorrento, Italy., 866674, Institute of Electrical and Electronics Engineers, Piscataway, pp. 376-376, 2006 IEEE International Symposium on Information Theory, ISIT 2006, Seattle, Washington, United States, 9/07/06. https://doi.org/10.1109/ISIT.2000.866674

Strategy for data transmission over binary channels with noiseless feedback and upper bound on the number of questions in searching with lies. / Balakirsky, V.B.
Proceedings 2000 IEEE International Symposium on Information Theory, June 25-30, Sorrento, Italy. Piscataway: Institute of Electrical and Electronics Engineers, 2000. p. 376-376 866674.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

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

AU - Balakirsky, V.B.

PY - 2000

Y1 - 2000

N2 - 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".

AB - 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".

U2 - 10.1109/ISIT.2000.866674

DO - 10.1109/ISIT.2000.866674

M3 - Conference contribution

SN - 0-7803-5857-0

SP - 376

EP - 376

BT - Proceedings 2000 IEEE International Symposium on Information Theory, June 25-30, Sorrento, Italy

PB - Institute of Electrical and Electronics Engineers

CY - Piscataway

T2 - 2006 IEEE International Symposium on Information Theory, ISIT 2006

Y2 - 9 July 2006 through 14 July 2006

ER -

Balakirsky VB. Strategy for data transmission over binary channels with noiseless feedback and upper bound on the number of questions in searching with lies. In Proceedings 2000 IEEE International Symposium on Information Theory, June 25-30, Sorrento, Italy. Piscataway: Institute of Electrical and Electronics Engineers. 2000. p. 376-376. 866674 doi: 10.1109/ISIT.2000.866674

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

Abstract

Conference

Access to Document

Fingerprint

Cite this