On the code reverse engineering problem
Mathieu Cluzeau, Jean–Pierre Tillich · 2008
This article deals with the problem of quantifying how many noisy codewords have to be eavesdropped in order to reverse engineer a code. The main result of this paper is a lower bound on this quantity and the proof that this number is logarithmic in the length for LDPC codes.