http://www.bibsonomy.org/burst/user/a_olympia/codingBibSonomy BuRST Feed for /user/a_olympia/coding2008-07-21T00:49:32+02:00citeulikehttp://www.bibsonomy.org/bibtex/24dcf8bbf710789101f8706cfeaa709ee/a_olympiaa_olympia2007-08-18T13:22:24+02:00sparse image coding <span style="color:#555555;">Arthur E. C. <a href="http://www.bibsonomy.org/author/Pece">Pece</a> </span><em>J. Math. Imaging Vis.</em><em>17(2):89--108</em><em>September2002. </em>Sat Aug 18 13:22:24 CEST 2007J. Math. Imaging Vis.September289--108The Problem of Sparse Image Coding172002sparse image coding citeulikehttp://www.bibsonomy.org/bibtex/2ba5fdf5552593082965a21a36d87d44b/a_olympiaa_olympia2007-08-18T13:22:24+02:00distributions probability coding <span style="color:#555555;">Michael B. <a href="http://www.bibsonomy.org/author/Baer">Baer</a> </span><em>Nov2006. </em>Sat Aug 18 13:22:24 CEST 2007NovEfficient Coding of Integers for Certain Probability Distributions2006distributions probability coding Methods for prefix coding integers generally either consider specific distributions that decline more quickly than a power law (for Golomb-like codes) or simultaneously consider all finite-entropy distributions (for universal codes). Particular power-law and similar distributions, however, are often known to model particular random variables. Codes for such distributions can be judged based on (estimated) compression ratio. This paper introduces a family of universal source codes with an eye towards near-optimal coding of known distributions. Compression ratios are found for well-known probability distributions using these codes and other prefix codes. One application of these near optimal codes is an improved representation of rational numbers.citeulikehttp://www.bibsonomy.org/bibtex/24427555134df539b4c5dc6be158247bc/a_olympiaa_olympia2007-08-18T13:22:24+02:00coding p-adic arithmetic <span style="color:#555555;">Anatoly <a href="http://www.bibsonomy.org/author/Rodionov">Rodionov</a> and Sergey <a href="http://www.bibsonomy.org/author/Volkov">Volkov</a> </span><em>Apr2007. </em>Sat Aug 18 13:22:24 CEST 2007AprP-adic arithmetic coding2007coding p-adic arithmetic 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.