Loading…
Classification of Strongly Conflict-Avoiding Codes
Strongly conflict-avoiding codes (SCACs) for slot-asynchronous multiple-access collision channels without feedback are considered. Codes with maximum size (optimal codes) for given parameters are of interest. In this letter, we present classification results about optimal SCACs of weights 3, 4, and...
Saved in:
Published in: | IEEE communications letters 2018-12, Vol.22 (12), p.2415-2418 |
---|---|
Main Authors: | , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
cited_by | |
---|---|
cites | cdi_FETCH-LOGICAL-c246t-72c859f6832ad95f3b97a331af070c1a369d0ba430971540b07191fe84b2c67a3 |
container_end_page | 2418 |
container_issue | 12 |
container_start_page | 2415 |
container_title | IEEE communications letters |
container_volume | 22 |
creator | Baicheva, Tsonka Stefanova Topalova, Svetlana Todorova |
description | Strongly conflict-avoiding codes (SCACs) for slot-asynchronous multiple-access collision channels without feedback are considered. Codes with maximum size (optimal codes) for given parameters are of interest. In this letter, we present classification results about optimal SCACs of weights 3, 4, and 5 and given small lengths. We also determine some previously unknown values of the size of optimal SCACs with these parameters. |
doi_str_mv | 10.1109/LCOMM.2018.2874029 |
format | article |
fullrecord | <record><control><sourceid>proquest_ieee_</sourceid><recordid>TN_cdi_ieee_primary_8488490</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>8488490</ieee_id><sourcerecordid>2154039465</sourcerecordid><originalsourceid>FETCH-LOGICAL-c246t-72c859f6832ad95f3b97a331af070c1a369d0ba430971540b07191fe84b2c67a3</originalsourceid><addsrcrecordid>eNo9kE1LAzEQhoMoWKt_QC8Fz1snX5vkWBa_oKUH9Ryy2aSkrJuabIX-e1MrXmaG4X1m4EHoFsMcY1APy2a9Ws0JYDknUjAg6gxNMOeyIqWclxmkqoRQ8hJd5bwFAEk4niDS9Cbn4IM1Y4jDLPrZ25jisOkPsyYOvg92rBbfMXRh2JRN5_I1uvCmz-7mr0_Rx9Pje_NSLdfPr81iWVnC6rESxEqufC0pMZ3inrZKGEqx8SDAYkNr1UFrGAUlMGfQgsAKeydZS2xdolN0f7q7S_Fr7_Kot3GfhvJSkyNAFat5SZFTyqaYc3Je71L4NOmgMeijG_3rRh_d6D83Bbo7QcE59w9IJiVTQH8AijReQA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2154039465</pqid></control><display><type>article</type><title>Classification of Strongly Conflict-Avoiding Codes</title><source>IEEE Xplore (Online service)</source><creator>Baicheva, Tsonka Stefanova ; Topalova, Svetlana Todorova</creator><creatorcontrib>Baicheva, Tsonka Stefanova ; Topalova, Svetlana Todorova</creatorcontrib><description>Strongly conflict-avoiding codes (SCACs) for slot-asynchronous multiple-access collision channels without feedback are considered. Codes with maximum size (optimal codes) for given parameters are of interest. In this letter, we present classification results about optimal SCACs of weights 3, 4, and 5 and given small lengths. We also determine some previously unknown values of the size of optimal SCACs with these parameters.</description><identifier>ISSN: 1089-7798</identifier><identifier>EISSN: 1558-2558</identifier><identifier>DOI: 10.1109/LCOMM.2018.2874029</identifier><identifier>CODEN: ICLEF6</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Asynchronous communication ; Classification ; classification algorithm ; Classification algorithms ; Codes ; Collision avoidance ; DH-HEMTs ; Parameters ; Protocols ; strongly conflict-avoiding codes ; Synchronization</subject><ispartof>IEEE communications letters, 2018-12, Vol.22 (12), p.2415-2418</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2018</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c246t-72c859f6832ad95f3b97a331af070c1a369d0ba430971540b07191fe84b2c67a3</cites><orcidid>0000-0002-6493-6188 ; 0000-0003-3821-4672</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/8488490$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,27924,27925,54796</link.rule.ids></links><search><creatorcontrib>Baicheva, Tsonka Stefanova</creatorcontrib><creatorcontrib>Topalova, Svetlana Todorova</creatorcontrib><title>Classification of Strongly Conflict-Avoiding Codes</title><title>IEEE communications letters</title><addtitle>COML</addtitle><description>Strongly conflict-avoiding codes (SCACs) for slot-asynchronous multiple-access collision channels without feedback are considered. Codes with maximum size (optimal codes) for given parameters are of interest. In this letter, we present classification results about optimal SCACs of weights 3, 4, and 5 and given small lengths. We also determine some previously unknown values of the size of optimal SCACs with these parameters.</description><subject>Asynchronous communication</subject><subject>Classification</subject><subject>classification algorithm</subject><subject>Classification algorithms</subject><subject>Codes</subject><subject>Collision avoidance</subject><subject>DH-HEMTs</subject><subject>Parameters</subject><subject>Protocols</subject><subject>strongly conflict-avoiding codes</subject><subject>Synchronization</subject><issn>1089-7798</issn><issn>1558-2558</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2018</creationdate><recordtype>article</recordtype><recordid>eNo9kE1LAzEQhoMoWKt_QC8Fz1snX5vkWBa_oKUH9Ryy2aSkrJuabIX-e1MrXmaG4X1m4EHoFsMcY1APy2a9Ws0JYDknUjAg6gxNMOeyIqWclxmkqoRQ8hJd5bwFAEk4niDS9Cbn4IM1Y4jDLPrZ25jisOkPsyYOvg92rBbfMXRh2JRN5_I1uvCmz-7mr0_Rx9Pje_NSLdfPr81iWVnC6rESxEqufC0pMZ3inrZKGEqx8SDAYkNr1UFrGAUlMGfQgsAKeydZS2xdolN0f7q7S_Fr7_Kot3GfhvJSkyNAFat5SZFTyqaYc3Je71L4NOmgMeijG_3rRh_d6D83Bbo7QcE59w9IJiVTQH8AijReQA</recordid><startdate>20181201</startdate><enddate>20181201</enddate><creator>Baicheva, Tsonka Stefanova</creator><creator>Topalova, Svetlana Todorova</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SP</scope><scope>8FD</scope><scope>L7M</scope><orcidid>https://orcid.org/0000-0002-6493-6188</orcidid><orcidid>https://orcid.org/0000-0003-3821-4672</orcidid></search><sort><creationdate>20181201</creationdate><title>Classification of Strongly Conflict-Avoiding Codes</title><author>Baicheva, Tsonka Stefanova ; Topalova, Svetlana Todorova</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c246t-72c859f6832ad95f3b97a331af070c1a369d0ba430971540b07191fe84b2c67a3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2018</creationdate><topic>Asynchronous communication</topic><topic>Classification</topic><topic>classification algorithm</topic><topic>Classification algorithms</topic><topic>Codes</topic><topic>Collision avoidance</topic><topic>DH-HEMTs</topic><topic>Parameters</topic><topic>Protocols</topic><topic>strongly conflict-avoiding codes</topic><topic>Synchronization</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Baicheva, Tsonka Stefanova</creatorcontrib><creatorcontrib>Topalova, Svetlana Todorova</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998–Present</collection><collection>IEEE Xplore</collection><collection>CrossRef</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>Advanced Technologies Database with Aerospace</collection><jtitle>IEEE communications letters</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Baicheva, Tsonka Stefanova</au><au>Topalova, Svetlana Todorova</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Classification of Strongly Conflict-Avoiding Codes</atitle><jtitle>IEEE communications letters</jtitle><stitle>COML</stitle><date>2018-12-01</date><risdate>2018</risdate><volume>22</volume><issue>12</issue><spage>2415</spage><epage>2418</epage><pages>2415-2418</pages><issn>1089-7798</issn><eissn>1558-2558</eissn><coden>ICLEF6</coden><abstract>Strongly conflict-avoiding codes (SCACs) for slot-asynchronous multiple-access collision channels without feedback are considered. Codes with maximum size (optimal codes) for given parameters are of interest. In this letter, we present classification results about optimal SCACs of weights 3, 4, and 5 and given small lengths. We also determine some previously unknown values of the size of optimal SCACs with these parameters.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/LCOMM.2018.2874029</doi><tpages>4</tpages><orcidid>https://orcid.org/0000-0002-6493-6188</orcidid><orcidid>https://orcid.org/0000-0003-3821-4672</orcidid></addata></record> |
fulltext | fulltext |
identifier | ISSN: 1089-7798 |
ispartof | IEEE communications letters, 2018-12, Vol.22 (12), p.2415-2418 |
issn | 1089-7798 1558-2558 |
language | eng |
recordid | cdi_ieee_primary_8488490 |
source | IEEE Xplore (Online service) |
subjects | Asynchronous communication Classification classification algorithm Classification algorithms Codes Collision avoidance DH-HEMTs Parameters Protocols strongly conflict-avoiding codes Synchronization |
title | Classification of Strongly Conflict-Avoiding Codes |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-28T20%3A19%3A45IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_ieee_&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Classification%20of%20Strongly%20Conflict-Avoiding%20Codes&rft.jtitle=IEEE%20communications%20letters&rft.au=Baicheva,%20Tsonka%20Stefanova&rft.date=2018-12-01&rft.volume=22&rft.issue=12&rft.spage=2415&rft.epage=2418&rft.pages=2415-2418&rft.issn=1089-7798&rft.eissn=1558-2558&rft.coden=ICLEF6&rft_id=info:doi/10.1109/LCOMM.2018.2874029&rft_dat=%3Cproquest_ieee_%3E2154039465%3C/proquest_ieee_%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c246t-72c859f6832ad95f3b97a331af070c1a369d0ba430971540b07191fe84b2c67a3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2154039465&rft_id=info:pmid/&rft_ieee_id=8488490&rfr_iscdi=true |