Home // CTRQ 2014, The Seventh International Conference on Communication Theory, Reliability, and Quality of Service // View article

An Algorithm for Combinatorial Entropy Coding

Authors:
Stephan Bärwolf

Keywords: entropy; coding; data compression

Abstract:
Entropy coding (esp. order-0) was one of the first techniques for lossless data compression, dating back to the invention of modern information theory. Over such a long period of time different schemes were invented and entropy coding has experienced various improvements: Huffman published its minimal tree structured codes and then Witten, Neal and Cleary presented a scheme leading to even better results. While entropy compression is still used today in most of recent compression schemes, it has not lost its significance. This paper presents an encoding and its corresponding decoding algorithm not using trees or intervals to do entropy compression. Instead it derives permutations from the input which are mapped to natural numbers. Furthermore this paper gives an impression about the compression performance by comparing some first results with well known entropy compression schemes.

Pages: 19 to 22

Copyright: Copyright (c) IARIA, 2014

Publication date: February 23, 2014

Published in: conference

ISSN: 2308-4022

ISBN: 978-1-61208-322-3

Location: Nice, France

Dates: from February 23, 2014 to February 27, 2014