Find an upper bound and lower bound for the following linear codes of
length n=15 and d=5
Find the distance of the linear code C with the given generator matrix
G=1 1 1 0 0 0 0 0 00 0 0 1 1 1 0 0 01 1 1 1 1 1 1 1 1
Find the generator matrix for C andC where H=100100010001010001
Find the basis for the dual code for C=<S>, for
S=11000,01111,11110,01010
Find the basis for the C=<S> ,for S={010,011,111}
For the code C={00000,11000,00011,11011},determine the error pattern
that C will correct.
Let p=0.9.n=3,C={000,111}.
If v=000 is sent ,find the probability that IMLD will correctly conclude this
after one transmission.
Find the code generated by S={0100,0011,1010}
Find the distance of C={1000,0101,1110,1111}
Let C be the code consisting of all words of length 4 which have even
weight .Find the error patterns C detects.