Name
Abstract | ||
|---|---|---|
Frameproof codes are used to fingerprint digital data. They can prevent copyrighted materials from unauthorized use. In this paper, we study upper and lower bounds for w-frameproof codes of length N over an alphabet of size q. The upper bound is based on a combinatorial approach and the lower bound is based on a probabilistic construction. Both bounds can improve one of the previous results when q... |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1109/TIT.2017.2745619 | IEEE Transactions on Information Theory |
Keywords | Field | DocType |
Upper bound,Decoding,Electronic mail,Probabilistic logic,Error correction codes,Standards,Indexes | Discrete mathematics,Combinatorics,Upper and lower bounds,Computer science,Decoding methods,Probabilistic logic,Digital data,Binary number,Alphabet | Journal |
Volume | Issue | ISSN |
63 | 11 | 0018-9448 |
Citations | PageRank | References |
7 | 0.58 | 5 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chong Shangguan | 1 | 34 | 3.80 |
| Xin Wang | 2 | 587 | 177.85 |
| Gennian Ge | 3 | 904 | 95.51 |
| Ying Miao | 4 | 491 | 43.85 |