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, 2018, Volume 54, Issue 4, Pages 51–59 (Mi ppi2280)  
This article is cited in 4 scientific papers (total in 4 papers)

Coding Theory

On the complexity of Fibonacci coding

I. S. Sergeev

Federal State Unitary Enterprise “Kvant Scientific Research Institute”, Moscow, Russia
Full-text PDF (198 kB) Citations (4)
References:
PDF
HTML
Abstract: We show that converting an $n$-digit number from a binary to Fibonacci representation and backward can be realized by Boolean circuits of complexity $O(M(n)\log n)$, where $M(n)$ is the complexity of integer multiplication. For a more general case of $r$-Fibonacci representations, the obtained complexity estimates are of the form $2^{O(\sqrt{\log n})}n$.
Funding agency Grant number
Russian Foundation for Basic Research 17-01-00485_а
Supported in part by the Russian Foundation for Basic Research, project no. 17-01-00485.
Received: 30.05.2018
Revised: 30.05.2018
Accepted: 18.09.2018
English version:
Problems of Information Transmission, 2018, Volume 54, Issue 4, Pages 343–350
DOI: https://doi.org/10.1134/S0032946018040038
Bibliographic databases:
Document Type: Article
UDC: 621.391.15:519.72
Language: Russian
Citation: I. S. Sergeev, “On the complexity of Fibonacci coding”, Probl. Peredachi Inf., 54:4 (2018), 51–59; Problems Inform. Transmission, 54:4 (2018), 343–350
Citation in format AMSBIB
\Bibitem{Ser18}
\by I.~S.~Sergeev
\paper On the complexity of Fibonacci coding
\jour Probl. Peredachi Inf.
\yr 2018
\vol 54
\issue 4
\pages 51--59
\mathnet{http://mi.mathnet.ru/ppi2280}
\elib{https://elibrary.ru/item.asp?id=38647210}
\transl
\jour Problems Inform. Transmission
\yr 2018
\vol 54
\issue 4
\pages 343--350
\crossref{https://doi.org/10.1134/S0032946018040038}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000456991400003}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85060766110}
Linking options:
  • https://www.mathnet.ru/eng/ppi2280
  • https://www.mathnet.ru/eng/ppi/v54/i4/p51
    • This publication is cited in the following 4 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:226
    Full-text PDF :64
    References:47
    First page:7
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024