#### Filter Results:

#### Publication Year

1976

2015

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Julien Bringer, Hervé Chabanne, Gérard D. Cohen, Bruno Kindarji, Gilles Zémor
- IEEE Transactions on Information Forensics and…
- 2008

Fuzzy commitment schemes, introduced as a link between biometrics and cryptography, are a way to handle biometric data matching as an error-correction issue. We focus here on finding the best error-correcting code with respect to a given database of biometric data. We propose a method that models discrepancies between biometric measurements as an erasure… (More)

- Ian F. Blake, Gérard D. Cohen, Mikhail Deza
- Information and Control
- 1979

- Gérard D. Cohen, Mark G. Karpovsky, Harold F. Mattson, James R. Schatz
- IEEE Trans. Information Theory
- 1985

All known results on covering radius are presented, as well as some new results. There are a number of upper and lower bounds, including asymptotic results, a few exact determinations of covering radius, some extensive relations with other aspects of coding theory through the Reed-Muller codes, and new results on the least covering radius of any linear [II,… (More)

- Alexander Barg, Gérard D. Cohen, Sylvia B. Encheva, Gregory A. Kabatiansky, Gilles Zémor
- SIAM J. Discrete Math.
- 2001

Let C be a code of length n over an alphabet of q letters. An n-word y is called a descendant of a set of t codewords x A code is said to have the t-identifying parent property if for any n-word that is a descendant of at most t parents it is possible to identify at least one of them. We prove that for any t ≤ q − 1 there exist sequences of such codes with… (More)

Fuzzy sketches, introduced as a link between biometry and cryptography, are a way of handling biometric data matching as an error correction issue. We focus here on iris biometrics and look for the best error-correcting code in that respect. We show that two-dimensional iterative min-sum decoding leads to results near the theoretical limits. In particular,… (More)

- Gérard D. Cohen, Abraham Lempel
- Discrete Mathematics
- 1985

- Gérard D. Cohen, Iiro S. Honkala, Antoine Lobstein, Gilles Zémor
- IEEE Trans. Computers
- 2001

ÐFault diagnosis of multiprocessor systems motivates the following graph-theoretic definition. A subset g of points in an undirected graph q
Y i is called an identifying code if the sets f
v g consisting of all elements of g within distance one from the vertex v are different. We also require that the sets f
v g are all nonempty. We take q to be… (More)

Separating codes (or systems) are known from combinatorics, and they enjoy increasing attention due to applications in digital fingerprinting. Previous applications are found in automata theory and the construction of fault-tolerant systems. Let Γ be a code of length n, and (T, U) a pair of disjoint subsets of Γ. We say that (T, U) is separated if there… (More)

- Gérard D. Cohen, Gilles Zémor
- IEEE Trans. Information Theory
- 1994

- Gérard D. Cohen
- IEEE Trans. Information Theory
- 1983