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...
The multiple description coding of an independent and identically distributed Gaussian source over bit error channels is considered. A novel practical multiple description coding ...
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,...
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...
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 ...