Coding with Noiseless Feedback

被引：11

作者：

Lebedev, V. S. ^{[1
]}

机构：

[1] Russian Acad Sci, Kharkevich Inst Informat Transmiss Problems, Moscow, Russia

来源：

PROBLEMS OF INFORMATION TRANSMISSION | 2016年 / 52卷 / 02期

基金：

俄罗斯科学基金会;

关键词：

D O I：

10.1134/S0032946016020010

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We consider the problem of error correction using nonbinary codes and assuming noiseless feedback. This is equivalent to the searching with lies problem. We improve the algorithm proposed by Ahlswede, Deppe, and Lebedev in [1].

引用

页码：103 / 113

页数：11

共 13 条

[1]

Ahlswede R., 2005, Annals of European Academy of Sciences, V1, P285

[2] Searching with lies [J].

Aigner, M .

JOURNAL OF COMBINATORIAL THEORY SERIES A, 1996, 74 (01) :43-56

[3]

[Anonymous], 1976, ADVENTURES MATH, DOI DOI 10.1063/1.3024514

[4] Nonbinary error-correcting codes with one-time error-free feedback [J].

Bassalygo L.A. .

Problems of Information Transmission, 2005, 41 (02) :125-129

[5]

Berlekamp Elwyn R, 1964, BLOCK CODING NOISELE

[6]

Brualdi RA., 2010, Introductory Combinatorics, V5

[7]

Cicalese F, 2013, MONOGR THEOR COMPUT, P1, DOI 10.1007/978-3-642-17327-1

[8] Solution of Ulam's searching game with three lies or an optimal adaptive strategy for binary three-error-correcting codes [J].

Deppe, C .

DISCRETE MATHEMATICS, 2000, 224 (1-3) :79-98

[9]

Du D Z, 2000, Combinatorial Group Testing and Its Applications

[10] SOLUTION OF ULAM PROBLEM ON SEARCHING WITH A LIE [J].

PELC, A .

JOURNAL OF COMBINATORIAL THEORY SERIES A, 1987, 44 (01) :129-140

← 1 2 →