QUESTION 3 Given the generator matrix 1 1 0 20 0 21 0 1 1 1 B 1 0 1 O #43 1 0 0 (a) Find H the parity-check matrix (b) The received vector are r [1100010], [1110110], [1110011]. Calculate the syndrome. Find the error vectors and hence, identify the error bits. (c) Find the transmitted code vectors Syndrome Error 001 011 101 pattern 0010000 0000100 0000001 1 0 0 0

QUESTION 3 Given the generator matrix 1 1 0 20 0 21 0 1 1 1 B 1 0 1 O #43 1 0 0 (a) Find H the parity-check matrix (b) The received vector are r [1100010], [1110110], [1110011]. Calculate the syndrome. Find the error vectors and hence, identify the error bits. (c) Find the transmitted code vectors Syndrome Error 001 011 101 pattern 0010000 0000100 0000001 1 0 0 0

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

For a (6,3) systematic linear block code, the three check digits arec4=m1+m2+m3,c5=m1+m2,c6=m1+ m3(a) Construct an appropriate generator matrix for this code.(b) Construct the code generated by this generator matrix.(c) construct hardware realization of encoder(d) Prepare a suitable decoding table.(e) Decode the following received words: 110100,101110
Short answer: Consider two binary bit vectors x and y, each of length of n What is the maximum and minimum value of Jaccard coefficient between x and y? Maximum: Minimum:
Given the H matrix in a (n,k) block code ?=[0100110] 1001111 0011010 (a) Derive the G matrix, and find the codeword of the message m=(1100). (b) Find the detection and correction capabilities of the coding scheme.
A repetition code is an [n, 1] Code in which the n - 1 parity bits are repetitions of the information bit. Is this repetition code a linear code ? What is the minimum distance of the code ?please given step by step solution.
2.Consider the bit stream 01101101. Draw the waveforms for following line codes.(i)(ii)Biphase Manchester codingBiphase Differential Manchester codingPolar PSEUDOTERNARY(iii)(iv)Multilevel -8B6T(v)Multilevel-2B1Q Assume that the signal level for the most recent preceding 0 bit (pseudoternary) has a negative voltage.
Consider a convolutional code with k = 1, n = 3 and L = 3. The encoder generators aregiven by 91 = [110], 92 = [001] and 93 = [011].Assume the Viterbi algorithm is used for decoding at the receiver and considerthe received bit sequence at the input of the channel decoder being [10 0100110011].Answer the following questions.(a) What is the decoded information bit sequence? (b) What is the value of the cumulative metric (i.e., Hamming distance) of thefinal survivor path of the decoding process?(c) Draw the final survivor path of the trellis for the decoding process.Instruction for Part (c): An example of drawing a path in the trellis is shown below.
For the (7,4) single error correcting cyclic code D(x0 = d0 + d1x +d2x2 + d3x3 and xn + 1 = [(1+x+x3)(1+x+x2+x4). Using the generator polynomial g(x) = (1+x+x3), find all the 16 code vectors of cyclic code both in systematic and non-systematic form.
(b) The bit strings for the sets {1,2,3,4,5} and {1,3,5,7,9} are 1111100000 and 1010101010, respectively. Use bit strings to find union, intersection and complement of both sets.
A binary linear block is described by the generator matrix below: 110010 G = 011001 101100 a) Find n and k as well as the code rate of this code b) List all of the code words of the code and find the code's minimum distance c) How many errors can this code correct? d) Find the parity check matrix for this code e) Create the standard array for this code f) Find the most like transmitted codeword if the received word is r=101111 using your standard array g) Find the parity check for this code h) Find the syndrome S if r=111100. From this syndrome, find the most likely bit(s) to be in error. Confirm your answer with your standard array
A block of bits with n rows and k columns uses horizontal and vertical parity bits for error detection. Suppose that exactly 4 bits are inverted due to transmission errors. Drive a mathematical expression of n and k for the total number of different cases where these 4 error bits will be undetected. Show each important step of your derivation. (Hint: the error bits will be undetected if all the parity bits computed from the block remain unchanged.)
Information bits consisting of 1101 is to be transmitted using Hamming (7,4) code. a) Determine the transmitted codeword using the methods - G matrix and check equations b) If an error occurs in bit 2 during transmission, determine the syndrome c) Show how the syndrome can be used to correct the error. note: step by step process please, for easy understand. thanks.
a) Consider the (7,4) hamming code with data word 1111 and evaluate the 7-bt composite code word (use even parity). b) Assume the stored composite code from memory is 1010001. Evaluate the parity bits of the stored code, find the bit position in error, and correct it if it is correctable (use even parity).