On the Computational Complexity of Blind Detection of Binary Linear Codes

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.


Published in:
2019 IEEE International Symposium on Information Theory
Year:
2019
Publisher:
IEEE
Additional link:
Laboratories:




 Record created 2019-08-14, last modified 2019-08-14


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)