A NEW RECURSIVE ALGORITHM FOR UNIVERSAL CODING OF INTEGERS

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

NANGIR MEHDI; BEHROOZI HAMID; AREF MOHAMMAD REZA

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: Journal of Information Systems and Telecommunication Year:2015 | Volume:3 | Issue:1 (9) Page(s): 1-6

Download Full-Text

View:

453

Download:

194

Cites:

Information Journal Paper

Title

A NEW RECURSIVE ALGORITHM FOR UNIVERSAL CODING OF INTEGERS

Author(s)

NANGIR MEHDI | BEHROOZI HAMID | AREF MOHAMMAD REZA | Issue Writer Certificate

Keywords

UNIVERSAL SOURCE CODING (DATA COMPRESSION)

FIBONACCI CODING

ELIAS CODING SCHEMES

INTEGER REPRESENTATION

OMEGA CODING

REDUNDANCY

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.

Cites

No record.

References

Cite

APA: Copy

NANGIR, MEHDI, BEHROOZI, HAMID, & AREF, MOHAMMAD REZA. (2015). A NEW RECURSIVE ALGORITHM FOR UNIVERSAL CODING OF INTEGERS. JOURNAL OF INFORMATION SYSTEMS AND TELECOMMUNICATION (JIST), 3(1 (9)), 1-6. SID. https://sid.ir/paper/332663/en

Vancouver: Copy

NANGIR MEHDI, BEHROOZI HAMID, AREF MOHAMMAD REZA. A NEW RECURSIVE ALGORITHM FOR UNIVERSAL CODING OF INTEGERS. JOURNAL OF INFORMATION SYSTEMS AND TELECOMMUNICATION (JIST)[Internet]. 2015;3(1 (9)):1-6. Available from: https://sid.ir/paper/332663/en

IEEE: Copy

MEHDI NANGIR, HAMID BEHROOZI, and MOHAMMAD REZA AREF, “A NEW RECURSIVE ALGORITHM FOR UNIVERSAL CODING OF INTEGERS,” JOURNAL OF INFORMATION SYSTEMS AND TELECOMMUNICATION (JIST), vol. 3, no. 1 (9), pp. 1–6, 2015, [Online]. Available: https://sid.ir/paper/332663/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops