Problemy Peredachi Informatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Probl. Peredachi Inf.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Problemy Peredachi Informatsii, 2017, Volume 53, Issue 1, Pages 47–55 (Mi ppi2226)  
This article is cited in 7 scientific papers (total in 7 papers)

Coding Theory

Optimal conflict-avoiding codes for $3$, $4$ and $5$ active users

T. Baicheva, S. Topalova

Institute of Mathematics and Informatics, Bulgarian Academy of Sciences, Sofia, Bulgaria
Full-text PDF (184 kB) Citations (7)
References:
PDF
HTML
Abstract: Conflict-avoiding codes are used in multiple-access collision channels without feedback. The number of codewords in a conflict-avoiding code is the number of potential users of the channel. That is why codes with maximum cardinality (optimal codes) for given parameters are of interest. In this paper we classify, up to multiplier equivalence, all optimal conflict-avoiding codes of weights $3$, $4$, and $5$ and given small lengths. We also determine some previously unknown values of the maximum cardinality of conflict-avoiding codes of weights $4$ and $5$.
Funding agency Grant number
Bulgarian National Science Fund I01/0003
ДН02/2-13.12.2016
Supported in part by the Bulgarian National Science Fund under Contract no. I01/0003.
Supported in part by the Bulgarian National Science Fund under Contract no. DN02/2-13.12.2016.
Received: 09.02.2016
Revised: 26.09.2016
English version:
Problems of Information Transmission, 2017, Volume 53, Issue 1, Pages 42–50
DOI: https://doi.org/10.1134/S0032946017010033
Bibliographic databases:
Document Type: Article
UDC: 621.391.15
Language: Russian
Citation: T. Baicheva, S. Topalova, “Optimal conflict-avoiding codes for $3$, $4$ and $5$ active users”, Probl. Peredachi Inf., 53:1 (2017), 47–55; Problems Inform. Transmission, 53:1 (2017), 42–50
Citation in format AMSBIB
\Bibitem{BaiTop17}
\by T.~Baicheva, S.~Topalova
\paper Optimal conflict-avoiding codes for $3$, $4$ and $5$ active users
\jour Probl. Peredachi Inf.
\yr 2017
\vol 53
\issue 1
\pages 47--55
\mathnet{http://mi.mathnet.ru/ppi2226}
\elib{https://elibrary.ru/item.asp?id=28876246}
\transl
\jour Problems Inform. Transmission
\yr 2017
\vol 53
\issue 1
\pages 42--50
\crossref{https://doi.org/10.1134/S0032946017010033}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000399821500003}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85018192947}
Linking options:
  • https://www.mathnet.ru/eng/ppi2226
  • https://www.mathnet.ru/eng/ppi/v53/i1/p47
    • This publication is cited in the following 7 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Проблемы передачи информации Problems of Information Transmission
    Statistics & downloads:
    Abstract page:206
    Full-text PDF :24
    References:31
    First page:11
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024