Directory
References

run-length encoding

computer science
Also known as: run-length code

Learn about this topic in these articles:

data compression

  • In data compression

    Run-length encoding (RLE) is good for repetitive data, replacing it by a count and one copy of a repeated item. Adaptive dictionary methods build a table of strings and then replace occurrences of them by shorter codes. The Lempel-Ziv algorithm, invented by Israeli computer scientists…

    Read More

telecommunications systems

  • Block diagram of a digital telecommunications system.
    In telecommunication: Run-length codes

    Certain signal sources are known to produce “runs,” or long sequences of only 1s or 0s. In these cases it is more efficient to transmit a code for the length of the run rather than all the bits that represent the run itself.…

    Read More
Related Topics:
encoding

binary code, code used in digital computers, based on a binary number system in which there are only two possible states, off and on, usually symbolized by 0 and 1. Whereas in a decimal system, which employs 10 digits, each digit position represents a power of 10 (100, 1,000, etc.), in a binary system each digit position represents a power of 2 (4, 8, 16, etc.). A binary code signal is a series of electrical pulses that represent numbers, characters, and operations to be performed. A device called a clock sends out regular pulses, and components such as transistors switch on (1) or off (0) to pass or block the pulses. In binary code, each decimal number (0–9) is represented by a set of four binary digits, or bits. The four fundamental arithmetic operations (addition, subtraction, multiplication, and division) can all be reduced to combinations of fundamental Boolean algebraic operations on binary numbers. (See the table below for how the decimal numbers from 0 to 10 are represented in binary.)

Decimal numerals represented by binary digits
decimal binary conversion
0 0 0 ( 20 )
1 1 1 ( 20 )
2 10 1 ( 21 ) + 0 ( 20 )
3 11 1 ( 21 ) + 1 ( 20 )
4 100 1 ( 22 ) + 0 ( 21 ) + 0 ( 20 )
5 101 1 ( 22 ) + 0 ( 21 ) + 1 ( 20 )
6 110 1 ( 22 ) + 1 ( 21 ) + 0 ( 20 )
7 111 1 ( 22 ) + 1 ( 21 ) + 1 ( 20 )
8 1000 1 ( 23 ) + 0 ( 22 ) + 0 ( 21 ) + 0 ( 20 )
9 1001 1 ( 23 ) + 0 ( 22 ) + 0 ( 21 ) + 1 ( 20 )
10 1010 1 ( 23 ) + 0 ( 22 ) + 1 ( 21 ) + 0 ( 20 )
The Editors of Encyclopaedia Britannica This article was most recently revised and updated by Adam Augustyn.