All
 
|
 
 


On the Complexity of Fibonacci Coding
 
PIIS055529230003078-9-1
DOI10.31857/S055529230003078-9
Publication type Article
Status Published
Authors
Igor Sergeev 
Affiliation: FSUE “Research Institute“ Kvant ”
Address: Russian Federation
Journal nameProblemy peredachi informatsii
EditionVolume 54 Issue 4
Pages51-59
Abstract

  

Keywords
AcknowledgmentThis work was carried out with the partial financial support of the Russian Foundation for Basic Research (project number 17-01-00485a).
Received13.12.2018
Publication date13.12.2018
Cite   Download pdf To download PDF you should sign in
Размещенный ниже текст является ознакомительной версией и может не соответствовать печатной

views: 842

Readers community rating: votes 0 

1. Lekkerkerker C.G. Representation of Natural Numbers as a Sum of Fibonacci Numbers // Simon Stevin. 1952. V. 29. P. 190–195.
2. Kautz W. Fibonacci Codes for Synchronization Control // IEEE Trans. Inform. Theory. 1965. V. 11. № 2. P. 284–292.
3. Daykin D.E. Representation of Natural Numbers as Sums of Generalized Fibonacci Numbers // J. London Math. Soc. 1960. V. 35. № 2. P. 143–160.
4. Bergman G. A Number System with an Irrational Base // Math. Magazine. 1957. V. 31. № 2. P. 98–110.
5. Apostolico A., Fraenkel A.S. Robust Transmission of Unbounded Strings Using Fibonacci Representations // IEEE Trans. Inform. Theory. 1987. V. 33. № 2. P. 238–245.
6. Klein S.T., Ben-Nissan M.K. On the Usefulness of Fibonacci Compression Codes // Comput. J. 2010. V. 53. № 6. P. 701–716.
7. Immink K.A.S. Codes for Mass Data Storage Systems. Eindhoven, The Netherlands: Shannon Foundation Publ., 2004.
8. Ahlbach C., Usatine J., Frougny C., Pippenger N. Efficient Algorithms for Zeckendorf Arithmetic // Fibonacci Quart. 2013. V. 51. № 3. P. 249–255.
9. Wegener I. The Complexity of Boolean Functions. Chicester: Wiley; Stuttgart: Teubner, 1987.
10. Berstel J. Fibonacci Words—A Survey // The Book of L. Berlin; New York: Springer-Verlag, 1986. P. 13–27.
11. Frougny C., Pelantov?a E., Svobodov?a M. Parallel Addition in Non-standard Numeration Systems // Theor. Comput. Sci. 2011. V. 412. № 41. P. 5714–5727.
12. F?urer M. Faster Integer Multiplication // SIAM J. Comput. 2009. V. 39. № 3. P. 979–1005.
13. Gashkov S.B. Zanimatel'naya komp'yuternaya arifmetika. Bystrye algoritmy operatsij s chislami i mnogochlenami. M.: Librokom, 2012.
14. Reif J., Tate S. Optimal Size Integer Division Circuits // SIAM J. Comput. 1990. V. 19. № 5. P. 912–924.
15. Miles E.P., Jr. Generalized Fibonacci Numbers and Associated Matrices // Amer. Math. Monthly. 1960. V. 67. № 8. P. 745–752.
16. Spickerman W.R., Joyner R.N. Binet’s Formula for the Recursive Sequence of Order k // Fibonacci Quart. 1984. V. 22. № 4. P. 327–331.
17. Dresden G.P.B., Du Z. A Simplified Binet Formula for k-Generalized Fibonacci Numbers // J. Integer Seq. 2014. V. 17. № 4. Article 14.4.7 (9 pp.)
18. Howard F.T. Generalizations of a Fibonacci Identity // Appl. of Fibonacci Numbers. V. 8 (Proc. 8th Int. Research Conf. on Fibonacci Numbers and Their Applications. Rochester, NY, USA. June 22–26, 1998). Dordrecht: Kluwer, 1999. P. 201–211.
19. Toom A.L. Oslo zhnosti skhemy iz funktsional'nykh ehlementov, realizuyuschej umnozhenie tselykh chisel // DAN SSSR. 1963. T. 150. № 3. S. 496–498.

Система Orphus

Loading...
Up