1016 search results - page 18 / 204 » Linear error-block codes |
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...
ICISC
2007
15 years 1 months ago
2007
We characterize the traceability properties of linear codes. It is well known that any code of length n and minimum distance d is a c-TA code if c2 < n/(n−d). In this paper, w...
CORR
2010
Springer
14 years 11 months ago
2010
Springer
The maximum-likelihood decoding problem is known to be NP-hard for general linear and Reed-Solomon codes [1, 4]. In this paper, we introduce the notion of A-covered codes, that is...
JCT
2006
14 years 11 months ago
2006
The van Lint-Wilson AB-method yields a short proof of the Roos bound for the minimum distance of a cyclic code. We use the AB-method to obtain a different bound for the weights of...
GLOBECOM
2008
IEEE
15 years 6 months ago
2008
IEEE
—In this paper, we study the iterative detection problem for a coded system with multi-ary modulation. We show that, with iterative linear minimum-mean-square-error (LMMSE) detec...