P-adic arithmetic coding

Details P-adic arithmetic coding P-adic arithmetic coding

2007-04-06

arxiv.org/abs/0704.0834v1

Computer Science

Data Structures and Algorithms

29 pages

Scientific paper

A new incremental algorithm for data compression is presented. For a sequence of input symbols algorithm incrementally constructs a p-adic integer number as an output. Decoding process starts with less significant part of a p-adic integer and incrementally reconstructs a sequence of input symbols. Algorithm is based on certain features of p-adic numbers and p-adic norm. p-adic coding algorithm may be considered as of generalization a popular compression technique - arithmetic coding algorithms. It is shown that for p = 2 the algorithm works as integer variant of arithmetic coding; for a special class of models it gives exactly the same codes as Huffman's algorithm, for another special model and a specific alphabet it gives Golomb-Rice codes.

Affiliated with

Also associated with

No associations

Rating

P-adic arithmetic coding does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with P-adic arithmetic coding, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and P-adic arithmetic coding will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-699567