25 search results - page 1 / 5 » Exact Bounds on the Sizes of Covering Codes |
DCC
2003
IEEE
14 years 4 months ago
2003
IEEE
DAC
2005
ACM
14 years 6 months ago
2005
ACM
Covering problems arise in many areas of electronic design automation such as logic minimization and technology mapping. An exact solution can critically impact both size and perf...
CORR
1999
Springer
13 years 5 months ago
1999
Springer
: This paper computationally obtains optimal bounded-weight, binary, error-correcting codes for a variety of distance bounds and dimensions. We compare the sizes of our codes to th...
DCC
2001
IEEE
14 years 4 months ago
2001
IEEE
The multicovering radii of a code are recent generalizations of the covering radius of a code. For positive m, the m-covering radius of C is the least radius t such that every m-tu...
JCT
2002
13 years 5 months ago
2002
An asymmetric binary covering code of length n and radius R is a subset C of the n-cube Qn such that every vector x Qn can be obtained from some vector c C by changing at most R...