Book chapter · 2018
Shannon entropy and the basics of information theory
Chapman & Hall/CRC eBooks, 101–110 · Published 3 October 2018 · DOI 10.1201/9781482296372-8
In brief
“Shannon entropy and the basics of information theory” is a 2018 book chapter by Juergen Bierbrauer, published in Chapman & Hall/CRC eBooks. OpenAlex counts 0 citations as of 15 November 2026. The publisher's version is not open access, and OpenAlex records no free legal copy.
- Citations
- 0
- Authors
- 1
Abstract
The entropy is a function, which measures the amount of information contained in a sample space. We claim that the entropy function is a measure for the average amount of information per letter generated by this source. The whole idea behind the definition of entropy is in the last property of Theorem. It says that… Read the full abstract at the publisher.
Excerpt. This paper is not open access.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Bierbrauer, J. (2018). Shannon entropy and the basics of information theory. Chapman & Hall/CRC eBooks, 101–110. https://doi.org/10.1201/9781482296372-8
MLA 9
Bierbrauer, Juergen. “Shannon entropy and the basics of information theory.” Chapman & Hall/CRC eBooks, 2018, pp. 101–110. https://doi.org/10.1201/9781482296372-8.
Chicago
Bierbrauer, Juergen. 2018. “Shannon entropy and the basics of information theory.” Chapman & Hall/CRC eBooks: 101–110. https://doi.org/10.1201/9781482296372-8.
Harvard
Bierbrauer, J. (2018) ‘Shannon entropy and the basics of information theory’, Chapman & Hall/CRC eBooks, pp. 101–110. doi:10.1201/9781482296372-8.
IEEE
J. Bierbrauer, “Shannon entropy and the basics of information theory,” Chapman & Hall/CRC eBooks, pp. 101–110, 2018, doi: 10.1201/9781482296372-8.
BibTeX
@incollection{bierbrauer2018shannon,
title = {{Shannon entropy and the basics of information theory}},
author = {Bierbrauer, Juergen},
booktitle = {Chapman \& Hall/CRC eBooks},
publisher = {Informa},
year = {2018},
pages = {101--110},
doi = {10.1201/9781482296372-8},
url = {https://doi.org/10.1201/9781482296372-8}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Topic and keywords
Physical Sciences › Computer Science › Artificial Intelligence › Diverse Interdisciplinary Research Studies
- Shannon entropy
- information theory
- probability distributions
- information sources
- relative frequency
Work with this paper
Most-cited papers in Computer Science
- ImageNet classification with deep convolutional neural networksAlex Krizhevsky, Ilya Sutskever, Geoffrey E. Hinton · Communications of the ACM · 2017 · 114,726 citations
- Long Short-Term MemorySepp Hochreiter, Jürgen Schmidhuber · Neural Computation · 1997 · 109,097 citations
- A Mathematical Theory of CommunicationClaude E. Shannon · Bell System Technical Journal · 1948 · 91,736 citations
- Deep learningYann LeCun, Yoshua Bengio, Geoffrey E. Hinton · Nature · 2015 · 90,226 citations
- Faster R-CNN: Towards Real-Time Object Detection with Region Proposal NetworksShaoqing Ren, Kaiming He, Ross Girshick and 1 more · IEEE Transactions on Pattern Analysis and Machine Intelligence · 2016 · 74,143 citations
Questions about this paper
How do I cite this paper in APA style?
Bierbrauer, J. (2018). Shannon entropy and the basics of information theory. Chapman & Hall/CRC eBooks, 101–110. https://doi.org/10.1201/9781482296372-8
How many times has this paper been cited?
0 times, according to OpenAlex on 15 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
OpenAlex records no free legal copy. Check your library's access, the authors' pages or a repository, or ask the corresponding author for a copy.
Who wrote this paper?
Juergen Bierbrauer.
What is the DOI of this paper?
10.1201/9781482296372-8. The permanent link is https://doi.org/10.1201/9781482296372-8.
Bibliographic data from OpenAlex (CC0), last checked 15 November 2026. ResearchGuru does not host this paper; the links go to the publisher or the repository that does.