Q. The field that defines the length of the entire Link Control Protocol packet is called

View solution

Q. How many bits in the data unit has changed in single bit error?

View solution

Q. To guarantee the detection of up to s errors in all cases, the minimum hamming distance in a block code must be

View solution

Q. The cyclic codes are fast when these are implemented in

View solution

Q. In block coding, we divide our message into blocks, is called

View solution

Q. Find the parity bit for 1001011

View solution

Q. All burst errors of a cyclic code will be detected when

View solution

Q. The process of modulo-2 binary division is the same as the familiar

View solution

Q. Traditionally, the Internet checksum is

View solution

Q. If the value of checksum is 0, then the message is

View solution

Q. In the isolated double errors of the cyclic code, the generator cannot divide the term x^t+1 where t is in between

View solution

Q. Shifting to the left is accomplished by

View solution

Q. In a linear block code, the exclusive OR (XOR) of any two valid code words creates

View solution

Q. If generator of the cyclic code has at least two terms and the rightmost bit is 1 then error cannot be divided by

View solution

Q. In the bit pattern, the shifting to the right means

View solution

Q. A generator of a cyclic code that contains a factor of x + 1 can detect all

View solution

Q. To guarantee correction of up to t errors in all cases, the minimum hamming distance in a block code must be

View solution

Q. There is no error in the received code word, if the syndrome is

View solution

Q. A simple parity-check code has dmin =

View solution

Q. The standard polynomial that is used by the popular protocol of CRC-16 for the

View solution