Scribd Logo
Upload

Welcome to Scribd!

  • 31 views

    Ec 7005 1 Information Theory and Coding Dec 2020

    Uploaded by

    Rohit kumar
    The document is a practice exam for an Information Theory and Coding course. It contains 8 questions covering various topics in information theory and coding techniques. The first question defines key information theory concepts like uncertainty, information, and entropy. It asks to calculate the entropy of binary systems and a joint probability distribution. The other questions cover topics like Huffman coding, syndrome decoding, cyclic codes, the Viterbi algorithm, and cyclic redundancy checks.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Ec 7005 1 Information Theory and Coding Dec 2020

    Uploaded by

    Rohit kumar
    31 views3 pages
    The document is a practice exam for an Information Theory and Coding course. It contains 8 questions covering various topics in information theory and coding techniques. The first question defines key information theory concepts like uncertainty, information, and entropy. It asks to calculate the entropy of binary systems and a joint probability distribution. The other questions cover topics like Huffman coding, syndrome decoding, cyclic codes, the Viterbi algorithm, and cyclic redundancy checks.

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document is a practice exam for an Information Theory and Coding course. It contains 8 questions covering various topics in information theory and coding techniques. The first question defines key information theory concepts like uncertainty, information, and entropy. It asks to calculate the entropy of binary systems and a joint probability distribution. The other questions cover topics like Huffman coding, syndrome decoding, cyclic codes, the Viterbi algorithm, and cyclic redundancy checks.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    31 views3 pages

    Ec 7005 1 Information Theory and Coding Dec 2020

    Uploaded by

    Rohit kumar
    The document is a practice exam for an Information Theory and Coding course. It contains 8 questions covering various topics in information theory and coding techniques. The first question defines key information theory concepts like uncertainty, information, and entropy. It asks to calculate the entropy of binary systems and a joint probability distribution. The other questions cover topics like Huffman coding, syndrome decoding, cyclic codes, the Viterbi algorithm, and cyclic redundancy checks.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 3

    Total No. of Questions : 8] [1] [Total No.

    of Printed Pages : 3

    Roll No ..................................
    EC-7005(1)-CBGS
    B.E. VII Semester
    Examination, December 2020
    Choice Based Grading System (CBGS)
    Information Theory and Coding
    Time : Three Hours
    Maximum Marks : 70
    Note: i) Attempt any five questions.
    ii) All questions carry equal marks.

    l. a) Define uncertainty, information and entropy. State the


    various units of information and find relation between
    them. Show that entropy of a binary system (two events)
    is maximum when both events are equiprobable.

    b) Consider that two sources S1 and S2 emit message x1, x2,


    x3 and y1, y2, y3 with the joint probability p(X, Y) as shown
    in the matrix form. Calculate H(X), H(Y), H(X/Y) and
    H(Y/X). Given that:

    y1 y2 y3
    x1 3/40 1/40 1/40
    p (Y/X) = x2 1/20 3/20 1/20
    x3 1/8 1/8 3

    EC-7005(1)-CBGS PTO

    https://www.rgpvonline.com
    [2]

    2. a) Apply the Huffman encoding procedure for the following


    message ensembles:
    [X] = [ X1 X2 X3 X4 X5 X6 X7 ]
    [P] =[ 0.4 0.04 0.08 0.12 0.08 0.08 0.2 ]
    Find the codewords for every message and calculate the
    efficiency of the coding method. The number of symbol
    used for coding M = 3.
    b) Explain the Shannon-Fano coding method with the help
    of a suitable example.

    3. a) Explain syndrome and syndrome decoding method in


    linear block codes with suitable diagram.
    b) A parity check matrix is given as

    ⎡1 0 1 1 0 0 ⎤
    H = ⎢⎢1 1 0 0 1 0⎥⎥
    ⎢⎣0 1 1 0 0 1 ⎥⎦

    i) Determine generator matrix


    ii) Find code word that begins with 011
    iii) Suppose received vector is 110110, decode the vector

    4. a) What are cyclic codes? Write down the basic properties


    of cyclic codes.
    b) The generator polynomial for (7, 4) cyclic Hamming code
    is given by G(x) = 1 + x + x3.
    Determine the systematic and non systematic code word
    for the message vector 1010.

    5. The generator polynomial of a (7, 4) cyclic code is


    g(x)=1+x+x2. Find the code-words of this code.

    EC-7005(1)-CBGS PTO
    Contd...

    https://www.rgpvonline.com
    [3]

    6. Explain Viterbi algorithm for maximum likelihood decoding.

    7. Given that Message (D) = 1010001101 and Pattern


    (P) = 110101, calculate the FCS (R) and the message which is
    actually transmitted (T) using Cyclic Redundancy Check
    method. Also check it for correctness at receiver end that
    received message is correct or not. Do all calculations in clear
    manner.

    8. Write short notes on:


    a) Hamming code and its applications
    b) Convolutional codes

    ******

    EC-7005(1)-CBGS PTO

    https://www.rgpvonline.com

    You might also like