54 search results - page 6 / 11 » Upper Bound on List-Decoding Radius of Binary Codes |
JCT
2002
13 years 7 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...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
This paper presents new lower and upper bounds for the optimal compression of binary prefix codes in terms of the most probable input symbol, where compression efficiency is determ...
STOC
2009
ACM
14 years 8 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...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
This paper is focused on the performance analysis of binary linear block codes (or ensembles) whose transmission takes place over independent and memoryless parallel channels. New ...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
Abstract--We address the maximum attainable rate of fingerprinting codes under the marking assumption, studying lower and upper bounds on the value of the rate for various sizes of...