Diskretnyi Analiz i Issledovanie Operatsii
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


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




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

Diskretnyi Analiz i Issledovanie Operatsii, 2009, Volume 16, Issue 5, Pages 69–77 (Mi da588)  
This article is cited in 3 scientific papers (total in 3 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
Full-text PDF (242 kB) Citations (3)
References:
PDF
HTML
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.
Received: 10.08.2009
English version:
Journal of Applied and Industrial Mathematics, 2010, Volume 4, Issue 2, Pages 231–235
DOI: https://doi.org/10.1134/S1990478910020122
Bibliographic databases:
UDC: 519.714.4+519.725
Language: Russian
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://mathscinet.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{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-77953485610}
Linking options:
  • https://www.mathnet.ru/eng/da588
  • https://www.mathnet.ru/eng/da/v16/i5/p69
    • This publication is cited in the following 3 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретный анализ и исследование операций
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024