| HAL-Inria | Publications, software ... of Inria's scientists |
On the code revers 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.
Cited literature [9 references]
https://hal.inria.fr/inria-00261471
Contributor : Mathieu Cluzeau <>
Submitted on : Friday, March 7, 2008 - 10:41:49 AM
Last modification on : Friday, May 25, 2018 - 12:02:03 PM
Long-term archiving on: : Friday, September 28, 2012 - 10:51:34 AM
Contributor : Mathieu Cluzeau <>
Submitted on : Friday, March 7, 2008 - 10:41:49 AM
Last modification on : Friday, May 25, 2018 - 12:02:03 PM
Long-term archiving on: : Friday, September 28, 2012 - 10:51:34 AM
File
CluzeauTillich.pdf
Files produced by the author(s)