Exam 9: Source Coding

arrow
  • Select Tags
search iconSearch Question
  • Select Tags

Compute the effective file entropy Hf\mathrm { H } _ { \mathrm { f } } (xx.x bits) of the file that contains the following symbol sequence AAABAAACAAADAAAEAAAF

Free
(Essay)
4.8/5
(33)
Correct Answer:
Verified

Pe[A]=15/20=0.75,Pe[B]=1/20=0.05,Pe[C]=0.05,Pe[D]=0.05,Pe[E]=0.05,,Pe[F]=0.05.Hs=Pe[Xi]log2Pe[Xi]=(0.75)(0.42)(5)(0.05)(22.02)=1.39 bits/symbols. Hf=1.39 bits/symbols x20 symbols =27.8 bits \begin{array} { l } P _ { e } [ A ] = 15 / 20 = 0.75 , P _ { e } [ B ] = 1 / 20 = 0.05 , P _ { e } [ C ] = 0.05 , P _ { e } [ D ] = 0.05 , P _ { e } [ E ] = 0.05 , , P _ { e } [ F ] = 0.05 . \\{ } ^ { \wedge } H _ { s } = - \sum P _ { e } \left[ X _ { i } \right] \log _ { 2 } P _ { e } \left[ X _ { i } \right] = - ( 0.75 ) ( - 0.42 ) - ( 5 ) ( 0.05 ) ( - 22.02 ) = 1.39 \text { bits/symbols. } \\H _ { f } = 1.39 \text { bits/symbols } x 20 \text { symbols } = 27.8 \text { bits }\end{array}

Compute the value of the encryption key using the following values: N = 13, a = 7, x = 8, and y = 5. The value of the key equals K=______.

Free
(Essay)
4.7/5
(32)
Correct Answer:
Verified

X=[a×]mod(N)=[78]mod(13)=3.Y=[ay]mod(N)=[75]mod(13)=11.KT=[Y×]mod(N)=[118]mod(133=9X = \left[ a ^ { \times } \right] _ { \bmod ( \mathbb { N } ) } = \left[ 7 ^ { 8 } \right] _ { \bmod ( 13 ) } = 3 . Y = \left[ a ^ { y } \right] _ { \bmod ( N ) } = \left[ 7 ^ { 5 } \right] _ { \bmod ( 13 ) } = 11 . K _ { \mathrm { T } } = \left[ Y ^ { \times } \right] _ { \bmod ( N ) } = \left[ 11 ^ { 8 } \right] _ { \bmod ( 133 } = 9 KR=[Xy]mod(N)=[35]mod(13)=9K _ { R } = \left[ X ^ { y } \right] _ { \bmod ( N ) } = \left[ 3 ^ { 5 } \right] _ { \bmod ( 13 ) } = 9

Four coins are flipped.Each coin tail is recorded as a 0 and a head as a 1 and the source symbol is the sum, with X1\mathrm { X } _ { 1 } corresponding to sum =0, X2X _ { 2 } to sum = 1, etc.The number of unique symbols is _______.

Free
(Essay)
4.8/5
(33)
Correct Answer:
Verified

The four coins can produce sums from 0 (by 0000=X1 ) to 4( by 1111=X5)0 \text { (by } 0000 = X _ { 1 } \text { ) to } 4 \left( \text { by } 1111 = X _ { 5 } \right) \text {. } Hence, 5 unique symbols.

Four fair coins are flipped.Each coin tail is recorded as a 0 and a head as a 1 and the source symbol is the sum, with X1X _ { 1 } corresponding to sum =0, X2X _ { 2 } to sum = 1, etc.The source entropy equals HS=________(x.xx) bits/symbol?

(Essay)
4.7/5
(27)

The pseudo-random number generator equation given by Xi=mod[(12345Xi1+67),10000]X _ { i } = \bmod \left[ \left( 12345 X _ { i - 1 } + 67 \right) , 10000 \right] with the seed X0=999 produced X1=2722 and X2=3157. The values for R2S1 and RBS2 are X _ { 0 } = 999 \text { produced } X _ { 1 } = 2722 \text { and } X _ { 2 } = 3157 \text {. The values for } R ^ { 2 } S _ { 1 } \text { and } \mathrm { RBS } _ { 2 } \text { are } _______.

(Essay)
4.8/5
(43)

What are the effective probabilities of the symbols in the following 20-symbol sequence?  AAABAAACAAADAAAEAAAF \text { AAABAAACAAADAAAEAAAF }

(Essay)
4.8/5
(36)

Consider the Huffman code tree given by Consider the Huffman code tree given by   The binary sequence generated by the symbols BAEDC is ______________? The binary sequence generated by the symbols BAEDC is ______________?

(Essay)
4.9/5
(41)

Four coins are flipped.Each coin tail is recorded as a 0 and a head as a 1.The number of possible coin combinations is _______.

(Essay)
4.9/5
(36)

Consider the Huffman code tree given by  Consider the Huffman code tree given by   The symbols represented by the following binary sequence  01100100000011  is the list _______. The symbols represented by the following binary sequence 0110010000001101100100000011 is the list _______.

(Essay)
4.9/5
(32)

A source produces symbols A, B, and C having probabilities P[A]=0.9,P[B]=0.07,P[C]=0.02,P[D]=\mathrm { P } [ \mathrm { A } ] = 0.9 , \mathrm { P } [ \mathrm { B } ] = 0.07 , \mathrm { P } [ \mathrm { C } ] = 0.02 , \mathrm { P } [ \mathrm { D } ] = 0.01. The source entropy equals _____ (x.xx) bits/symbol

(Essay)
4.9/5
(48)

Using the pseudo-random number generator equation given by Xi=mod[(12345Xi1+67),10000]X _ { i } = \bmod \left[ \left( 12345 X _ { i - 1 } + 67 \right) , 10000 \right] with the seed X0=999X _ { 0 } = 999 , the value of X2=X _ { 2 } =----

(Essay)
4.8/5
(32)

Four fair coins are flipped.Each coin tail is recorded as a 0 and a head as a 1 and the source symbol is the sum, with X1X _ { 1 } corresponding to sum =0, X2X _ { 2 } to sum = 1, etc.The probability of the source producing X3X _ { 3 } equals _______.

(Essay)
4.8/5
(40)

What is the encrypted form of the following binary data sequence using the random binary sequence shown? (D) 10101010\quad 10101010 (RBS) 10100101 (E) ____

(Essay)
4.9/5
(39)

Compute the effective source entropy HS(x.xx bits/symbol) { } ^ { \wedge } \mathrm { H } _ { \mathrm { S } } ( \mathrm { x } . \mathrm { xx } \text { bits/symbol) } of the source producing following 20-symbol sequence AAABAAACAAADAAAEAAAF

(Essay)
4.7/5
(38)
close modal

Filters

  • Essay(0)
  • Multiple Choice(0)
  • Short Answer(0)
  • True False(0)
  • Matching(0)