Search Sciweavers | Sciweavers

238 search results - page 2 / 48

» Covering Codes for Hats-on-a-line

click to vote

COCO
2004
Springer

147views Algorithms» more COCO 2004»

The Complexity of the Covering Radius Problem on Lattices and Codes

13 years 8 months ago

Download www.cs.cmu.edu

We initiate the study of the computational complexity of the covering radius problem for point lattices, and approximation versions of the problem for both lattices and linear cod...

Venkatesan Guruswami, Daniele Micciancio, Oded Reg...

claim paper

Read More »

click to vote

JCT
2002

107views more JCT 2002»

Asymmetric Binary Covering Codes

13 years 4 months ago

Download www.math.sc.edu

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...

Joshua N. Cooper, Robert B. Ellis, Andrew B. Kahng

claim paper

Read More »

click to vote

TIT
2008

122views more TIT 2008»

Identifying Codes and Covering Problems

13 years 4 months ago

Download ipsit.bu.edu

The identifying code problem for a given graph involves finding a minimum set of vertices whose neighborhoods uniquely overlap at any given graph vertex. Initially introduced in 1...

Moshe Laifenfeld, Ari Trachtenberg

claim paper

Read More »

click to vote

DCC
2003
IEEE

104views Computer Graphics» more DCC 2003»

Exact Bounds on the Sizes of Covering Codes

14 years 4 months ago