Conference
Sequence Reconstruction for Grassmann Graphs and Permutations
Abstract
The sequence-reconstruction problem was first proposed by Levenshtein in 2001. This problem studies the model where the same word is transmitted over multiple channels. If the transmitted word belongs to some code of minimum distance $d$ and there are at most $r$ errors in every channel, then the minimum number of channels that guarantees a successful decoder (under the assumption that all channel outputs are distinct) has to be greater than …
Authors
Yaakobi E; Schwartz M; Langberg M; Bruck J
Pagination
pp. 874-878
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Publication Date
July 1, 2013
DOI
10.1109/isit.2013.6620351
Name of conference
2013 IEEE International Symposium on Information Theory