215 search results - page 13 / 43 » The asymptotic number of binary codes and binary matroids |
142
click to vote
PKC
2011
Springer
14 years 10 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...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
In this paper we introduce an information theoretic approach and use techniques from the theory of Huffman codes to construct a sequence of binary sampling vectors to determine a s...
FOCS
1999
IEEE
15 years 1 months ago
1999
IEEE
We show that the minimum distance of a linear code is not approximable to within any constant factor in random polynomial time (RP), unless nondeterministic polynomial time (NP) eq...
67
Voted
FTSIG
2008
14 years 9 months ago
2008
The purpose of this two-part monograph is to present a tutorial on set partition coding, with emphasis and examples on image wavelet transform coding systems, and describe their u...
TIP
2008
14 years 9 months ago
2008
In many practical distributed source coding (DSC) applications, correlation information has to be estimated at the encoder in order to determine the encoding rate. Coding efficien...