A New Recursive Algorithm for Universal Coding of Integers

Journal Title: Journal of Information Systems and Telecommunication - Year 2015, Vol 3, Issue 1

Abstract

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.

Authors and Affiliations

Mehdi Nangir, Hamid Behroozi, Mohammad Reza Aref

Keywords

Related Articles

Latent Feature Based Recommender System for Learning Materials Using Genetic Algorithm

With the explosion of learning materials available on personal learning environments (PLEs) in the recent years, it is difficult for learners to discover the most appropriate materials according to keyword searching meth...

Selecting Enterprise Resource Planning System Using Fuzzy Analytic Hierarchy Process Approach

To select an enterprise resource planning (ERP) system is time consuming due to the resource constraints, the software complexity, and the different of alternatives. A comprehensively systematic selection policy for ERP...

Design of Fall Detection System: A Dynamic Pattern Approach with Fuzzy Logic and Motion Estimation

Every year thousands of the elderly suffer serious damages such as articular fractures, broken bones and even death due to their fall. Automatic detection of the abnormal walking in people, especially such accidents as t...

SRR shape dual band CPW-fed monopole antenna for WiMAX / WLAN applications

CPW structure is became common structure for UWB and multi band antenna design and SRR structure is well-known kind of metamaterial that has been used in antenna and filter design for multi band application. In this pape...

An Ultra-Wideband Common Gate LNA With Gm-Boosted And Noise Canceling Techniques

In this paper, an ultra-wideband (UWB) common gate low-noise amplifier (LNA) with gm-boosted and noise-cancelling techniques is presented. In this scheme we utilize gm-boosted stage for cancelling the noise of matching d...

Download PDF file
  • EP ID EP184733
  • DOI 10.7508/jist.2015.01.001
  • Views 106
  • Downloads 0

How To Cite

Mehdi Nangir, Hamid Behroozi, Mohammad Reza Aref (2015). A New Recursive Algorithm for Universal Coding of Integers. Journal of Information Systems and Telecommunication, 3(1), 1-6. https://europub.co.uk/articles/-A-184733