On the code reverse engineering problem

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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [9 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01081582
Contributor : Jean-Pierre Tillich <>
Submitted on : Monday, November 10, 2014 - 6:39:16 AM
Last modification on : Friday, May 25, 2018 - 12:02:05 PM
Long-term archiving on: Wednesday, February 11, 2015 - 3:22:07 PM

File

articlev4.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Mathieu Cluzeau, Jean-Pierre Tillich. On the code reverse engineering problem. IEEE International Symposium on Information Theory ISIT 2008, Jul 2008, Toronto, Canada. pp.634 - 638, ⟨10.1109/ISIT.2008.4595063⟩. ⟨hal-01081582⟩

Share

Metrics

Record views

254

Files downloads

216