On the Computational Complexity of Blind Detection of Binary Linear Codes
arXiv:1806.01050
Abstract
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 of a given dimension , 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 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.
Accepted for presentation at IEEE ISIT 2019