RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PERSONAL OFFICE
General information
Latest issue
Archive
Impact factor

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


Probl. Peredachi Inf., 1974, Volume 10, Issue 3, Pages 36–44 (Mi ppi1040)  

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

Coding Theory

Construction of a Class of Linear Binary Codes Achieving the Varshamov?Griesmer Bound

B. I. Belov, V. N. Logachev, V. P. Sandimirov


Abstract: A class of optimal (in the sense of achieving the Varshamov–Griesmer bound) linear binary codes is described; it is strictly included in the class of Solomon–Stiffler codes. A subclass of the given class of codes is constructively defined for the case of relatively small code distances.

Full text: PDF file (911 kB)

English version:
Problems of Information Transmission, 1974, 10:3, 211–217

Bibliographic databases:

UDC: 621.391.15
Received: 13.02.1973
Revised: 19.02.1974

Citation: B. I. Belov, V. N. Logachev, V. P. Sandimirov, “Construction of a Class of Linear Binary Codes Achieving the Varshamov?Griesmer Bound”, Probl. Peredachi Inf., 10:3 (1974), 36–44; Problems Inform. Transmission, 10:3 (1974), 211–217

Citation in format AMSBIB
\Bibitem{BelLogSan74}
\by B.~I.~Belov, V.~N.~Logachev, V.~P.~Sandimirov
\paper Construction of a Class of Linear Binary Codes Achieving the Varshamov?Griesmer Bound
\jour Probl. Peredachi Inf.
\yr 1974
\vol 10
\issue 3
\pages 36--44
\mathnet{http://mi.mathnet.ru/ppi1040}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=469488}
\zmath{https://zbmath.org/?q=an:0317.94014}
\transl
\jour Problems Inform. Transmission
\yr 1974
\vol 10
\issue 3
\pages 211--217


Linking options:
  • http://mi.mathnet.ru/eng/ppi1040
  • http://mi.mathnet.ru/eng/ppi/v10/i3/p36

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. H. Grießer, V. R. Sidorenko, “A Posteriory Probability Decoding of Nonsystematically Encoded Block Codes”, Problems Inform. Transmission, 38:3 (2002), 182–193  mathnet  crossref  mathscinet  zmath
    2. Landjev, I, “A weighted version of a result of Hamada on minihypers and on linear codes meeting the Griesmer bound”, Designs Codes and Cryptography, 45:1 (2007), 123  crossref  isi
    3. Ahlswede R., Solov'eva F.I., “A Diametric Theorem in Z(m)(n) for Lee and Related Distances”, Coding Theory and Applications, Proceedings, Lecture Notes in Computer Science, 5228, 2008, 1–10  crossref  isi
  • Проблемы передачи информации Problems of Information Transmission
    Number of views:
    This page:284
    Full text:87

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2017