Sciweavers

77 search results - page 4 / 16
» LT Codes
Sort
View
CPC
2004
69views more  CPC 2004»
13 years 6 months ago
New Bounds on Parent-Identifying Codes: The Case of Multiple Parents
Let C be a code of length n over an alphabet of q letters. A codeword y is called a descendant of a set of t codewords {x1 , . . . , xt } if yi {x1 i , . . . , xt i} for all i = ...
Noga Alon, Uri Stav
DCC
2004
IEEE
14 years 6 months ago
On a Class of Traceability Codes
Traceability codes are designed to be used in schemes that protect copyrighted digital data against piracy. The main aim of this paper is to give an answer to a Staddon-Stinson-We...
Tran van Trung, Sosina Martirosyan
IWOCA
2009
Springer
193views Algorithms» more  IWOCA 2009»
14 years 1 months ago
Gray Code Compression
An n-bit (cyclic) Gray code is a (cyclic) sequence of all n-bit strings such that consecutive strings differ in a single bit. We describe an algorithm which for every positive int...
Darko Dimitrov, Tomás Dvorák, Petr G...
CORR
2007
Springer
121views Education» more  CORR 2007»
13 years 7 months ago
Analysis and design of raptor codes for joint decoding using Information Content evolution
— In this paper, we present an analytical analysis of the convergence of raptor codes under joint decoding over the binary input additive white noise channel (BIAWGNC), and deriv...
Auguste Venkiah, Charly Poulliat, David Declercq
SOFSEM
2010
Springer
13 years 4 months ago
Fast and Compact Prefix Codes
It is well-known that, given a probability distribution over n characters, in the worst case it takes (n log n) bits to store a prefix code with minimum expected codeword length. H...
Travis Gagie, Gonzalo Navarro, Yakov Nekrich