• Publications
  • Influence
Covering Codes
  • 345
  • 19
  • PDF
Linear binary code for write-once memories
TLDR
An application of error-correcting codes to "write-once" memories as defined by Rivest and Shamir is studied. Expand
  • 102
  • 13
Covering radius - Survey and recent results
TLDR
All known results on covering radius are presented, as well as some new results on the complexity of computing the covering radius. Expand
  • 252
  • 12
  • PDF
Coding with Permutations
TLDR
A permutation array (PA) of degree r and size v is a set of v permutations on a set -q, I -(2 = r (thought of as v orderings of the r elements), with the property that any two distinct permutations agree in at most A positions. Expand
  • 90
  • 10
Theoretical and Practical Boundaries of Binary Secure Sketches
TLDR
We propose a method that models discrepancies between biometric measurements as an erasure and error channel, and we estimate its capacity. Expand
  • 100
  • 9
Further results on the covering radius of codes
TLDR
A number of upper and lower bounds are obtained for K(n, R) , the minimal number of codewords in any binary code of length n and covering radius R . Expand
  • 148
  • 7
  • PDF
Optimal Iris Fuzzy Sketches
TLDR
Fuzzy sketches, introduced as a link between biometry and cryptography, are a way of handling biometric data matching as an error correction issue. Expand
  • 126
  • 7
  • PDF
Tilings of Binary Spaces
TLDR
We study partitions of the space $\F{n}$ of all the binary $n$-tuples into disjoint sets, where each set is an additive coset of a given set $V$. Expand
  • 35
  • 6
On identifying codes
  • 66
  • 4
Bounds for Codes Identifying Vertices in the Hexagonal Grid
TLDR
In an undirected graph G=(V,E), a subset $C \subseteq V$ is called an identifying code if the sets $B_1(v) \cap C$ consisting of all elements of C within distance one from the vertex v are nonempty and different. Expand
  • 48
  • 4
  • PDF