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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE transactions on information forensics and security Ročník 4; číslo 4; s. 768 - 780
Hlavní autori:	Jourdas, J.-F., Moulin, P.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York IEEE 01.12.2009 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!