Paper Info
Title
New Families and New Members of Integer Sequence Based Coding Methods
Abstract
This paper presents Integer sequences that have the property of being additively and/or multiplicatively complete, Zekendorf, and unique Zekendorf. In addition, a generalized Elias coding scheme is developed. Features of Zekendorf sequence based and generalized Elias coding compression methods including compression rate, universality, asymptotic optimality, and coding complexity are analyzed.
Year
DOI
Venue
2009
10.1109/DCC.2009.87
DCC
Keywords
Field
DocType
coding complexity,compression method,unique zekendorf,new families,compression rate,generalized elias,integer sequence,new members,asymptotic optimality,zekendorf sequence,additives,computer science,sequences,data compression,lossless compression,encoding,probability density function,cryptography
Tunstall coding,Discrete mathematics,Combinatorics,Data compression ratio,Computer science,Theoretical computer science,Shannon–Fano coding,Data compression,Fibonacci coding,Lossless compression,Integer sequence,Variable-length code
Conference
Citations 
PageRank 
References 
0
0.34
1
Authors
2
Name
Order
Citations
PageRank
Daniel Lowell1272.29
Dan E. Tamir27913.26