P-adic算术编码
P-adic arithmetic coding
摘要：
提出了一种新的增量式数据压缩算法。对于一个输入符号序列，算法递增地构造一个p-adic整数作为输出。解码过程从p-adic整数的较低有效部分开始，并递增地重建输入符号序列。算法基于p-adic数和p-adic范数的某些特征。p-adic编码算法可以被认为是一种流行的压缩技术-算术编码算法的推广。它表明，对于p = 2的算法作为算术编码的整数变量;对于一类特殊的模型，它给出了完全相同的代码作为霍夫曼算法，对于另一种特殊的模型和特定的字母表，它给出Golomb-Rice码。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
