370 search results - page 31 / 74 » tits 2008 |
TIT
2008
13 years 7 months ago
2008
We present some improved bounds on necessary conditions for separating hash families of type {w, w} and type {w, w - 1}. In particular, these bounds apply to secure frameproof cod...
TIT
2008
13 years 7 months ago
2008
The term binary combinatorial Gray code refers to a list of binary words such that the Hamming distance between two neighboring words is one and the list satisfies some additional ...
TIT
2008
13 years 7 months ago
2008
A source XXX goes through an erasure channel whose output is ZZZ. The goal is to compress losslessly XXX when the compressor knows XXX and ZZZ and the decompressor knows ZZZ. We pr...
TIT
2008
13 years 7 months ago
2008
For a linear code , the stopping redundancy of is defined as the minimum number of check nodes in a Tanner graph T for such that the size of the smallest stopping set in T is equal...
TIT
2008
13 years 7 months ago
2008
We study the functional codes C2(X) defined on projective varieties X, in the case where X P3 is a 1-degenerate quadric or a non-degenerate quadric (hyperbolic or elliptic). We fi...