• Separable Codes

Treffer: Separable Codes

Title:
Separable Codes
Authors:
MINQUAN CHENG, LIJUN JI, YING MIAO
Source:
IEEE transactions on information theory. 58(3):1791-1803
Publisher Information:
New York, NY: Institute of Electrical and Electronics Engineers, 2012.
Publication Year:
2012
Physical Description:
print, 27 ref
Original Material:
INIST-CNRS
Subject Terms:
Telecommunications, Télécommunications, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Telecommunications et theorie de l'information, Telecommunications and information theory, Théorie de l'information, du signal et des communications, Information, signal and communications theory, Théorie de l'information, Information theory, Théorie du signal et des communications, Signal and communications theory, Codage, codes, Coding, codes, Propriété intellectuelle, Intellectual property, Propiedad intelectual, Borne supérieure, Upper bound, Cota superior, Code optimal, Optimal code, Código optimal, Collusion, Colusión, Communication multimédia, Multimedia communication, Document multimédia, Multimedia document, Documento multimedia, Droit auteur, Copyright, Derecho autor, Multimédia, Multimedia, Méthode combinatoire, Combinatorial method, Método combinatorio, Méthode fingerprint, Fingerprint method, Método fingerprint, Méthode moyenne, Averaging method, Método medio, Système multimédia, Multimedia systems, AND anti-collusion code (AND-ACC), difference matrix, frameproof code (FPC), logical anti-collusion code (LACC), optimal code, projective plane, separable code (SC), upper bound
Document Type:
Fachzeitschrift Article
File Description:
text
Language:
English
Author Affiliations:
Department of Social Systems and Management, Graduate School of Systems and Information Engineering, University of Tsukuba, Ibaraki 305-8573, Japan
Department of Mathematics, Soochow University, Suzhou 215006, China
ISSN:
0018-9448
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=25594513
Rights:
Copyright 2015 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Telecommunications and information theory
Accession Number:
edscal.25594513
Database:
PASCAL Archive

Weitere Informationen

Multimedia fingerprinting is an effective technique to trace the sources of pirate copies of copyrighted multimedia information. Separable codes can be used to construct fingerprints resistant to the averaging collusion attack on multimedia contents. In this paper, we investigate t̄-separable codes from a combinatorial point of view. We first derive several upper bounds on the sizes of t̄-separable codes, and then turn our attention to the constructions of optimal 2-separable codes with short length. Two infinite families of optimal 2-separable codes of length 2 are constructed from projective planes, and all optimal 2̄-separable codes of length 3 are explicitly constructed by means of difference matrices. These optimal 2-separable codes with short length can be used to construct good 2-separable codes with long length by a known composition construction.