22 search results - page 3 / 5 » Asymmetric Binary Covering Codes |
TIT
1998
13 years 5 months ago
1998
—A length n group code over a group G is a subgroup of Gn under component-wise group operation. Group codes over dihedral groups DM, with 2M elements, that are two-level construc...
TCSV
2002
13 years 5 months ago
2002
Abstract--In this paper, we describe an object-based video compression scheme based on the derivation and efficient coding of motion boundaries. First, we recursively identify a sm...
STOC
2009
ACM
14 years 6 months ago
2009
ACM
We give explicit constructions of epsilon nets for linear threshold functions on the binary cube and on the unit sphere. The size of the constructed nets is polynomial in the dime...
EVOW
2010
Springer
13 years 12 months ago
2010
Springer
Abstract. The fitness distance correlation (FDC) as a measure for problem difficulty was first introduced by Forrest and Jones. It was applied to many binary coded problems. This...
TIT
1998
13 years 5 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 ...