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, 2015, Volume 51, Issue 2, Pages 57–66 (Mi ppi2170)  

This article is cited in 1 scientific paper (total in 1 paper)

Coding Theory

On separability of the classes of homogeneous and transitive perfect binary codes

I. Yu. Mogilnykhab, F. I. Solov'evaab

a Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk, Russia
b Novosibirsk State University, Novosibirsk, Russia
Full-text PDF (204 kB) Citations (1)
References:
Abstract: By the example of perfect binary codes, we prove the existence of binary homogeneous nontransitive codes. Thereby, taking into account previously obtained results, we establish a hierarchical picture of extents of linearity for binary codes; namely, there is a strict inclusion of the class of binary linear codes in the class of binary propelinear codes, which are strictly included in the class of binary transitive codes, which, in turn, are strictly included in the class of binary homogeneous codes. We derive a transitivity criterion for perfect binary codes of rank greater by one than the rank of the Hamming code of the same length.
Received: 09.12.2014
Revised: 19.02.2015
English version:
Problems of Information Transmission, 2015, Volume 51, Issue 2, Pages 139–147
DOI: https://doi.org/10.1134/S0032946015020054
Bibliographic databases:
Document Type: Article
UDC: 621.391.15
Language: Russian
Citation: I. Yu. Mogilnykh, F. I. Solov'eva, “On separability of the classes of homogeneous and transitive perfect binary codes”, Probl. Peredachi Inf., 51:2 (2015), 57–66; Problems Inform. Transmission, 51:2 (2015), 139–147
Citation in format AMSBIB
\Bibitem{MogSol15}
\by I.~Yu.~Mogilnykh, F.~I.~Solov'eva
\paper On separability of the classes of homogeneous and transitive perfect binary codes
\jour Probl. Peredachi Inf.
\yr 2015
\vol 51
\issue 2
\pages 57--66
\mathnet{http://mi.mathnet.ru/ppi2170}
\elib{https://elibrary.ru/item.asp?id=24959302}
\transl
\jour Problems Inform. Transmission
\yr 2015
\vol 51
\issue 2
\pages 139--147
\crossref{https://doi.org/10.1134/S0032946015020054}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000357472800005}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84943266829}
Linking options:
  • https://www.mathnet.ru/eng/ppi2170
  • https://www.mathnet.ru/eng/ppi/v51/i2/p57
  • This publication is cited in the following 1 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:214
    Full-text PDF :51
    References:39
    First page:13
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024