Lably
Skip to content

Bit

Unit of information

  • 7 min read
  • 3 chapters

Related on Lably

Through Computing, Communication and Value (computer science)

The bit represents a logical state with one of two possible values. These values are most commonly represented as 1 and 0, but other representations such as true/false, yes/no, on/off, and +/− are also widely used. The relation between these values and the physical states of the underlying storage or device is a matter of convention, and different assignments may be used even within the same device or program. It may be physically implemented with a two-state device.

A contiguous group of binary digits is commonly called a bit string, a bit vector, or a single-dimensional (or multi-dimensional) bit array. A group of eight bits is called one byte, but historically, the size of the byte is not strictly defined. Frequently, half, full, double and quadruple words consist of a number of bytes which is a low power of two. A string of four bits is usually a nibble.

In information theory, one bit is the information entropy of a random binary variable that is 0 or 1 with equal probability, or the information that is gained when the value of such a variable becomes known. As a unit of information, the bit is also known as a shannon, named after Claude E. Shannon. As a measure of the length of a digital string that is encoded as symbols over a binary alphabet (i.e. Σ={0,1}), the bit has been called a binit, but this usage is now rare.

In data compression, the goal is to find a shorter representation for a string, so that it requires fewer bits when stored or transmitted; the string would be compressed into the shorter representation before doing so, and then decompressed into its original form when read from storage or received. The field of algorithmic information theory is devoted to the study of the irreducible information content of a string (i.e., its shortest-possible representation length, in bits), under the assumption that the receiver has minimal a priori knowledge of the method used to compress the string. In error detection and correction, the goal is to add redundant data to a string to enable the detection or correction of errors during storage or transmission; the redundant data would be computed before doing so, and stored or transmitted, and then checked or corrected when the data is read or received.

History

Ralph Hartley suggested the use of a logarithmic measure of information in 1928. Claude E. Shannon first used the word "bit" in his seminal 1948 paper "A Mathematical Theory of Communication". He attributed its origin to John W. Tukey, who had written a Bell Labs memo on 9 January 1947 in which he contracted "binary digit" to simply "bit".

Sign in to keep reading

2 more chapters are free with a Lably account.

More in Measurement

Source and licence. Adapted from the Wikipedia article “Bit” (this version, 2026-09-29) by its contributors, shared under CC BY-SA 4.0. Lablypedia has left out its tables, references and most pictures, and linked it to other Lablypedia articles.