Binary code
From Wikipedia, the free encyclopedia
In a fixed-width binary code, each letter, digit, or other character, is represented by a bit string of the same length; that bit string, interpreted as a binary number, is usually displayed in code tables in octal, decimal or hexadecimal notation.
There are many character sets and many character encodings for them.
A bit string, interpreted as a binary number, can be translated into a decimal number.
[edit] Early uses of Binary codes
Anton Glaser, in History of Binary and other Nondecimal Numeration. Tomash. 1971. ISBN 0-938228-005., Chapter VII Applications to Computers, cites the following Pre-ENIAC milestones.
- 1932: C.E. Wynn-Williams "Scale of Two" counter
- 1938: Atanasoff-Berry Computer
- 1939: Stibitz: "excess three" code in the Complex Computer
[edit] Weight of binary codes
The weight of a binary code, as defined in [1], is the Hamming weight of the binary words coding for the represented words or sequences.
[edit] See also
 |
This computer science article is a stub. You can help Wikipedia by expanding it. |
