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

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on information forensics and security Vol. 4; no. 4; pp. 768 - 780
Main Authors:	Jourdas, J.-F., Moulin, P.
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.12.2009 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Algebra Algorithms Capacity Codes coding Complexity Construction Decoding Fingerprint recognition Fingerprinting Fingerprints Interleaved codes Lists Matched filters Motion pictures Protection Robustness Turbo codes Viterbi algorithm Watermarking
ISSN:	1556-6013, 1556-6021
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!