For each of the following sets of codewords, please give the appropriate (n,k,d) designation where n is number of bits in each codeword, k is the number of message bits transmitted by each code word and d is the minimum Hamming distance between codewords. Also give the code rate. {111, 100, 001, 010}

For each of the following sets of codewords, please give the appropriate (n,k,d) designation where n is number of bits in each codeword, k is the number of message bits transmitted by each code word and d is the minimum Hamming distance between codewords. Also give the code rate. {111, 100, 001, 010}

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter9: Computer Networks

Section: Chapter Questions

Problem 15VE

See similar textbooks

Similar questions

Compute CBC-MAC for a message of 16 bits, “ABCD” (in Hexa). Assume a block size of 8 bits with an IV=C9 (in hexa). For simplicity, assume the encryption to be a simple XOR of the key with the plaintext. Let the encryption key be D8 (in Hexa). (Hint: Divide the message into blocks of 8 bits each; XOR each block with the previous cipher output; then encrypt this with the key. For the first block, XOR it with IV.
Given are the following codewords for an error control coding scheme data 000 011 100 codeword 00011000 00000111 10101000 . a.What is the minimum Hamming distance? b. What is the coding rate for this scheme? c. what raw data rate would be required if we need a throughput of 6 Mpbs? d. in a different situation, the number of data bits to transfer is 5, and the minimum hamming distance is dmin=5. find the maximum coding rate for this situation
Please help with the following question: What is the maximum number of errors in a message that can be detected by a parity bit?
Assume we have a code composed of 5 ternary codewords of varying lengths (1, 1, 2, 2, 3). How many unique messages comprised of two message symbols result in a series of four code symbols after encoding?
a. Compute CBC-MAC for a message of 16 bits, “8642” (in Hexa). Assume a block size of 8 bits with an IV=F1 (in hexa). For simplicity, assume the encryption to be a simple XOR of the key with the plaintext. Let the encryption key be B4 (in Hexa). (Hint: Divide the message into blocks of 8 bits each; XOR each block with the previous cipher output; then encrypt this with the key. For the first block, XOR it with IV. Details in pages 325-326 Ch.12 of the textbook) b. Suppose Alice computes the Secret prefix MAC (page 322: secret prefix MAC(x) = h(key || x)) for the message ”AM” (in ASCII) with key “G” (in ASCII) that both Alice and Bob know. The hash function that is used is h(x1x2x3)= g(g(x1 XOR x2) XOR x3 ) where each xi is a character represented as 8 bits, and g(x) is a 8-bit string that is equal to the complement of bits in x. For example, g(10110011) = 01001100. The MAC is 8 bits. (8-bit ASCII representation of the characters is given below.) What is the Secret prefix MAC…
6. You have received the following 7+4 bit Hamming encoded messages (the Hamming bits are underlined): (a) 11110001011 (b) 11111010110 Assume the messages have been corrupted by at most single bit errors per symbol. Construct tables with the data and redundancy bits and correct the messages if necessary
Suppose the message that should be transmitted from host A to host B contains the following four bytes: 01110111, 11011010, 10011101, and 00110011. Find the checksum of this message computed by host A, assuming the checksum is computed as sum of bytes rather than sum of 16 bits. Show your work.
The very last block of a message encrypted with AES-256 in CBC mode is 15 bytes long and ends with the bytes: 0102030405060708090a0b0c0d0e0f When padded in accordance with PKCS #7 with 16-byte blocks, what is the complete value of the last block? *Please explain how you have solved this, thank you!!
What are the CRC bits (R) associated with the payload containing first four bit 1101 and last four bit is the last digit of your reg number (i.e. 5, payload = 1101 0101). Suppose that the 4-bit generator (G) is 0101, and r = 3
Suppose a binary message word is to encoded using a repetition code where every bit is to be repeated thrice. Which of the ff received word is free of any error 1. 101 101 101 101 2. 111 001 000 111 3. 111 101 111 000 4. 111 000 111 000
Consider the 3rd ,6th , and7th digits of your student ID composed of seven digits. Convert it to binary format (each digit is represented by a maximum of 3 bits). For example, 1060385 is simplified to 685 and then converted to 0110 1000 0101. Assume now that we want to send your simplified student ID while being able to detect and correct single bit errors. 1.1) Using two-dimensional parity check show what will be transmitted using datawords of size 4 bits.
Suppose the sender and the receiver agree to use the bit pattern 01111110 to mark the beginning and the end of a frame. 1)The sender has the following bits to send. What does the sender actually send? 011110000111111011101111101 2) The receiver receives the following bits. What're the original data bits (note: this question has nothing to do with the previous question) 01111110111110111110001101111101000011111001111110