Solve your IGNOU Doubts

Question:

b) Let l be the $\left [ 5,2 \right ]$ ternary code generated by

$G=\begin{pmatrix} 1 &1 &0 &0 &1 \\0 &1 &0 &1 &1 \end{pmatrix}.$

Find the weight enumerato $Wl (x,y) of l.$

See Answer →

Question:

7) a) Le l be the ternary $\left [ 8,3 \right ]$ narrow-sense $BCH$ code of designed distance $\delta =5,$ which has defining set $T=\left \{ 1,2,3,4,5,6 \right \}.$ Use the primitive root 8th root of unity you chose in 4a) to avoid recomputing the the table of powers. If

$g(x)=x^{5}-x^{4}+x^{3}+x^{2}-1$

Image ignouassignments-ignouacademy-com--p-your-71924

Figure 1: Encoder for convolutional code.

is the generator polynomial of Image ignouassignments-ignouacademy-com--p-solve-58294 and

$y(x)=x^{7}-x^{6}-x^{4}-x^{3}$

is the received word, find the transmitted codeword.

See Answer →

Question:

Over $F_{2,}\left ( 1+x \right )|\left ( x^{n} -1\right ).$ Let L be the binary cyclic code $\left ( 1+x \right )$ of lenth n. $l_{1}$ be any binary cyclic code of length n with generator polynomial g $g_{1}$ $\left ( x \right ).$

i) What is the dimension of l?

ii) Let w be subspace of $F_{2}^{n}$ containing all the vectors of even weight. Prove that W has dimension n−1. (Hint: Consider the map w $F_{2}^{n}$ → $F_{2}^{}$ given by

$w((a_{1}a_{2}....a_{n}))=a_{1}+a_{2}+...+a_{n. )$

iii) Prove that l is the vector space of all vectors in $F_{2}^{n}$ with even weight.

iv) If l $_{1}$ has only even weight codewords, what is the relationship between $(1+x)$ and $g_{1}(x)?$

v) If $l_{1}$ has some odd weight codewords, what is the relationship between $1+x$ and $g_{1}(x)?$

See Answer →

Question:

Compute the DFT of the vector (−1, 3, 1, −1).

See Answer →

Question:

Let ${(-1,-5),(0,-4),(1,-1)}$ and ${(-1,14),(0,7),(1,-4)}$ be the point-value representation of $h(x)$

See Answer →

Question:

a) Find all the solutions of the equation $6_X\equiv 4$ (mod 114).

See Answer →

Question:

c) Compute the values $(d,x,y)$ that the call $E$ $_{XTENDED}$ - $E$ $_{UCLID}$ (10117,11591) returns.

See Answer →

Question:

b) When working modulo $q=17,$ how many spurious hits does the Rabin-Karp matcher encounter in the text $T=29103292566473$ when looking for the pattern $T=29103292566473$ when looking for the pattern $22?$

See Answer →

Question:

a) Show the comparisons the naive string matcher makes for the pattern $P=0100$ with $01100010010100100.$

See Answer →

Question:

Use Kruskal’s algorithm to find a minimal spanning tree in the graph given in Fig. 2. Image ignouassignments-ignouacademy-com--p-your-10165

See Answer →

Question:

Show the See Answer →

Question:

a) In the Coin changing problem, we have to give change for n rupees using the least number of coins of a given set of denominations. It is clear that we cannot give change for any See Answer →

Question:

) Find an optimal parenthesisation of a matrix chain product whose sequence of dimensions is (3, 5, 7, 3, 4).

See Answer →

Question:

For the following set of points, describe how the closest-pair algorithm finds a closest pair of
points:
(3, 2), (2, 1), (2, 3), (1, 2), (3, 1), (2, 2), (1, 3), (3, −1), (5, −2)

See Answer →

Question:

Show how mergesort sorts the array See Answer →

Question:

a) Show the results of inserting the keys
See Answer →

Question:

Discuss five types of infectious diseases caused by microbes. Add a note on the spread or transmission of these diseases.

See Answer →

Question:

What is mass communication? Discuss the technological advances in mass communication.

See Answer →

Question: