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, 1987, Volume 23, Issue 4, Pages 110–113 (Mi ppi835)  
This article is cited in 1 scientific paper (total in 1 paper)

Сorrespondence

Greismer Codes with Maximum Covering Radius

S. M. Dodunekov
Full-text PDF (344 kB) Citations (1)
Abstract: Let $C$ be a $(k, d)$ Greismer code with covering radius $\rho(C)$. We prove that if $d>2^k$ or d belongs to Belov intervals of dimension $k+1$, then $\rho(C)\leq d-2$. All Greismer codes $C$ with $\rho(C)\leq d-1$ are described.
Received: 12.08.1985
Bibliographic databases:
Document Type: Article
UDC: 621.391.15
Language: Russian
Citation: S. M. Dodunekov, “Greismer Codes with Maximum Covering Radius”, Probl. Peredachi Inf., 23:4 (1987), 110–113; Problems Inform. Transmission, 23:4 (1987), 344–346
Citation in format AMSBIB
\Bibitem{Dod87}
\by S.~M.~Dodunekov
\paper Greismer Codes with Maximum Covering Radius
\jour Probl. Peredachi Inf.
\yr 1987
\vol 23
\issue 4
\pages 110--113
\mathnet{http://mi.mathnet.ru/ppi835}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=931721}
\zmath{https://zbmath.org/?q=an:0656.94013|0638.94015}
\transl
\jour Problems Inform. Transmission
\yr 1987
\vol 23
\issue 4
\pages 344--346
Linking options:
  • https://www.mathnet.ru/eng/ppi835
  • https://www.mathnet.ru/eng/ppi/v23/i4/p110
    • 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:207
    Full-text PDF :72
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024