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

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

First IEEE International Conference on Biometrics…

25 May 2007

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

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

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