314 search results - page 22 / 63 » A Comparison of Known Codes, Random Codes, and the Best Code... |
MOBIHOC
2012
ACM
11 years 11 months ago
2012
ACM
In this paper, we characterize the throughput of a broadcast network with n receivers using rateless codes with block size K. We assume that the underlying channel is a Markov mod...
DCC
2007
IEEE
14 years 8 months ago
2007
IEEE
We find lower bounds on the minimum distance and characterize codewords of small weight in low-density parity check codes defined by (dual) classical generalized quadrangles. We a...
ESTIMEDIA
2004
Springer
14 years 2 months ago
2004
Springer
We proposed a hardware accelerator IP for the Tier-1 portion of Embedded Block Coding with Optimal Truncation (EBCOT) used in the JPEG2000 next generation image compression standa...
CRYPTO
2008
Springer
13 years 10 months ago
2008
Springer
In this paper we introduce the notion of a Public-Key Encryption Scheme that is also a Locally-Decodable Error-Correcting Code (PKLDC). In particular, we allow any polynomialtime ...
CRYPTO
2000
Springer
14 years 7 days ago
2000
Springer
The best known constructions for arrays with low bias are those from [1] and the exponential sum method based on the WeilCarlitz-Uchiyama bound. They all yield essentially the same...