Single-user tracing and disjointly superimposed codes
The zero-error capacity region of r-out-of-T user multiple-access OR channel is investigated. A family F of subsets of [n] = {1, ..., n} is an r-single-user-tracing superimposed code (r-SUT) if there exists such a single-user-tracing function /spl phi/:2/sup [n]/ /spl rarr/ F that for all F' /s...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on information theory 2005-04, Vol.51 (4), p.1606-1611 |
|---|---|
| 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 | 1611 |
|---|---|
| container_issue | 4 |
| container_start_page | 1606 |
| container_title | IEEE transactions on information theory |
| container_volume | 51 |
| creator | Csros, M. Ruszinko, M. |
| description | The zero-error capacity region of r-out-of-T user multiple-access OR channel is investigated. A family F of subsets of [n] = {1, ..., n} is an r-single-user-tracing superimposed code (r-SUT) if there exists such a single-user-tracing function /spl phi/:2/sup [n]/ /spl rarr/ F that for all F' /spl sube/ F with 1 /spl les/ |F'| /spl les/ r, /spl phi/(/spl cup//sub A/spl isin/F/'A) /spl isin/ F'. In this correspondence, we introduce the concept of these codes and give bounds on their rate. We also consider disjointly r-superimposed codes. |
| doi_str_mv | 10.1109/TIT.2005.844097 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_ieee_primary_1412055</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1412055</ieee_id><sourcerecordid>896213370</sourcerecordid><originalsourceid>FETCH-LOGICAL-c488t-b09abdee81d23590e6d6f483db66c7655e1b3372902df70e97794ec28bd69de43</originalsourceid><addsrcrecordid>eNp9kE1LAzEQhoMoWKtnD14WQT1tm2TzeZTiR6HgwXoO2WRWtmx316R76L83ZQsFD56GYZ55mXkQuiV4RgjW8_VyPaMY85liDGt5hiaEc5lrwdk5mmBMVK4ZU5foKsZNahkndIL4Z91-N5APEUK2C9alNrOtz3wdN13d7pp9FoceQr3tuwg-c52HeI0uKttEuDnWKfp6fVkv3vPVx9ty8bzKHVNql5dY29IDKOJpwTUG4UXFVOFLIZwUnAMpi0JSjamvJAYtpWbgqCq90B5YMUVPY24fup8B4s5s6-igaWwL3RCN0oKSlIAT-fgvSRXBQhYH8P4PuOmG0KYvDNHpRqYpTdB8hFzoYgxQmT4JsGFvCDYH2ybZNgfbZrSdNh6OsTY621TBtq6OpzUhGC2oTtzdyNUAcBozQjHnxS-874aH</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>195904922</pqid></control><display><type>article</type><title>Single-user tracing and disjointly superimposed codes</title><source>IEEE Electronic Library (IEL)</source><creator>Csros, M. ; Ruszinko, M.</creator><creatorcontrib>Csros, M. ; Ruszinko, M.</creatorcontrib><description>The zero-error capacity region of r-out-of-T user multiple-access OR channel is investigated. A family F of subsets of [n] = {1, ..., n} is an r-single-user-tracing superimposed code (r-SUT) if there exists such a single-user-tracing function /spl phi/:2/sup [n]/ /spl rarr/ F that for all F' /spl sube/ F with 1 /spl les/ |F'| /spl les/ r, /spl phi/(/spl cup//sub A/spl isin/F/'A) /spl isin/ F'. In this correspondence, we introduce the concept of these codes and give bounds on their rate. We also consider disjointly r-superimposed codes.</description><identifier>ISSN: 0018-9448</identifier><identifier>EISSN: 1557-9654</identifier><identifier>DOI: 10.1109/TIT.2005.844097</identifier><identifier>CODEN: IETTAW</identifier><language>eng</language><publisher>New York, NY: IEEE</publisher><subject>Applied sciences ; Automation ; Bioinformatics ; Channels ; Cloning ; Codes ; Coding, codes ; Communication channels ; Computer science ; DNA ; Exact sciences and technology ; Genomics ; group testing ; Information theory ; Information, signal and communications theory ; Licenses ; Operations research ; physical mapping ; Signal and communications theory ; superimposed codes ; Telecommunications and information theory ; Testing</subject><ispartof>IEEE transactions on information theory, 2005-04, Vol.51 (4), p.1606-1611</ispartof><rights>2005 INIST-CNRS</rights><rights>Copyright Institute of Electrical and Electronics Engineers, Inc. (IEEE) Apr 2005</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c488t-b09abdee81d23590e6d6f483db66c7655e1b3372902df70e97794ec28bd69de43</citedby><cites>FETCH-LOGICAL-c488t-b09abdee81d23590e6d6f483db66c7655e1b3372902df70e97794ec28bd69de43</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/1412055$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,796,27924,27925,54758</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1412055$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=16642329$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Csros, M.</creatorcontrib><creatorcontrib>Ruszinko, M.</creatorcontrib><title>Single-user tracing and disjointly superimposed codes</title><title>IEEE transactions on information theory</title><addtitle>TIT</addtitle><description>The zero-error capacity region of r-out-of-T user multiple-access OR channel is investigated. A family F of subsets of [n] = {1, ..., n} is an r-single-user-tracing superimposed code (r-SUT) if there exists such a single-user-tracing function /spl phi/:2/sup [n]/ /spl rarr/ F that for all F' /spl sube/ F with 1 /spl les/ |F'| /spl les/ r, /spl phi/(/spl cup//sub A/spl isin/F/'A) /spl isin/ F'. In this correspondence, we introduce the concept of these codes and give bounds on their rate. We also consider disjointly r-superimposed codes.</description><subject>Applied sciences</subject><subject>Automation</subject><subject>Bioinformatics</subject><subject>Channels</subject><subject>Cloning</subject><subject>Codes</subject><subject>Coding, codes</subject><subject>Communication channels</subject><subject>Computer science</subject><subject>DNA</subject><subject>Exact sciences and technology</subject><subject>Genomics</subject><subject>group testing</subject><subject>Information theory</subject><subject>Information, signal and communications theory</subject><subject>Licenses</subject><subject>Operations research</subject><subject>physical mapping</subject><subject>Signal and communications theory</subject><subject>superimposed codes</subject><subject>Telecommunications and information theory</subject><subject>Testing</subject><issn>0018-9448</issn><issn>1557-9654</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2005</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNp9kE1LAzEQhoMoWKtnD14WQT1tm2TzeZTiR6HgwXoO2WRWtmx316R76L83ZQsFD56GYZ55mXkQuiV4RgjW8_VyPaMY85liDGt5hiaEc5lrwdk5mmBMVK4ZU5foKsZNahkndIL4Z91-N5APEUK2C9alNrOtz3wdN13d7pp9FoceQr3tuwg-c52HeI0uKttEuDnWKfp6fVkv3vPVx9ty8bzKHVNql5dY29IDKOJpwTUG4UXFVOFLIZwUnAMpi0JSjamvJAYtpWbgqCq90B5YMUVPY24fup8B4s5s6-igaWwL3RCN0oKSlIAT-fgvSRXBQhYH8P4PuOmG0KYvDNHpRqYpTdB8hFzoYgxQmT4JsGFvCDYH2ybZNgfbZrSdNh6OsTY621TBtq6OpzUhGC2oTtzdyNUAcBozQjHnxS-874aH</recordid><startdate>20050401</startdate><enddate>20050401</enddate><creator>Csros, M.</creator><creator>Ruszinko, 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>20050401</creationdate><title>Single-user tracing and disjointly superimposed codes</title><author>Csros, M. ; Ruszinko, M.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c488t-b09abdee81d23590e6d6f483db66c7655e1b3372902df70e97794ec28bd69de43</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2005</creationdate><topic>Applied sciences</topic><topic>Automation</topic><topic>Bioinformatics</topic><topic>Channels</topic><topic>Cloning</topic><topic>Codes</topic><topic>Coding, codes</topic><topic>Communication channels</topic><topic>Computer science</topic><topic>DNA</topic><topic>Exact sciences and technology</topic><topic>Genomics</topic><topic>group testing</topic><topic>Information theory</topic><topic>Information, signal and communications theory</topic><topic>Licenses</topic><topic>Operations research</topic><topic>physical mapping</topic><topic>Signal and communications theory</topic><topic>superimposed codes</topic><topic>Telecommunications and information theory</topic><topic>Testing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Csros, M.</creatorcontrib><creatorcontrib>Ruszinko, 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>Csros, M.</au><au>Ruszinko, M.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Single-user tracing and disjointly superimposed codes</atitle><jtitle>IEEE transactions on information theory</jtitle><stitle>TIT</stitle><date>2005-04-01</date><risdate>2005</risdate><volume>51</volume><issue>4</issue><spage>1606</spage><epage>1611</epage><pages>1606-1611</pages><issn>0018-9448</issn><eissn>1557-9654</eissn><coden>IETTAW</coden><abstract>The zero-error capacity region of r-out-of-T user multiple-access OR channel is investigated. A family F of subsets of [n] = {1, ..., n} is an r-single-user-tracing superimposed code (r-SUT) if there exists such a single-user-tracing function /spl phi/:2/sup [n]/ /spl rarr/ F that for all F' /spl sube/ F with 1 /spl les/ |F'| /spl les/ r, /spl phi/(/spl cup//sub A/spl isin/F/'A) /spl isin/ F'. In this correspondence, we introduce the concept of these codes and give bounds on their rate. We also consider disjointly r-superimposed codes.</abstract><cop>New York, NY</cop><pub>IEEE</pub><doi>10.1109/TIT.2005.844097</doi><tpages>6</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 0018-9448 |
| ispartof | IEEE transactions on information theory, 2005-04, Vol.51 (4), p.1606-1611 |
| issn | 0018-9448 1557-9654 |
| language | eng |
| recordid | cdi_ieee_primary_1412055 |
| source | IEEE Electronic Library (IEL) |
| subjects | Applied sciences Automation Bioinformatics Channels Cloning Codes Coding, codes Communication channels Computer science DNA Exact sciences and technology Genomics group testing Information theory Information, signal and communications theory Licenses Operations research physical mapping Signal and communications theory superimposed codes Telecommunications and information theory Testing |
| title | Single-user tracing and disjointly superimposed codes |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-06T20%3A57%3A33IST&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=Single-user%20tracing%20and%20disjointly%20superimposed%20codes&rft.jtitle=IEEE%20transactions%20on%20information%20theory&rft.au=Csros,%20M.&rft.date=2005-04-01&rft.volume=51&rft.issue=4&rft.spage=1606&rft.epage=1611&rft.pages=1606-1611&rft.issn=0018-9448&rft.eissn=1557-9654&rft.coden=IETTAW&rft_id=info:doi/10.1109/TIT.2005.844097&rft_dat=%3Cproquest_RIE%3E896213370%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=195904922&rft_id=info:pmid/&rft_ieee_id=1412055&rfr_iscdi=true |