This book mainly discusses the compression of the sorted integers. The technique applied is Elias-Fano coding. The taken input is integers in the sorted order. Here ascending order is taken. The numbers are converted into binary form. Then input splitted into two parts. Those are the highest and lowest bit. The lowest bit is the last two bits. The remaining are the highest bits. The occurrence of each highest with the count is given. Based on this Elias-Fano coding implemented.
EZHILARASU Umadevi Palani
Dr P. Ezhilarasu holds a B.E. (CSE) from Bharathiar University, Coimbatore; a M.E. (CSE) & Ph.D. (CSE) from Anna University, Chennai. He has 2 decades of Academic experience and has guided many UG, PG students and Research scholars. He has more than 70 publications to his credit and is serving as a reviewer. He is also an active member in IE, ISTE.
MAHAPATRA Rajendra Prasad
Number of Pages:
LAP LAMBERT Academic Publishing
Compression, Sorted Integers, Elias-Fano, Saved Space, Highest bit
MATHEMATICS / Functional Analysis