DocumentCode
2514944
Title
On the code reverse engineering problem
Author
Cluzeau, Mathieu ; Tillich, Jean-Pierre
Author_Institution
INRIA, Le Chesnay
fYear
2008
fDate
6-11 July 2008
Firstpage
634
Lastpage
638
Abstract
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.
Keywords
parity check codes; reverse engineering; LDPC codes; code reverse engineering problem; lower bound; noisy codewords; Communication channels; Context; Entropy; Error correction; Memoryless systems; Mutual coupling; Mutual information; Parity check codes; Random variables; Reverse engineering;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2008. ISIT 2008. IEEE International Symposium on
Conference_Location
Toronto, ON
Print_ISBN
978-1-4244-2256-2
Electronic_ISBN
978-1-4244-2257-9
Type
conf
DOI
10.1109/ISIT.2008.4595063
Filename
4595063
Link To Document