in computer language 1 or 0 is odd or even parity.
In basic terms.
- if it's 1 it's odd.
- if it's 0 it's even
As your number increases it cycles through even and odd.
for example
0, 1, 10, 11, 100, 101, 110, 111...etc
would be
even, odd, even, odd, even, odd, even, odd... etc
Well, that's odd and even parity in binary.
2006-08-24 21:47:34
·
answer #1
·
answered by John Z 4
·
1⤊
0⤋
John Z's description is inaccurate- - you count the number of 1 bits in the number, and see if that's even or odd. So for the first few binary numbers:
000 - 0 ones, that's even parity
001 - 1 one, thats odd parity
010 - 1 one, that's odd parity
011 - 2 ones, that's even
100 - 1 ones, that's odd
101 - 2 ones, that's even
110 - 2 ones, that's even
111 - 3 ones, that's odd
and so on... The basic point of parity is that you stick on an *additional* bit, and set it as needed - so if you're using odd parity, but the data has 4 ones in it, you add a 1 bit to make the total number odd. Then when you receive the data at the other end, you check the number of ones - if you received 4 or 6 (which are even), then you know something got mangled on the way. The great weakness is that if *two* bits get mangled, it's possible for the parity to be still correct, but data be bad... To trap odes.these, you need more complicated things called Error Correcting Codes.
2006-08-24 22:10:22
·
answer #2
·
answered by Valdis K 6
·
0⤊
0⤋
a parity indicates if it has even or odd number of Ones in a given digital notation , take a look at this !!
http://en.wikipedia.org/wiki/Odd_parity
2006-08-24 21:43:57
·
answer #3
·
answered by akshay_m_2000 2
·
1⤊
0⤋