A New Recursive Algorithm for Universal Coding of Integers

In this paper, we aim to encode the set of all positive integers so that the codewords not only be uniquely decodable but also be an instantaneous set of binary sequences. elias introduces three recursive algorithms for universal coding of positive integers where each codeword contains binary representation of the integer plus an attachment portion that gives some information about the first part [1]. on the other hand, fibonacci coding which is based on fibonacci numbers is also introduced by apostolico and fraenkel for coding of integers [2]. in this paper, we propose a new lossless recursive algorithm for universal coding of positive integers based on both recursive algorithms and fibonacci coding scheme without using any knowledge about the source statistics [3].the coding schemes which don’t use the source statistics is called universal coding, in these universal coding schemes we should use a universal decoding scheme in the receiver side of communication system. all of these encoding and decoding schemes assign binary streams to positive integers and conversely, without any need of use to probability masses over positive integers. we show that if we use fibonacci coding in the first part of each codeword we can achieve shorter expected codeword length than elias omega code. in addition, our proposed algorithm has low complexity of encoding and decoding procedures.