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, 1997, Volume 33, Issue 4, Pages 3–14 (Mi ppi383)  

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

Information Theory and Coding Theory

On Binary Cyclic Codes with Minimum Distance $d=3$

P. Charpin, A. Tietäväinen, V. A. Zinov'ev
Abstract: We consider binary cyclic codes of length $2^m-1$ generated by a product of two or several minimal polynomials. Sufficient conditions for the minimum distance of such a code to be equal to three are found.
Received: 18.06.1996
Bibliographic databases:
Document Type: Article
UDC: 621.391.15
Language: Russian
Citation: P. Charpin, A. Tietäväinen, V. A. Zinov'ev, “On Binary Cyclic Codes with Minimum Distance $d=3$”, Probl. Peredachi Inf., 33:4 (1997), 3–14; Problems Inform. Transmission, 33:4 (1997), 287–296
Citation in format AMSBIB
\Bibitem{ChaTieZin97}
\by P.~Charpin, A.~Tiet\"av\"ainen, V.~A.~Zinov'ev
\paper On Binary Cyclic Codes with Minimum Distance~$d=3$
\jour Probl. Peredachi Inf.
\yr 1997
\vol 33
\issue 4
\pages 3--14
\mathnet{http://mi.mathnet.ru/ppi383}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1615557}
\zmath{https://zbmath.org/?q=an:1003.94033}
\transl
\jour Problems Inform. Transmission
\yr 1997
\vol 33
\issue 4
\pages 287--296
Linking options:
  • https://www.mathnet.ru/eng/ppi383
  • https://www.mathnet.ru/eng/ppi/v33/i4/p3
  • This publication is cited in the following 22 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Проблемы передачи информации Problems of Information Transmission
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024