Sciweavers

50 search results - page 5 / 10
» dcc 2010
Sort
View
DCC
2010
IEEE
14 years 4 months ago
Parameter choices and a better bound on the list size in the Guruswami-Sudan algorithm for algebraic geometry codes
Abstract. Given an algebraic geometry code CL(D, P), the GuruswamiSudan algorithm produces a list of all codewords in CL(D, P) within a specified distance of a received word. The i...
Nathan Drake, Gretchen L. Matthews
DCC
2010
IEEE
15 years 4 months ago
A Flexible Multiple Description Coding Scheme Based on Rateless Codes
The multiple description coding of an independent and identically distributed Gaussian source over bit error channels is considered. A novel practical multiple description coding ...
Ozgun Y. Bursalioglu, Giuseppe Caire
DCC
2010
IEEE
14 years 10 months ago
Comparing two pairing-based aggregate signature schemes
In 2003, Boneh, Gentry, Lynn and Shacham (BGLS) devised the first provably-secure aggregate signature scheme. Their scheme uses bilinear pairings and their security proof is in the...
Sanjit Chatterjee, Darrel Hankerson, Edward Knapp,...
DCC
2010
IEEE
14 years 10 months ago
A tight asymptotic bound on the size of constant-weight conflict-avoiding codes
In the study of multiple-access in the collision channel, conflict-avoiding code is used to guarantee that each transmitting user can send at least one packet successfully in the w...
Kenneth W. Shum, Wing Shing Wong
DCC
2010
IEEE
15 years 4 months ago
LZ77-Like Compression with Fast Random Access
We introduce an alternative Lempel-Ziv text parsing, LZ-End, that converges to the entropy and in practice gets very close to LZ77. LZ-End forces sources to finish at the end of ...
Sebastian Kreft, Gonzalo Navarro