Q. Any coding scheme needs to have at least the parameters of

View solution

Q. Single-bit errors are the least likely type of error in

View solution

Q. In a cyclic code, generator polynomial is actually the

View solution

Q. There are two main methods of

View solution

Q. The cyclic redundancy check is used in

View solution

Q. In error detection and correction process, we use geometric approach to define

View solution

Q. The received code word of the cyclic code is the sum of the sent code word and the

View solution

Q. In a cyclic code, the decoder is failed to detect any error, when syndrome is

View solution

Q. What is the maximum effect of a 2-ms burst of noise on data transmitted for 12 kbps

View solution

Q. The divisor line and XOR are missing if the corresponding bit in the divisor is

View solution

Q. The unsigned representation of numbers by one's complement can represent

View solution

Q. The checksum is used in the Internet by several protocols although not at the

View solution

Q. A simple parity-check code can detect

View solution

Q. The hamming distance can easily be found if we apply the

View solution

Q. In subtraction of modulo-2 arithmetic, 0-1 =

View solution

Q. In modulo-N arithmetic, we use only the integers in the range

View solution

Q. To detect or correct errors, we send extra bits with data. It is called

View solution

Q. A good polynomial generator of the cyclic code have at least

View solution

Q. The dataword is organized in the form of

View solution

Q. A simple parity-check code is the most familiar

View solution