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

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Prikl. Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find




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

Prikladnaya Diskretnaya Matematika, 2009, supplement № 1, Pages 66–68 (Mi pdm106)  
Mathematical Foundations of Reliability of Computing and Control Systems

Representation of an arbitrary number with weight sum of essential subtrees

N. B. Butorina, S. A. Lykhina
Full-text PDF (349 kB)
References:
PDF
HTML
Abstract: An algorithm for representation of arbitrary number of code words with sum of essential subtrees weights in the tree presenting all code words of $(m,n)$-code is suggested. Some properties of essential subtrees are determined.
Document Type: Article
UDC: 681.324.7
Language: Russian
Citation: N. B. Butorina, S. A. Lykhina, “Representation of an arbitrary number with weight sum of essential subtrees”, Prikl. Diskr. Mat., 2009, supplement № 1, 66–68
Citation in format AMSBIB
\Bibitem{ButLyk09}
\by N.~B.~Butorina, S.~A.~Lykhina
\paper Representation of an arbitrary number with weight sum of essential subtrees
\jour Prikl. Diskr. Mat.
\yr 2009
\pages 66--68
\issueinfo supplement № 1
\mathnet{http://mi.mathnet.ru/pdm106}
Linking options:
  • https://www.mathnet.ru/eng/pdm106
  • https://www.mathnet.ru/eng/pdm/y2009/i10/p66
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Прикладная дискретная математика
    Statistics & downloads:
    Abstract page:114
    Full-text PDF :38
    References:39
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024