1060 search results - page 46 / 212 » Notes on Coding Theory |
INFOCOM
2012
IEEE
13 years 5 days ago
2012
IEEE
Abstract— We consider a wireless broadcast station that transmits packets to multiple users. The packet requests for each user may overlap, and some users may already have certai...
EUROCRYPT
2012
Springer
13 years 4 days ago
2012
Springer
Decoding random linear codes is a well studied problem with many applications in complexity theory and cryptography. The security of almost all coding and LPN/LWE-based schemes rel...
82
Voted
DCC
2008
IEEE
15 years 9 months ago
2008
IEEE
Complete (n, r)-arcs in PG(k - 1, q) and projective (n, k, n - r)q-codes that admit no projective extensions are equivalent objects. We show that projective codes of reasonable le...
DAGSTUHL
2006
14 years 11 months ago
2006
We show that Kolmogorov complexity and such its estimators as universal codes (or data compression methods) can be applied for hypothesis testing in a framework of classical mathe...
DCC
2006
IEEE
15 years 9 months ago
2006
IEEE
Abstract. We apply tools coming from singularity theory, as Hamburger-Noether expansions, and from valuation theory, as generating sequences, to explicitly describe order functions...