Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

60

Voted

COMBINATORICS
2006

107views more COMBINATORICS 2006»

Covering Codes for Hats-on-a-line

15 years 2 months ago

Covering Codes for Hats-on-a-line

Download www.combinatorics.org

Sarang Aravamuthan, Sachin Lodha

Real-time Traffic

COMBINATORICS 2006 |

claim paper

Related Content

» Constructing Good Covering Codes for Applications in Steganography

» Multicovering Bounds from Relative Covering Radii

» A random construction for permutation codes and the covering radius

» Bounds on the Covering Radius of Linear Codes

» Linear programming bounds for codes via a covering argument

» The Complexity of the Covering Radius Problem on Lattices and Codes

» Asymmetric Binary Covering Codes

» Identifying Codes and Covering Problems

» Exact Bounds on the Sizes of Covering Codes

Post Info
More Details (n/a)

Added	11 Dec 2010
Updated	11 Dec 2010
Type	Journal
Year	2006
Where	COMBINATORICS
Authors	Sarang Aravamuthan, Sachin Lodha

Comments (0)