Loading...
conference paper
On the Computational Complexity of Blind Detection of Binary Linear Codes
2019
2019 IEEE International Symposium on Information Theory
In this work, we study the computational complexity of the Minimum Distance Code Detection problem. In this problem, we are given a set of noisy codeword observations and we wish to find a code in a set of linear codes C of a given dimension k, for which the sum of distances between the observations and the code is minimized. We prove that, for the practically relevant case when the set C only contains a fixed number of candidate linear codes, the detection problem is NP-hard and we identify a number of interesting open questions related to the code detection problem.
Type
conference paper
Web of Science ID
WOS:000489100302109
ArXiv ID
1806.01050
Publication date
2019
Publisher
Published in
2019 IEEE International Symposium on Information Theory
Publisher place
New York
Start page
2449
End page
2453
Peer reviewed
REVIEWED
EPFL units
Event name | Event place | Event date |
Paris, FRANCE | July 07-12, 2019 | |
Available on Infoscience
August 14, 2019
Use this identifier to reference this record