Sciweavers

498 search results - page 8 / 100
» New Constructions for IPP Codes
Sort
View
CORR
2010
Springer
95views Education» more  CORR 2010»
13 years 7 months ago
A New Lower Bound on the Density of Vertex Identifying Codes for the Infinite Hexagonal Grid
Given a graph G, an identifying code D V (G) is a vertex set such that for any two distinct vertices v1, v2 V (G), the sets N[v1] D and N[v2] D are distinct and nonempty (here...
Daniel W. Cranston, Gexin Yu
DM
2008
93views more  DM 2008»
13 years 7 months ago
Nonbinary quantum error-correcting codes from algebraic curves
We give a new exposition and proof of a generalized CSS construction for nonbinary quantum error-correcting codes. Using this we construct nonbinary quantum stabilizer codes with ...
Jon-Lark Kim, Judy Walker
CODCRY
2009
Springer
174views Cryptology» more  CODCRY 2009»
14 years 1 months ago
Equal-Weight Fingerprinting Codes
We consider binary fingerprinting codes that trace at least one of t pirates using the marking assumption. Ensembles of binary equal-weight codes are considered along with a new e...
Ilya Dumer
COMBINATORICS
1998
63views more  COMBINATORICS 1998»
13 years 6 months ago
On Kissing Numbers in Dimensions 32 to 128
An elementary construction using binary codes gives new record kissing numbers in dimensions from 32 to 128.
Yves Edel, Eric M. Rains, Neil J. A. Sloane
JCT
2011
106views more  JCT 2011»
13 years 2 months ago
Bounds for separating hash families
This paper aims to present a new upper bound on the size of separating hash families. This bound improves previously known bounds for separating hash families of general type. Key...
Marjan Bazrafshan, Tran van Trung