In the 4B/5B encoding scheme, every 4 bits of data are encoded in a 5bit codeword. It is required that the codewords haveat most 1 leading and at most 1 trailing zero. How many such codewords are possible?
Consider a 3bit error detection and 1bit error correction hamming code for 4bit datq. The extra parity bits required would be ___ and the 3bit error detection is possible because the code has a minimum distance of ____
1 Crore+ students have signed up on EduRev. Have you? Download the App 
In a communication network, a packet of length L bits takes link L_{1}with a probability of P1 or link L_{2 }with a probability of P_{2}. Link L_{1} and L_{2} have bit error probability of b_{1} and b_{2} respectively. The probability that the packet will be received without error via either L_{1} or L_{2 }is
An error correcting code has the following code words: 00000000, 00001111, 01010101, 10101010, 11110000. What is themaximum number of bit errors that can be corrected?
Data transmitted on a link uses the following 2D parity scheme for error detection:
Each sequence of 28 bits is arranged in a 4x7 matrix (rows r_{0 }through r_{3}, and columns d_{7 }through d_{1} ) and is padded witha column d_{0 }and row r_{4 }of parity bits computed using the Even parity scheme. Each bit of column d_{0} (respectively, row r_{4} ) gives the parity of the corresponding row (respectively, column). These 40 bits are transmitted over the data link.
The table shows data received by a receiver and has corrupted bits. What is the mini mum possible value of ?
Let G(x) be the generator polynomial used for CRC checking. What is the condition that should be satisfied by G(x) to detect odd number of bits in error?
A layer4 firewall (a device that can look at all protocol headers up to the transport layer) CANNOT
Following 7 bit single error correcting hamming coded message is received.
Determine if the message is correct (assuming that at most 1 bit could be corrupted). If the message contains an error find the bit which is erroneous and gives correct message.
A message is made up entirely of characters from the set x = {P,Q,R,S,T} . The table of probabilities for each of the characters is shown below:
Total 1.00
If a message of 100 characters over X is encoded using Huffman coding, then the expected length of the encoded message
in bits is ______.
What is the distance of the following code 000000, 010101, 000111, 011001, 111111?
55 docs215 tests

55 docs215 tests
