Log In

Recent questions tagged binary-codes

0 votes
1 answer
Let $C$ be a binary linear code with minimum distance $2t+1$ then it can correct upto _______ bits of error $t+1$ $t$ $t-2 $ $\frac{t}{2}$
asked Mar 24 in DS jothee 58 views
0 votes
0 answers
A t-error correcting q-nary linear code satisfy : $M\sum_{i=0}^{t}(\frac{n}{i})(q-1)^{i}\leq X$ Where M is the number of code words and X is $q^{n}$ $q ^{t}$ $q^{-n}$ $q^{-t}$
asked Mar 24 in Others jothee 38 views
0 votes
1 answer
So I'm asked to convert 300 (decimal) into binary and hexadecimal for a single byte (8-bit) unsigned number. I get: 300 = 100101100 = 12C But isn't 100101100 a 9 digit number, and so a 9-bit number? Am I missing something here?
asked Sep 14, 2017 in Digital Logic Garrett McClure 419 views
2 votes
1 answer
In Excess 3 addition, the groups that have produced a carry we have to add 0011 to them and subtract 0011 from the groups which have not produced a carry during the addition. Can someone explain the logic of performing this step for me?
asked Sep 10, 2017 in Digital Logic Parimal Paritosh 400 views
22 votes
2 answers
Consider the binary code that consists of only four valid codewords as given below: 00000, 01011, 10101, 11110 Let the minimum Hamming distance of the code $p$ and the maximum number of erroneous bits that can be corrected by the code be $q$. Then the values of $p$ and $q$ are $p=3$ and $q=1$ $p=3$ and $q=2$ $p=4$ and $q=1$ $p=4$ and $q=2$
asked Feb 14, 2017 in Digital Logic Arjun 5.6k views
12 votes
4 answers
For any natural number $n$, an ordering of all binary strings of length $n$ is a Gray code if it starts with $0^n$, and any successive strings in the ordering differ in exactly one bit (the first and last string must also differ by one bit). Thus, for $n=3$ ... Gray code, if two strings are separated by $k$ other strings in the ordering, then they must differ in exactly $k$ bits none of the above
asked Dec 23, 2016 in Digital Logic jothee 1.1k views
10 votes
3 answers
The logic circuit given below converts a binary code $\text{y1, y2, y3}$ into Excess-$3$ code Gray code $\text{BCD}$ code Hamming code
asked Jul 6, 2016 in Digital Logic Arjun 4.8k views
6 votes
5 answers
The Excess-$3$ code is also called Cyclic Redundancy Code Weighted Code Self-Complementing Code Algebraic Code
asked Jul 6, 2016 in Digital Logic jothee 5.2k views
7 votes
1 answer
The code which uses 7 bits to represent a character is : ASCII BCD EBCDIC Gray
asked May 24, 2016 in Computer Networks Desert_Warrior 3.8k views
2 votes
1 answer
Convert $1101_2$ to corresponding $excess-3$ binary number. (A) $10000$ (B) $01000110$ (C) $100110$ (D) $10110$
asked Nov 29, 2015 in Digital Logic shreshtha5 1.2k views
1 vote
2 answers
A number system uses 20 as the radix. The excess code that is necessary for its equivalent binary coded representation is ?
asked Oct 2, 2015 in Digital Logic Payal Rastogi 1.9k views
4 votes
2 answers
Which of the following is termed as minimum error code ? Binary code Gray code Excess-$3$ code Octal code
asked Sep 20, 2015 in Digital Logic ajit 3.6k views
62 votes
5 answers
Consider numbers represented in 4-bit Gray code. Let $ h_{3}h_{2}h_{1}h_{0}$ be the Gray code representation of a number $n$ and let $ g_{3}g_{2}g_{1}g_{0}$ be the Gray code of $ (n+1)(modulo 16)$ ... $ g_{3}(h_{3}h_{2}h_{1}h_{0})=\sum (0,1,6,7,10,11,12,13) $
asked Sep 26, 2014 in Digital Logic Rucha Shelke 7.8k views
To see more, click for the full list of questions or popular tags.