Detection and recognition of a binary linear code (Q5939245)

This paper fills the gap in the literature dealing with the specific problem of detecting and recognizing a binary linear code in a binary stream under the hypotheses that the observed binary stream has crossed an encoder and a binary symmetric channel, and we can extract the consecutive (erroneous) code words from it. This leads us to another one, the `rank reduction' problem, which we will call NP-complete. If the general problem seems intractable the practical situation is quite different, and we should study the possibilities of solving real instances. The paper continues with the generalities about detection and recognition problems and how one should tackle the problem to ensure reliability. Further, the design of algorithms that will retrieve the dual code in the binary symmetric channel context are given. These solutions go hand in hand with an elaborated probabilistic system which is investigated in the paper. Finally, a case study of codes is presented, and the use of the methods are given.