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, 2011, Volume 47, Issue 3, Pages 10–18 (Mi ppi2051)  

This article is cited in 4 scientific papers (total in 4 papers)

Coding Theory

Classification of optimal $(v,4,1)$ binary cyclically permutable constant-weight codes and cyclic $2$-$(v,4,1)$ designs with $v\le76$

T. Baicheva, S. Topalova

Institute of Mathematics and Informatics, Bulgarian Academy of Sciences, Bulgaria
Full-text PDF (202 kB) Citations (4)
References:
Abstract: We classify up to isomorphism optimal $(v,4,1)$ binary cyclically permutable constant-weight (CPCW) codes with $v\le76$ and cyclic $2$-$(73,4,1)$ and $2$-$(76,4,1)$ designs. There is a one-to-one correspondence between optimal $(v,4,1)$ CPCW codes, optimal cyclic binary constant-weight codes with weight $4$ and minimum distance $6$, $(v,4;\lfloor(v-1)/12\rfloor)$ difference packings, and optimal $(v,4,1)$ optical orthogonal codes. Therefore, the classification of CPCW codes holds for them too. Perfect $(v,4,1)$ CPCWcodes are equivalent to $(v,4,1)$ cyclic difference families, and thus $(73,4,1)$ cyclic difference families are classified too.
Received: 18.01.2011
Revised: 11.05.2011
English version:
Problems of Information Transmission, 2011, Volume 47, Issue 3, Pages 224–231
DOI: https://doi.org/10.1134/S0032946011030021
Bibliographic databases:
Document Type: Article
UDC: 621.391.15
Language: Russian
Citation: T. Baicheva, S. Topalova, “Classification of optimal $(v,4,1)$ binary cyclically permutable constant-weight codes and cyclic $2$-$(v,4,1)$ designs with $v\le76$”, Probl. Peredachi Inf., 47:3 (2011), 10–18; Problems Inform. Transmission, 47:3 (2011), 224–231
Citation in format AMSBIB
\Bibitem{BaiTop11}
\by T.~Baicheva, S.~Topalova
\paper Classification of optimal $(v,4,1)$ binary cyclically permutable constant-weight codes and cyclic $2$-$(v,4,1)$ designs with $v\le76$
\jour Probl. Peredachi Inf.
\yr 2011
\vol 47
\issue 3
\pages 10--18
\mathnet{http://mi.mathnet.ru/ppi2051}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2896173}
\transl
\jour Problems Inform. Transmission
\yr 2011
\vol 47
\issue 3
\pages 224--231
\crossref{https://doi.org/10.1134/S0032946011030021}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000299374700002}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84855969060}
Linking options:
  • https://www.mathnet.ru/eng/ppi2051
  • https://www.mathnet.ru/eng/ppi/v47/i3/p10
  • This publication is cited in the following 4 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:325
    Full-text PDF :61
    References:58
    First page:4
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024