RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor
Subscription

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Diskretn. Anal. Issled. Oper., 2009, Volume 16, Number 5, Pages 69–77 (Mi da588)  

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

Lower bound for the computation complexity of BCH-codes for branching programs

E. A. Okolnishnikova

S. L. Sobolev Institute of Mathematics, SB RAS, Novosibirsk, Russia

Abstract: A lower bound $\Omega(n\log n)$ for the computation complexity of characteristic functions of Bose–Chaudhuri–Hoquinghem codes (BCH-codes) for some values of parameters of these codes by nondeterministic branching programs is obtained. Bibl. 9.

Keywords: complexity, lower bound, branching program, codes.

Full text: PDF file (242 kB)
References: PDF file   HTML file

English version:
Journal of Applied and Industrial Mathematics, 2010, 4:2, 231–235

Bibliographic databases:

UDC: 519.714.4+519.725
Received: 10.08.2009

Citation: E. A. Okolnishnikova, “Lower bound for the computation complexity of BCH-codes for branching programs”, Diskretn. Anal. Issled. Oper., 16:5 (2009), 69–77; J. Appl. Industr. Math., 4:2 (2010), 231–235

Citation in format AMSBIB
\Bibitem{Oko09}
\by E.~A.~Okolnishnikova
\paper Lower bound for the computation complexity of BCH-codes for branching programs
\jour Diskretn. Anal. Issled. Oper.
\yr 2009
\vol 16
\issue 5
\pages 69--77
\mathnet{http://mi.mathnet.ru/da588}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=2590756}
\zmath{https://zbmath.org/?q=an:1249.68081}
\transl
\jour J. Appl. Industr. Math.
\yr 2010
\vol 4
\issue 2
\pages 231--235
\crossref{https://doi.org/10.1134/S1990478910020122}
\scopus{http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-77953485610}


Linking options:
  • http://mi.mathnet.ru/eng/da588
  • http://mi.mathnet.ru/eng/da/v16/i5/p69

    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. E. A. Okolnishnikova, “O raspredelënnykh skhemakh”, Diskretn. analiz i issled. oper., 18:6 (2011), 71–81  mathnet  mathscinet  zmath
    2. Cankaya E.C., Nair S., Cankaya H.C., “Applying Error Correction Codes to Achieve Security and Dependability”, Comput. Stand. Interfaces, 35:1 (2013), 78–86  crossref  isi  scopus
  • Дискретный анализ и исследование операций
    Number of views:
    This page:993
    Full text:59
    References:38
    First page:2

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