Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

article · 2002

Dense coding-a fast alternative to arithmetic coding

Urs Graf

Cited by 3Abstract and details only

Abstract

With dense coding a new method for minimum redundancy coding is introduced. An analysis of arithmetic coding shows, that it is essentially identical to an encoding of discrete intervals. Interval coding is introduced, which encodes symbols directly by encoding the corresponding discrete intervals. Dense coding is an enhanced variant of interval coding, where redundancies are mostly removed with a new technique called conditional coding. Conditional coding is at most 0.086071... bits per encoding step (0.057304... bits in average) longer than optimal encoding. Dense coding uses conditional coding twice and is therefore 0.114608... bits per encoding step worse than the theoretical limit (unlimited precision arithmetic coding). Dense coding is a lot faster than arithmetic coding or Huffman coding and achieves nearly the same compact code as arithmetic coding.

Cite this paper

APA 7

Graf, U. (2002). Dense coding-a fast alternative to arithmetic coding. https://doi.org/10.1109/sequen.1997.666924

MLA 9

Graf, Urs. “Dense coding-a fast alternative to arithmetic coding.” 2002, pp. 295–304, https://doi.org/10.1109/sequen.1997.666924.

Chicago

Graf, Urs. 2002. “Dense coding-a fast alternative to arithmetic coding.” https://doi.org/10.1109/sequen.1997.666924.

Harvard

Graf, U. (2002) ‘Dense coding-a fast alternative to arithmetic coding’. Available at: https://doi.org/10.1109/sequen.1997.666924.

BibTeX
@article{graf2002dense,
  title = {{Dense coding-a fast alternative to arithmetic coding}},
  author = {Graf, Urs},
  pages = {295--304},
  year = {2002},
  doi = {10.1109/sequen.1997.666924}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.

Related papers