19 search results - page 4 / 4 » A new short proof of a theorem of Ahlswede and Khachatrian |
COMBINATORICS
1998
13 years 7 months ago
1998
The paper gives a matrix-free presentation of the correspondence between full-length linear codes and projective multisets. It generalizes the BrouwerVan Eupen construction that t...
CMA
2010
13 years 4 months ago
2010
It is shown that the Clar number can be arbitrarily larger than the cardinality of a maximal alternating set. In particular, a maximal alternating set of a hexagonal system need n...
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
While data compression and Kolmogorov complexity are both about effective coding of words, the two settings differ in the following respect. A compression algorithm or compressor...
ESORICS
2009
Springer
14 years 8 months ago
2009
Springer
Abstract. Several generic constructions for transforming one-way functions to asymmetric encryption schemes have been proposed. One-way functions only guarantee the weak secrecy of...