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 = ...
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...
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...
— 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...
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...