1579 search results - page 128 / 316 » On the Constructions of Constant-Weight Codes |
TIT
2008
14 years 10 months ago
2008
We investigate the decoding problem of Reed-Solomon (RS) Codes, also known as the Polynomial Reconstruction Problem (PR), from a cryptographic hardness perspective. Namely, we dea...
104
click to vote
IDA
2008
Springer
14 years 9 months ago
2008
Springer
We developed Relational Data Mining approach which allows to overcome essential limitations of the Data Mining and Knowledge Discovery techniques. In the paper the approach was im...
DCC
2010
IEEE
14 years 10 months ago
2010
IEEE
In this paper, we consider new results on (k, n)-caps with n > 2. We provide a lower bound on the size of such caps. Furthermore, we generalize two product constructions for (k,...
145
click to vote
PKC
2011
Springer
14 years 24 days ago
2011
Springer
ded abstract of this work appears in Public Key Cryptography — PKC 2011, ed. R. Gennaro, Springer LNCS 6571 (2011), 1–16. This is the full version. We propose a linearly homom...
ICC
2008
IEEE
15 years 4 months ago
2008
IEEE
— In a distributed space-time coding scheme, based on the relay channel model, the relay nodes co-operate to linearly process the transmitted signal from the source and forward t...