|This is the talk page for discussing improvements to the Binary code article.
This is not a forum for general discussion of the article's subject.
|WikiProject Computing||(Rated Start-class)|
- 1 Random comments
- 2 10010101 - is this right?
- 3 Merge with binary (numerals)
- 4 Stub
- 5 the part for the binary section is wrong...
- 6 Merge to binary
- 7 Requested move
- 8 BIASED History of Binary code
- 9 binary
- 10 Removing Morse Code
- 11 Binary codes, binary numbers, and which articles should discuss which
- 12 Weighted and non weighted binary codes
The binary code is a code that the computer uses. The code consists of 2 numbers the numbers 1 and 0. 1=on or true 0=off or false. —Preceding unsigned comment added by 184.108.40.206 (talk • contribs) and it is really boring haven't you got something better to do with your life.
Erm, ascii uses 8 bits, the first number being in case of negative, so it wont have an error when an user inputs a wrong number. Look it up. —Preceding unsigned comment added by Mjonller (talk • contribs)
- Actually, ASCII is a 7-bit code. There are various 8-bit extensions of it, but they are more often treated as unsigned than as signed codes; it doesn't really matter though, since it's a code, not a number. Dicklyon 00:37, 23 February 2007 (UTC)
10010101 - is this right?
Ok, so I want to expand this page about binary codes to examples to what a byte consists of -
-8 bits;8 zeros or ones -values descend from the 1st bit to the last bit from 128, 64, 32, 16, 8, 4, 2, 1.
minimum value is 0, and max is 256
- used for IP addresses, default gateways, and subnet masks
do you think this is the right page to put this in? B'cause i searched and there are different pages like binary code, and binary coding...
i'm not sure where to put it
Merge with binary (numerals)
Shouldn't this article be merged with the binary numeral system article, because this article doesn't contain much detail and the other one does?--LF2 16:20, 4 November 2006 (UTC)
- Perhaps, perhaps not. One can use a binary code - a code where an item being encoded is encoded as a sequence of one of two symbols - without the code being interpreted as a base-2 number. Francis Bacon didn't seem to ascribe any numerical significance to the sequences of 'a's and 'b's he was using as a binary code for letters of the alphabet. Guy Harris (talk) 23:59, 4 July 2015 (UTC)
I added a science stub category to this page. If anyone can thinks of a more appropriate stub, or thinks it shouldn't be there go ahead and change it. davekeeling 15:50, 1 February 2007 (UTC)
the part for the binary section is wrong...
For in the section in which it says about binary code it is wrong. I know binary code and am very good at it. It says to make a "r" in binary code it is 01010010. That is wrong. You would have to change the beginning from 010 to 011. That is because for capital letters ONLY you put 010 at the beginning but for lowercase letters it is 011. Then after that you would simply put the binary number for each letter. The binary number for each letter is the number it is in the alphabet put into binary but it has to have one of those beginnings to it or it os just a number and not a letter. Thank You. ☺~_~Hikton100~_~☻ —Preceding unsigned comment added by Hikton100 (talk • contribs)
Merge to binary
BIASED History of Binary code
There is no mention of Pingala in this section. His work is an important ancient contribution to the concept. Here's a summary of the information missing from this article:
- Divide the number by 2. If divisible register 1, otherwise register 0.
- If first division yields 1 as remainder, add 1 and divide again by 2. If fully divisible, register 1, otherwise write 0 to the right of first 1.
- If first division yields 0 as remainder that is, it is fully divisible, add 1 to the remaining number and divide by 2. If divisible, register 1, otherwise register 0 to the right of first 0.
- This procedure is continued until 0 as final remainder is obtained.
- Pingala is mentioned in the third paragraph. There's just no reason for him to appear at the very beginning of the article when other binary systems clearly predate Pingala's work. For example, one of the binary-like systems described in the article dates back to the 9th century BC. Why should it appear after Pingala? It makes most sense to structure the history section chronologically.--Rurik the Varangian (talk) 17:20, 25 April 2015 (UTC)
Removing Morse Code
Before my change, the Morse Code section in "Other forms of binary code" section contained the following text:
"Morse Code is a method of transmitting text information as a series of on-off tones, lights, or clicks. Any boo lean system such as this, which encodes meaning, is a form of binary code."
This is not accurate, as technically Morse Code (as described on Wikipedia page), apart from the obvious dot and dash, also uses a pause of length equal to 3 dots to encode end of letter, and a pause of length equal to 7 dots to encode end of word. Dot, dash and these two forms of pauses give 4 different characters used, therefore it is not a binary code.
For example it would not be possible to distinguish between AE (.-<pause>.) and R (.-.) if Morse Code would in fact be only binary and would not contain pauses that do carry information.
Given the above, I'm removing the Morse Code example from the "Other forms of binary code" section.
gynvael.coldwind//vx 22:24, 3 July 2015 (UTC)
- I've spotted that List of binary codes also contains Morse Code as an example, though in that specific case it's explained that Morse Code can be encoded using just two characters if a specific encoding schema is used. While this is true, this doesn't mean that Morse Code is a binary code - it means that Morse Code can be encoded in binary code, but that doesn't make it a binary code (e.g. UNICODE characters can also be encoded in binary code, which also doesn't make UNICODE a binary code).
- gynvael.coldwind//vx 22:31, 3 July 2015 (UTC)
Binary codes, binary numbers, and which articles should discuss which
Binary number#History discusses a number of binary coding systems that predate Leibniz's Explication de l'Arithmétique Binaire. Those don't seem to involve treating the binary encodings as base-2 numbers, however, so perhaps those schemes should be moved to Binary code#History of binary code, with Binary number#History mentioning those binary code schemes in passing and linking to Binary code#History of binary code. (It sounds as if the scheme used by the residents of the island of Mangareva in French Polynesia may have been a number system, in which case it should remain in Binary number#History.) Guy Harris (talk) 00:08, 5 July 2015 (UTC)
Weighted and non weighted binary codes
BCD and the 2421 code are examples of weighted codes. In a weighted code, each bit position is assigned a weighting factor in such a way that each digit can be evaluated by adding the weights of all the 1’s in the coded combination.
Four Different Binary Codes for the Decimal Digits
Decimal BCD 2421 Excess‐3 8, 4, -2, -1 Digit 8421 _____________________________________________________________
0 0000 0000 0011 0000 1 0001 0001 0100 0111 2 0010 0010 0101 0110 3 0011 0011 0110 0101 4 0100 0100 0111 0100 5 0101 1011 1000 1011 6 0110 1100 1001 1010 7 0111 1101 1010 1001 8 1000 1110 1011 1000 9 1001 1111 1100 1111
1010 0101 0000 0001 Unused 1011 0110 0001 0010 bit 1100 0111 0010 0011 combi- 1101 1000 1101 1100 nations 1110 1001 1110 1101 1111 1010 1111 1110
The 2421, the excess‐3 and the 84-2-1 codes are examples of self‐complementing codes. Such codes have the property that the 9’s complement of a decimal number is obtained directly by changing 1’s to 0’s and 0’s to 1’s (i.e., by complementing each bit in the pattern). For example, decimal 395 is represented in the excess‐3 code as 0110 1100 1000. The 9’s complement of 604 is represented as 1001 0011 0111, which is obtained simply by complementing each bit of the code (as with the 1’s complement of binary numbers). — Preceding unsigned comment added by Amitbanda (talk • contribs) 16:09, 9 August 2016 (UTC)