Scribd
Upload
7 views8 pages

Information Theory and Coding Cat 2

The document outlines the Continuous Assessment Test II for the course BECE313L – Information Theory and Coding at the School of Electronics Engineering for Winter Semester 2023-2024. It includes five questions related to Huffman coding, decoding, and systematic linear block codes, each with specific tasks and calculations required. The total marks for the test are 50.

Uploaded by

sivaani sangeetha
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
7 views8 pages

Information Theory and Coding Cat 2

The document outlines the Continuous Assessment Test II for the course BECE313L – Information Theory and Coding at the School of Electronics Engineering for Winter Semester 2023-2024. It includes five questions related to Huffman coding, decoding, and systematic linear block codes, each with specific tasks and calculations required. The total marks for the test are 50.

Uploaded by

sivaani sangeetha
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 8

School of Electronics Engineering

Winter Sem 2023-2024


Continuous Assessment Test - II
BECE313L – Information Theory and Coding

B.Tech (ECE) SLOT: A1 Marks: 50

Q. No Answer All Questions Mark


1 Design a Ternary and Quaternary Huffman code for the following symbols and calculates its 10
code efficiency and redundancy.
Symbols = { A, B, C, D, E, F, G, H } and their corresponding
Probability of occurrence are { 0.24, 0.18, 0.18, 0.15, 0.10, 0.08, 0.04, 0.03 }

Ans:
2 Suppose there is a set of four symbols, i.e., {B, A, C, D, E} with probabilities {0.2, 0.1, 0.3, 0.2, 10
0.2}. The receiver receives 0.696 in terms of real decimal number with an additive noise of 0.02.
At the receiver, the output of the Regenerative Repeater is fetched to Arithmetic decoder.
Construct the transmitted message considering that the receiver stops decoding upto five
symbols.
Answer:
3 Assume that the source is generating 26 lower case English alphabets. Apply adaptive Huffman 10
encoding algorithm for the following message.
Believe

Ans:
4 The initial dictionary of LZW decoding is given below. 10
Index Word /alphabets
1 V
2 T
3 I
4 @
5 W
6 J
7 N

Decode the Input sequence from the following encoded message

1 3 2 4 8 10 12 11 9 4 5 3 7 17 19 21 7

Ans:
5 For a systematic linear block code , the parity check digits are represented by 10
C5 = d1⨁ d2⨁d3
C6 = d2⨁ d3⨁d4
C7 = d1⨁d3⨁d4
C8 = d1⨁d2
(a) Construct the generator matrix and estimate the code rate.
(b) Construct the encoder circuit.
(c) Given a received message R = [1 0 1 0 0 1 1 1] find the syndrome vector and corrected code
word.

Answer:

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy