Combinatorial Properties for Traceability Codes Using Error Correcting Codes
In this correspondence, the combinatorial properties of traceability codes constructed from error-correcting codes are studied. Necessary and sufficient conditions for traceability codes constructed from maximum-distance separable (MDS) codes are provided. The known sufficient conditions for a trace...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on information theory 2007-02, Vol.53 (2), p.804-808 |
|---|---|
| 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 | 808 |
|---|---|
| container_issue | 2 |
| container_start_page | 804 |
| container_title | IEEE transactions on information theory |
| container_volume | 53 |
| creator | Hongxia Jin Blaum, M. |
| description | In this correspondence, the combinatorial properties of traceability codes constructed from error-correcting codes are studied. Necessary and sufficient conditions for traceability codes constructed from maximum-distance separable (MDS) codes are provided. The known sufficient conditions for a traceability code are proven to be also necessary for linear MDS codes |
| doi_str_mv | 10.1109/TIT.2006.889730 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_crossref_primary_10_1109_TIT_2006_889730</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4069145</ieee_id><sourcerecordid>914659189</sourcerecordid><originalsourceid>FETCH-LOGICAL-c447t-d2f0a1cba9e8c511e7b003d15dae14d38fffa5f73ef59f3da65a2831e0ea97473</originalsourceid><addsrcrecordid>eNp9kUFrGzEQhUVpoG6acw65LIG0p3U0K2lXOoYlbQ2G5uCcxVg7CgrrlSutD_n3kevQQg49DTPvm2Eej7FL4EsAbm43q82y4bxdam06wT-wBSjV1aZV8iNbcA66NlLqT-xzzs-llQqaBVv3cbcNE84xBRyrhxT3lOZAufIxVZuEjnAbxjC_VH0cyvgxh-mpuk-pyH1Midx8HPwRv7Azj2Omi7d6zh6_32_6n_X6149Vf7eunZTdXA-N5whui4a0UwDUbTkXA6gBCeQgtPcele8EeWW8GLBV2GgBxAlNJztxzr6d7u5T_H2gPNtdyI7GESeKh2wNyFYZ0KaQX_9LivKQAN4W8Pod-BwPaSouLBhlmqZRR-j2BLkUc07k7T6FHaYXC9weQ7AlBHsMwZ5CKBs3b2cxOxx9wsmF_G9Ny062Qhbu6sQFIvorS94WK0q8AuiGj5k</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>195922256</pqid></control><display><type>article</type><title>Combinatorial Properties for Traceability Codes Using Error Correcting Codes</title><source>IEEE Electronic Library (IEL)</source><creator>Hongxia Jin ; Blaum, M.</creator><creatorcontrib>Hongxia Jin ; Blaum, M.</creatorcontrib><description>In this correspondence, the combinatorial properties of traceability codes constructed from error-correcting codes are studied. Necessary and sufficient conditions for traceability codes constructed from maximum-distance separable (MDS) codes are provided. The known sufficient conditions for a traceability code are proven to be also necessary for linear MDS codes</description><identifier>ISSN: 0018-9448</identifier><identifier>EISSN: 1557-9654</identifier><identifier>DOI: 10.1109/TIT.2006.889730</identifier><identifier>CODEN: IETTAW</identifier><language>eng</language><publisher>New York, NY: IEEE</publisher><subject>Applied sciences ; Codes ; Coding, codes ; Combinatorial analysis ; Conferences ; Construction ; Cryptography ; Decoding ; Equations ; Error correcting codes ; Error correction ; Error correction codes ; Errors ; Exact sciences and technology ; Information theory ; Information, signal and communications theory ; Intersymbol interference ; maximum-distance separable (MDS) codes ; Parity check codes ; pirated copies ; Random variables ; Signal and communications theory ; Sockets ; Telecommunications and information theory ; traceability codes ; traitor tracing</subject><ispartof>IEEE transactions on information theory, 2007-02, Vol.53 (2), p.804-808</ispartof><rights>2007 INIST-CNRS</rights><rights>Copyright Institute of Electrical and Electronics Engineers, Inc. (IEEE) Feb 2007</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c447t-d2f0a1cba9e8c511e7b003d15dae14d38fffa5f73ef59f3da65a2831e0ea97473</citedby><cites>FETCH-LOGICAL-c447t-d2f0a1cba9e8c511e7b003d15dae14d38fffa5f73ef59f3da65a2831e0ea97473</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/4069145$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,792,27901,27902,54733</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4069145$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=18474634$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Hongxia Jin</creatorcontrib><creatorcontrib>Blaum, M.</creatorcontrib><title>Combinatorial Properties for Traceability Codes Using Error Correcting Codes</title><title>IEEE transactions on information theory</title><addtitle>TIT</addtitle><description>In this correspondence, the combinatorial properties of traceability codes constructed from error-correcting codes are studied. Necessary and sufficient conditions for traceability codes constructed from maximum-distance separable (MDS) codes are provided. The known sufficient conditions for a traceability code are proven to be also necessary for linear MDS codes</description><subject>Applied sciences</subject><subject>Codes</subject><subject>Coding, codes</subject><subject>Combinatorial analysis</subject><subject>Conferences</subject><subject>Construction</subject><subject>Cryptography</subject><subject>Decoding</subject><subject>Equations</subject><subject>Error correcting codes</subject><subject>Error correction</subject><subject>Error correction codes</subject><subject>Errors</subject><subject>Exact sciences and technology</subject><subject>Information theory</subject><subject>Information, signal and communications theory</subject><subject>Intersymbol interference</subject><subject>maximum-distance separable (MDS) codes</subject><subject>Parity check codes</subject><subject>pirated copies</subject><subject>Random variables</subject><subject>Signal and communications theory</subject><subject>Sockets</subject><subject>Telecommunications and information theory</subject><subject>traceability codes</subject><subject>traitor tracing</subject><issn>0018-9448</issn><issn>1557-9654</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2007</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNp9kUFrGzEQhUVpoG6acw65LIG0p3U0K2lXOoYlbQ2G5uCcxVg7CgrrlSutD_n3kevQQg49DTPvm2Eej7FL4EsAbm43q82y4bxdam06wT-wBSjV1aZV8iNbcA66NlLqT-xzzs-llQqaBVv3cbcNE84xBRyrhxT3lOZAufIxVZuEjnAbxjC_VH0cyvgxh-mpuk-pyH1Midx8HPwRv7Azj2Omi7d6zh6_32_6n_X6149Vf7eunZTdXA-N5whui4a0UwDUbTkXA6gBCeQgtPcele8EeWW8GLBV2GgBxAlNJztxzr6d7u5T_H2gPNtdyI7GESeKh2wNyFYZ0KaQX_9LivKQAN4W8Pod-BwPaSouLBhlmqZRR-j2BLkUc07k7T6FHaYXC9weQ7AlBHsMwZ5CKBs3b2cxOxx9wsmF_G9Ny062Qhbu6sQFIvorS94WK0q8AuiGj5k</recordid><startdate>20070201</startdate><enddate>20070201</enddate><creator>Hongxia Jin</creator><creator>Blaum, M.</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><scope>F28</scope><scope>FR3</scope></search><sort><creationdate>20070201</creationdate><title>Combinatorial Properties for Traceability Codes Using Error Correcting Codes</title><author>Hongxia Jin ; Blaum, M.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c447t-d2f0a1cba9e8c511e7b003d15dae14d38fffa5f73ef59f3da65a2831e0ea97473</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2007</creationdate><topic>Applied sciences</topic><topic>Codes</topic><topic>Coding, codes</topic><topic>Combinatorial analysis</topic><topic>Conferences</topic><topic>Construction</topic><topic>Cryptography</topic><topic>Decoding</topic><topic>Equations</topic><topic>Error correcting codes</topic><topic>Error correction</topic><topic>Error correction codes</topic><topic>Errors</topic><topic>Exact sciences and technology</topic><topic>Information theory</topic><topic>Information, signal and communications theory</topic><topic>Intersymbol interference</topic><topic>maximum-distance separable (MDS) codes</topic><topic>Parity check codes</topic><topic>pirated copies</topic><topic>Random variables</topic><topic>Signal and communications theory</topic><topic>Sockets</topic><topic>Telecommunications and information theory</topic><topic>traceability codes</topic><topic>traitor tracing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Hongxia Jin</creatorcontrib><creatorcontrib>Blaum, M.</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><collection>ANTE: Abstracts in New Technology & Engineering</collection><collection>Engineering Research Database</collection><jtitle>IEEE transactions on information theory</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Hongxia Jin</au><au>Blaum, M.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Combinatorial Properties for Traceability Codes Using Error Correcting Codes</atitle><jtitle>IEEE transactions on information theory</jtitle><stitle>TIT</stitle><date>2007-02-01</date><risdate>2007</risdate><volume>53</volume><issue>2</issue><spage>804</spage><epage>808</epage><pages>804-808</pages><issn>0018-9448</issn><eissn>1557-9654</eissn><coden>IETTAW</coden><abstract>In this correspondence, the combinatorial properties of traceability codes constructed from error-correcting codes are studied. Necessary and sufficient conditions for traceability codes constructed from maximum-distance separable (MDS) codes are provided. The known sufficient conditions for a traceability code are proven to be also necessary for linear MDS codes</abstract><cop>New York, NY</cop><pub>IEEE</pub><doi>10.1109/TIT.2006.889730</doi><tpages>5</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 0018-9448 |
| ispartof | IEEE transactions on information theory, 2007-02, Vol.53 (2), p.804-808 |
| issn | 0018-9448 1557-9654 |
| language | eng |
| recordid | cdi_crossref_primary_10_1109_TIT_2006_889730 |
| source | IEEE Electronic Library (IEL) |
| subjects | Applied sciences Codes Coding, codes Combinatorial analysis Conferences Construction Cryptography Decoding Equations Error correcting codes Error correction Error correction codes Errors Exact sciences and technology Information theory Information, signal and communications theory Intersymbol interference maximum-distance separable (MDS) codes Parity check codes pirated copies Random variables Signal and communications theory Sockets Telecommunications and information theory traceability codes traitor tracing |
| title | Combinatorial Properties for Traceability Codes Using Error Correcting Codes |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-18T23%3A21%3A13IST&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=Combinatorial%20Properties%20for%20Traceability%20Codes%20Using%20Error%20Correcting%20Codes&rft.jtitle=IEEE%20transactions%20on%20information%20theory&rft.au=Hongxia%20Jin&rft.date=2007-02-01&rft.volume=53&rft.issue=2&rft.spage=804&rft.epage=808&rft.pages=804-808&rft.issn=0018-9448&rft.eissn=1557-9654&rft.coden=IETTAW&rft_id=info:doi/10.1109/TIT.2006.889730&rft_dat=%3Cproquest_RIE%3E914659189%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=195922256&rft_id=info:pmid/&rft_ieee_id=4069145&rfr_iscdi=true |