114 search results - page 5 / 23 » Hardness of Approximating the Minimum Distance of a Linear C... |
IH
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. We present systematic strategy for collusions attacking a fingerprinting scheme. As a particular case, this strategy shows that linear codes are not good fingerprinting...
106
click to vote
TIT
2010
14 years 7 months ago
2010
We consider a new class of linear codes, called affine Grassmann codes. These can be viewed as a variant of generalized Reed-Muller codes and are closely related to Grassmann codes...
108
click to vote
ICML
2010
IEEE
15 years 1 months ago
2010
IEEE
Restricted Boltzmann Machines (RBMs) are a type of probability model over the Boolean cube {-1, 1}n that have recently received much attention. We establish the intractability of ...
CORR
2008
Springer
15 years 13 days ago
2008
Springer
Guruswami and Indyk showed in [1] that Forney's error exponent can be achieved with linear coding complexity over binary symmetric channels. This paper extends this conclusion...
GLOBECOM
2006
IEEE
15 years 6 months ago
2006
IEEE
— In this paper we present protograph codes with a small number of degree-3 nodes and one high degree node. The iterative decoding threshold for proposed rate 1/2 codes are lower...