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, 1986, Volume 22, Issue 4, Pages 29–34 (Mi ppi955)  
This article is cited in 2 scientific papers (total in 2 papers)

Information Theory and Coding Theory

On the Dual Distance of BCH Codes

V. A. Zinov'ev, S. N. Litsyn
Full-text PDF (704 kB) Citations (2)
Abstract: An upper bound is derived on the dual distance of BCH binary codes. This enables us to improve the lower bound on rational trigonometric sums in fields of characteristic 2.
Received: 30.10.1984
Revised: 12.03.1985
Bibliographic databases:
Document Type: Article
UDC: 621.391.1
Language: Russian
Citation: V. A. Zinov'ev, S. N. Litsyn, “On the Dual Distance of BCH Codes”, Probl. Peredachi Inf., 22:4 (1986), 29–34; Problems Inform. Transmission, 22:4 (1986), 272–277
Citation in format AMSBIB
\Bibitem{ZinLit86}
\by V.~A.~Zinov'ev, S.~N.~Litsyn
\paper On the Dual Distance of~BCH Codes
\jour Probl. Peredachi Inf.
\yr 1986
\vol 22
\issue 4
\pages 29--34
\mathnet{http://mi.mathnet.ru/ppi955}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=885649}
\zmath{https://zbmath.org/?q=an:0621.94011}
\transl
\jour Problems Inform. Transmission
\yr 1986
\vol 22
\issue 4
\pages 272--277
Linking options:
  • https://www.mathnet.ru/eng/ppi955
  • https://www.mathnet.ru/eng/ppi/v22/i4/p29
    • This publication is cited in the following 2 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:268
    Full-text PDF :117
    First page:2
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024