High-Rate Random-Like Spherical Fingerprinting Codes With Linear Decoding Complexity

The rate of a fingerprinting code is defined as R = (1/N) log 2 M, where N is the code length and M the number of users. Capacity is the supremum of achievable rates for a given class of collusion attacks. Most fingerprinting codes in current literature are algebraic constructions with high minimum...

Ausführliche Beschreibung