P-adic arithmetic coding
| dc.creator | Rodionov, Anatoly | |
| dc.creator | Volkov, Sergey | |
| dc.date | 2007-04-06 | |
| dc.date.accessioned | 2026-07-07T07:55:32Z | |
| dc.date.available | 2026-07-07T07:55:32Z | |
| dc.description | 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. | |
| dc.description | 29 pages | |
| dc.identifier | https://arxiv.org/abs/0704.0834 | |
| dc.identifier | http://arxiv.org/abs/0704.0834 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/127003 | |
| dc.subject | Data Structures and Algorithms | |
| dc.subject | H.1.1 | |
| dc.title | P-adic arithmetic coding | |
| dc.type | text |