New Bounds on Separable Codes for Multimedia Fingerprinting
Multimedia fingerprinting is an effective technique to trace the sources of pirate copies of copyrighted multimedia contents. Separable codes were introduced to detect colluders taking part in the averaging attack, which is the most feasible approach to perform a collusion attack. In this paper, we...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on information theory 2014-09, Vol.60 (9), p.5257-5262 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 5262 |
|---|---|
| container_issue | 9 |
| container_start_page | 5257 |
| container_title | IEEE transactions on information theory |
| container_volume | 60 |
| creator | Gao, Fei Ge, Gennian |
| description | Multimedia fingerprinting is an effective technique to trace the sources of pirate copies of copyrighted multimedia contents. Separable codes were introduced to detect colluders taking part in the averaging attack, which is the most feasible approach to perform a collusion attack. In this paper, we provide some improved bounds for the size of separable codes. Using a combinatorial technique named grouping coordinates, we have greatly reduced the upper bound. On the other hand, we also provide some lower bounds for the size of separable codes by both probabilistic and deterministic construction methods. In particular, 2̅-separable codes with asymptotically optimal rate are obtained by the deletion method. |
| doi_str_mv | 10.1109/TIT.2014.2331989 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_ieee_primary_6840329</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6840329</ieee_id><sourcerecordid>3410494241</sourcerecordid><originalsourceid>FETCH-LOGICAL-c321t-4ecfcd949f0cdb9e9692d92002833867b6766cb452db14be99848eb5497e2f4a3</originalsourceid><addsrcrecordid>eNo9kE1Lw0AQhhdRsFbvgpeAeEzdz2QHT1qsFqoerOdls5lISprU3QTx37uloaeZYZ53Pl5CrhmdMUbhfr1czzhlcsaFYKDhhEyYUnkKmZKnZEIp0ylIqc_JRQibWErF-IQ8vONv8tQNbRmSrk0-cWe9LRpM5l2JIak6n7wNTV9vsaxtsqjbb_Q7X7d9zC7JWWWbgFdjnJKvxfN6_pquPl6W88dV6gRnfSrRVa4ECRV1ZQEIGfASOKVcC6GzvMjyLHOFVLwsmCwQQEuNhZKQI6-kFVNye5i7893PgKE3m27wbVxp4otKCCWZihQ9UM53IXisTLxza_2fYdTsLTLRIrO3yIwWRcndONgGZ5vK29bV4ajjWtOcSha5mwNXI-KxnWlJBQfxD3LRbZA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1555335415</pqid></control><display><type>article</type><title>New Bounds on Separable Codes for Multimedia Fingerprinting</title><source>IEEE Electronic Library (IEL)</source><creator>Gao, Fei ; Ge, Gennian</creator><creatorcontrib>Gao, Fei ; Ge, Gennian</creatorcontrib><description>Multimedia fingerprinting is an effective technique to trace the sources of pirate copies of copyrighted multimedia contents. Separable codes were introduced to detect colluders taking part in the averaging attack, which is the most feasible approach to perform a collusion attack. In this paper, we provide some improved bounds for the size of separable codes. Using a combinatorial technique named grouping coordinates, we have greatly reduced the upper bound. On the other hand, we also provide some lower bounds for the size of separable codes by both probabilistic and deterministic construction methods. In particular, 2̅-separable codes with asymptotically optimal rate are obtained by the deletion method.</description><identifier>ISSN: 0018-9448</identifier><identifier>EISSN: 1557-9654</identifier><identifier>DOI: 10.1109/TIT.2014.2331989</identifier><identifier>CODEN: IETTAW</identifier><language>eng</language><publisher>New York, NY: IEEE</publisher><subject>Applied sciences ; Codes ; Collusion ; Educational institutions ; Exact sciences and technology ; Feasibility ; Frequency modulation ; Identification systems ; Indexes ; Information theory ; Information, signal and communications theory ; Multimedia communication ; Probabilistic logic ; Probability ; Telecommunications and information theory ; Upper bound ; Vectors</subject><ispartof>IEEE transactions on information theory, 2014-09, Vol.60 (9), p.5257-5262</ispartof><rights>2015 INIST-CNRS</rights><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Sep 2014</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c321t-4ecfcd949f0cdb9e9692d92002833867b6766cb452db14be99848eb5497e2f4a3</citedby><cites>FETCH-LOGICAL-c321t-4ecfcd949f0cdb9e9692d92002833867b6766cb452db14be99848eb5497e2f4a3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6840329$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,778,782,794,27907,27908,54741</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6840329$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=28807041$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Gao, Fei</creatorcontrib><creatorcontrib>Ge, Gennian</creatorcontrib><title>New Bounds on Separable Codes for Multimedia Fingerprinting</title><title>IEEE transactions on information theory</title><addtitle>TIT</addtitle><description>Multimedia fingerprinting is an effective technique to trace the sources of pirate copies of copyrighted multimedia contents. Separable codes were introduced to detect colluders taking part in the averaging attack, which is the most feasible approach to perform a collusion attack. In this paper, we provide some improved bounds for the size of separable codes. Using a combinatorial technique named grouping coordinates, we have greatly reduced the upper bound. On the other hand, we also provide some lower bounds for the size of separable codes by both probabilistic and deterministic construction methods. In particular, 2̅-separable codes with asymptotically optimal rate are obtained by the deletion method.</description><subject>Applied sciences</subject><subject>Codes</subject><subject>Collusion</subject><subject>Educational institutions</subject><subject>Exact sciences and technology</subject><subject>Feasibility</subject><subject>Frequency modulation</subject><subject>Identification systems</subject><subject>Indexes</subject><subject>Information theory</subject><subject>Information, signal and communications theory</subject><subject>Multimedia communication</subject><subject>Probabilistic logic</subject><subject>Probability</subject><subject>Telecommunications and information theory</subject><subject>Upper bound</subject><subject>Vectors</subject><issn>0018-9448</issn><issn>1557-9654</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2014</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNo9kE1Lw0AQhhdRsFbvgpeAeEzdz2QHT1qsFqoerOdls5lISprU3QTx37uloaeZYZ53Pl5CrhmdMUbhfr1czzhlcsaFYKDhhEyYUnkKmZKnZEIp0ylIqc_JRQibWErF-IQ8vONv8tQNbRmSrk0-cWe9LRpM5l2JIak6n7wNTV9vsaxtsqjbb_Q7X7d9zC7JWWWbgFdjnJKvxfN6_pquPl6W88dV6gRnfSrRVa4ECRV1ZQEIGfASOKVcC6GzvMjyLHOFVLwsmCwQQEuNhZKQI6-kFVNye5i7893PgKE3m27wbVxp4otKCCWZihQ9UM53IXisTLxza_2fYdTsLTLRIrO3yIwWRcndONgGZ5vK29bV4ajjWtOcSha5mwNXI-KxnWlJBQfxD3LRbZA</recordid><startdate>20140901</startdate><enddate>20140901</enddate><creator>Gao, Fei</creator><creator>Ge, Gennian</creator><general>IEEE</general><general>Institute of Electrical and Electronics Engineers</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20140901</creationdate><title>New Bounds on Separable Codes for Multimedia Fingerprinting</title><author>Gao, Fei ; Ge, Gennian</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c321t-4ecfcd949f0cdb9e9692d92002833867b6766cb452db14be99848eb5497e2f4a3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2014</creationdate><topic>Applied sciences</topic><topic>Codes</topic><topic>Collusion</topic><topic>Educational institutions</topic><topic>Exact sciences and technology</topic><topic>Feasibility</topic><topic>Frequency modulation</topic><topic>Identification systems</topic><topic>Indexes</topic><topic>Information theory</topic><topic>Information, signal and communications theory</topic><topic>Multimedia communication</topic><topic>Probabilistic logic</topic><topic>Probability</topic><topic>Telecommunications and information theory</topic><topic>Upper bound</topic><topic>Vectors</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Gao, Fei</creatorcontrib><creatorcontrib>Ge, Gennian</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>IEEE transactions on information theory</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Gao, Fei</au><au>Ge, Gennian</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>New Bounds on Separable Codes for Multimedia Fingerprinting</atitle><jtitle>IEEE transactions on information theory</jtitle><stitle>TIT</stitle><date>2014-09-01</date><risdate>2014</risdate><volume>60</volume><issue>9</issue><spage>5257</spage><epage>5262</epage><pages>5257-5262</pages><issn>0018-9448</issn><eissn>1557-9654</eissn><coden>IETTAW</coden><abstract>Multimedia fingerprinting is an effective technique to trace the sources of pirate copies of copyrighted multimedia contents. Separable codes were introduced to detect colluders taking part in the averaging attack, which is the most feasible approach to perform a collusion attack. In this paper, we provide some improved bounds for the size of separable codes. Using a combinatorial technique named grouping coordinates, we have greatly reduced the upper bound. On the other hand, we also provide some lower bounds for the size of separable codes by both probabilistic and deterministic construction methods. In particular, 2̅-separable codes with asymptotically optimal rate are obtained by the deletion method.</abstract><cop>New York, NY</cop><pub>IEEE</pub><doi>10.1109/TIT.2014.2331989</doi><tpages>6</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 0018-9448 |
| ispartof | IEEE transactions on information theory, 2014-09, Vol.60 (9), p.5257-5262 |
| issn | 0018-9448 1557-9654 |
| language | eng |
| recordid | cdi_ieee_primary_6840329 |
| source | IEEE Electronic Library (IEL) |
| subjects | Applied sciences Codes Collusion Educational institutions Exact sciences and technology Feasibility Frequency modulation Identification systems Indexes Information theory Information, signal and communications theory Multimedia communication Probabilistic logic Probability Telecommunications and information theory Upper bound Vectors |
| title | New Bounds on Separable Codes for Multimedia Fingerprinting |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-16T17%3A52%3A15IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=New%20Bounds%20on%20Separable%20Codes%20for%20Multimedia%20Fingerprinting&rft.jtitle=IEEE%20transactions%20on%20information%20theory&rft.au=Gao,%20Fei&rft.date=2014-09-01&rft.volume=60&rft.issue=9&rft.spage=5257&rft.epage=5262&rft.pages=5257-5262&rft.issn=0018-9448&rft.eissn=1557-9654&rft.coden=IETTAW&rft_id=info:doi/10.1109/TIT.2014.2331989&rft_dat=%3Cproquest_RIE%3E3410494241%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1555335415&rft_id=info:pmid/&rft_ieee_id=6840329&rfr_iscdi=true |