Content deleted Content added
updated description |
Stevebroshar (talk | contribs) it's broader and looser than a just machine code and bytecode |
||
(42 intermediate revisions by 27 users not shown) | |||
Line 1:
{{Short description
{{For|the binary form of computer software|Machine code}}
[[Image:Wikipedia in binary.gif|thumb |The
[[Image:Binary to Hexadecimal or Decimal.jpg|thumb |Values represented in binary, hex and decimal]]
A '''binary code''' is the value of a [[data encoding |data-encoding]] convention represented in a [[Binary number |binary]] notation that usually is a sequence of 0s and 1s; sometimes called a ''[[bit]] string''. For example, [[ASCII]] is an 8-bit text encoding that in addition to the [[human readable]] form (letters) can be represented as binary. ''Binary code'' can also refer to the [[mass noun]] ''code'' that is not human readable in nature such as [[machine code]] and [[bytecode]].
Even though all modern computer data is binary in nature, and therefore, can be represented as binary, other [[numerical base]]s are usually used. [[Power of 2]] bases (including [[hexadecimal |hex]] and [[octal]]) are sometimes considered binary code since their power-of-2 nature makes them inherently linked to binary. [[Decimal]] is, of course, a commonly used representation. For example, ASCII characters are often represented as either decimal or hex. Some types of data such as [[image]] data is sometimes represented as hex, but rarely as decimal.
▲==History of binary codes==
{{further|Binary number#History}}
{{Disputed section|date=April 2015}}
{{POV section|date=April 2015}}▼
[[File:Gottfried Wilhelm Leibniz, Bernhard Christoph Francke.jpg|thumb|upright|[[Gottfried Leibniz]]]]
=== Invention ===
The modern binary number system, the basis for binary code, is an invention by [[Gottfried Leibniz]] in 1689 and appears in his article ''Explication de l'Arithmétique Binaire (''English: ''Explanation of the Binary Arithmetic'') which uses only the characters 1 and 0, and some remarks on its usefulness. Leibniz's system uses 0 and 1, like the modern binary numeral system. Binary numerals were central to Leibniz's intellectual and theological ideas. He believed that binary numbers were symbolic of the Christian idea of ''[[creatio ex nihilo]]'' or creation out of nothing.<ref name="on">{{cite book |author1=Yuen-Ting Lai |url=https://books.google.com/books?id=U9dOmVt81UAC&pg=PA149 |title=Leibniz, Mysticism and Religion |publisher=Springer |year=1998 |isbn=978-0-7923-5223-5 |pages=149–150}}</ref><ref name="lnz">Leibniz G., Explication de l'Arithmétique Binaire, Die Mathematische Schriften, ed. C. Gerhardt, Berlin 1879, vol.7, p.223; Engl. transl.[http://www.leibniz-translations.com/binary.htm]</ref> In Leibniz's view, binary numbers represented a fundamental form of creation, reflecting the simplicity and unity of the divine.<ref name="lnz" /> Leibniz was also attempting to find a way to translate logical reasoning into pure mathematics. He viewed the binary system as a means of simplifying complex logical and mathematical processes, believing that it could be used to express all concepts of arithmetic and logic.<ref name="lnz" />
=== Previous Ideas ===
▲The residents of the island of [[Mangareva]] in [[French Polynesia]] were using a hybrid binary-[[decimal]] system before 1450.<ref>{{Cite journal|last1=Bender|first1=Andrea|last2=Beller|first2=Sieghard|title=Mangarevan invention of binary steps for easier calculation|journal=Proceedings of the National Academy of Sciences|volume=111|issue=4|date=16 December 2013|doi=10.1073/pnas.1309160110|pages=1322–1327|pmid=24344278|pmc=3910603|doi-access=free}}</ref> In the 11th century, scholar and philosopher [[Shao Yong]] developed a method for arranging the hexagrams which corresponds, albeit unintentionally, to the sequence 0 to 63, as represented in binary, with yin as 0, yang as 1 and the [[least significant bit]] on top. The ordering is also the [[lexicographical order]] on [[sextuple]]s of elements chosen from a two-element set.<ref>{{cite journal |doi=10.2307/1399337 |title=Leibniz' Binary System and Shao Yong's "Yijing" |first=James A. |last=Ryan |journal=Philosophy East and West |volume=46 |issue=1 |date=January 1996 |pages=59–90 |jstor=1399337}}</ref>
[[File:George Boole color.jpg|thumb|upright|[[George Boole]]]]In 1605 [[Francis Bacon]] discussed a system whereby letters of the alphabet could be reduced to sequences of binary digits, which could then be encoded as scarcely visible variations in the font in any random text.<ref name="Bacon1605" /> Importantly for the general theory of binary encoding, he added that this method could be used with any objects at all: "provided those objects be capable of a twofold difference only; as by Bells, by Trumpets, by Lights and Torches, by the report of Muskets, and any instruments of like nature".<ref name="Bacon1605">{{Cite web|last=Bacon|first=Francis|author-link=Francis Bacon|title=The Advancement of Learning|url=http://home.hiwaay.net/~paul/bacon/advancement/book6ch1.html|year=1605|volume=6|___location=London|pages=Chapter 1}}</ref>
=== Boolean Logical System ===
[[George Boole]] published a paper in 1847 called 'The Mathematical Analysis of Logic' that describes an algebraic system of logic, now known as [[Boolean algebra (logic)|Boolean algebra]]. Boole's system was based on binary, a yes-no, on-off approach that consisted of the three most basic operations: AND, OR, and NOT.<ref name="Boolean operations">{{Cite web|url=http://www.kerryr.net/pioneers/boolean.htm|title=What's So Logical About Boolean Algebra?|website=www.kerryr.net}}</ref> This system was not put into use until a graduate student from [[Massachusetts Institute of Technology]], [[Claude Shannon]], noticed that the Boolean algebra he learned was similar to an electric circuit. In 1937, Shannon wrote his master's thesis, ''[[A Symbolic Analysis of Relay and Switching Circuits]]'', which implemented his findings. Shannon's thesis became a starting point for the use of the binary code in practical applications such as computers, electric circuits, and more.<ref name="Claude Shannon">{{Cite web|url=http://www.kerryr.net/pioneers/shannon.htm|title=Claude Shannon (1916 - 2001)|website=www.kerryr.net}}</ref>
{{Main|List of binary codes}}▼
[[File:Bagua-name-earlier.svg|thumb|Daoist Bagua]]▼
▲===Braille===
[[Braille]] is a type of binary code that is widely used by the blind to read and write by touch, named for its creator, Louis Braille. This system consists of grids of six dots each, three per column, in which each dot has two states: raised or not raised. The different combinations of raised and flattened dots are capable of representing all letters, numbers, and punctuation signs.▼
The ''[[bagua]]'' are diagrams used in ''[[feng shui]],'' [[Taoist]] [[cosmology]] and ''[[I Ching]]'' studies. The ''ba gua'' consists of 8 trigrams; ''bā'' meaning 8 and ''guà'' meaning divination figure. The same word is used for the 64 guà (hexagrams). Each figure combines three lines (''yáo'') that are either broken ([[Yin and yang|''yin'']]) or unbroken (''yang''). The relationships between the trigrams are represented in two arrangements, the primordial, "Earlier Heaven" or "Fuxi" ''bagua'', and the manifested, "Later Heaven", or "King Wen" ''bagua''.<ref name='wilhelm'>{{cite book |last=Wilhelm |first=Richard |author-link=Richard Wilhelm (sinologist) |others=trans. by [[Cary F. Baynes]], foreword by [[C. G. Jung]], preface to 3rd ed. by [[Hellmut Wilhelm]] (1967) |title=The I Ching or Book of Changes |publisher=Princeton University Press |year=1950 |___location=Princeton, NJ |url=https://books.google.com/books?id=bbU9AAAAIAAJ&pg=PA266 |isbn=978-0-691-09750-3 |pages=266, 269}}</ref> (See also, the [[King Wen sequence]] of the 64 hexagrams).▼
The [[Ifá]]/Ifé system of divination in African religions, such as of [[Yoruba people|Yoruba]], [[Igbo people|Igbo]], and [[Ewe people|Ewe]], consists of an elaborate traditional ceremony producing 256 oracles made up by 16 symbols with 256 = 16 x 16. An initiated priest, or [[Babalawo]], who had memorized oracles, would request sacrifice from consulting clients and make prayers. Then, divination nuts or a pair of chains are used to produce random binary numbers,<ref>{{Cite book |last=Olupona |first=Jacob K. |url=https://www.worldcat.org/oclc/839396781 |title=African Religions: A Very Short Introduction |publisher=[[Oxford University Press]] |year=2014 |isbn=978-0-19-979058-6 |___location=Oxford |pages=45 |oclc=839396781}}</ref> which are drawn with sandy material on an "Opun" figured wooden tray representing the totality of fate.▼
[[File:2D Binary Index.svg|thumb|An example of a recursive [[binary space partitioning]] [[quadtree]] for a 2D index.]]▼
BCD arithmetic is sometimes preferred to floating-point numeric formats in commercial and financial applications where the complex rounding behaviors of floating-point numbers is inappropriate.<ref name="Cowlishaw_GDA">{{cite web |first=Mike F. |last=Cowlishaw |author-link=Mike F. Cowlishaw |title=General Decimal Arithmetic |orig-year=1981, 2008 |publisher=IBM |date=2015 |url=http://speleotrove.com/decimal/<!-- http://www2.hursley.ibm.com/decimal/ --> |access-date=2016-01-02}}</ref>▼
* 1875: [[Émile Baudot]] "Addition of binary strings in his ciphering system," which, eventually, led to the ASCII of today.
* 1884: The [[Linotype machine]] where the matrices are sorted to their corresponding channels after use by a binary-coded slide rail.
Line 66 ⟶ 34:
* 1938: [[Konrad Zuse]] [[Z1 (computer)|Z1]]
==Rendering==
▲[[File:Bagua-name-earlier.svg|thumb|Daoist Bagua]]
A binary code can be rendered using any two distinguishable indications. In addition to the bit string, other notable ways to render a binary code are described below.
▲; Braille: [[Braille]] is a
▲; Bagua {{anchor|BaGua}}: The ''[[bagua]]''
▲; Ifá{{anchor|Ifá}}: The [[Ifá]]/Ifé system of divination in African religions, such as of [[Yoruba people |Yoruba]], [[Igbo people |Igbo]], and [[Ewe people |Ewe]], consists of an elaborate traditional ceremony producing 256 oracles made up by 16 symbols with 256 = 16 x 16.
==Encoding==
▲[[File:2D Binary Index.svg|thumb|An example of a recursive [[binary space partitioning]] [[quadtree]] for a 2D index
Innumerable encoding systems exists. Some notable examples are described here.
; ASCII: The [[American Standard Code for Information Interchange]] (ASCII) character encoding, is a 7-bit convention for representing (normal/printing) characters and [[Control character |control]] operations. Each printing and control character is assigned a number from 0 to 127. For example, "a" is represented by decimal code 97 which is rendered as bit string <code>1100001</code>.
▲
==See also==
*
* {{Annotated link |Bit array}}
* {{Annotated link |Constant-weight code}}
* {{Annotated link |Gray code}}
* {{Annotated link |Unicode}}
==References==
Line 83 ⟶ 65:
==External links==
*
* {{MathWorld |urlname=Error-CorrectingCode |title=Error-Correcting Code}}
* [http://www.win.tue.nl/~aeb/codes/binary.html Table of general binary codes]. An updated version of the tables of bounds for small general binary codes given in {{citation |author1=M.R. Best |author2=A.E. Brouwer |author3=F.J. MacWilliams |author4=A.M. Odlyzko |author5=N.J.A. Sloane |title=Bounds for Binary Codes of Length Less than 25 |journal=IEEE Trans. Inf. Theory |volume=24 |year=1978 |pages=81–93 |doi=10.1109/tit.1978.1055827|citeseerx=10.1.1.391.9930 }}.
|