3373 search results - page 39 / 675 » Linear transformations on codes |
123
click to vote
IH
2005
Springer
15 years 11 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...
166
click to vote
TIT
2010
15 years 26 days ago
2010
A message independence property and some new performance upper bounds are derived in this work for erasure, list and decision-feedback schemes with linear block codes transmitted ...
143
click to vote
ICISC
2007
15 years 7 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...
157
Voted
CORR
2010
Springer
15 years 6 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...
145
click to vote
JCT
2006
15 years 6 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...