5 search results - page 1 / 1 » On Mixed Codes with Covering Radius 1 and Minimum Distance 2 |
COMBINATORICS
2007
13 years 4 months ago
2007
TIT
1998
13 years 4 months ago
1998
—We investigate a new class of codes for the optimal covering of vertices in an undirected graph Gsuch that any vertex in G can be uniquely identified by examining the vertices ...
IJCGA
2008
13 years 4 months ago
2008
Given a set P of points (clients) in the plane, a Euclidean 2-centre of P is a set of two points (facilities) in the plane such that the maximum distance from any client to its ne...
COMPGEOM
2001
ACM
13 years 8 months ago
2001
ACM
We propose a new randomized algorithm for maintaining a set of clusters among moving nodes in the plane. Given a specified cluster radius, our algorithm selects and maintains a va...
FFA
2007
13 years 4 months ago
2007
From a rational convex polytope of dimension r ≥ 2 J.P. Hansen constructed an error correcting code of length n = (q−1)r over the finite field Fq. A rational convex polytope...