Name: Lila Jane C.
Miclat Score: _______
Section: BSN-1-YA-7 Instructor: Mr. Melanio Nipas Date: December 18, 2021
Activity 5.2
CODING
Suppose the following messages are source encoded given by the table.
Encoded
Message
Bits
UP 00
DOWN 01
LEFT 10
RIGHT 11
I. Complete the given table by writing the source encoded message of the following set of directions.
Set of Directions Source Encoding
LEFT - UP - RIGHT - DOWN 1.) 10001101
UP - DOWN - UP - RIGHT 2.) 00010011
DOWN - DOWN - RIGHT - LEFT 3.) 01011110
UP - DOWN - LEFT - RIGHT 4.) 00011011
RIGHT - LEFT - RIGHT - UP 5.) 11101100
II. Decode the set of directions given by the message received.
Message Received Decoded Message
10010011 1.) LEFT - DOWN - UP - RIGHT
01010010 2.) DOWN - DOWN - UP - LEFT
11000110 3.) RIGHT - UP - DOWN - LEFT
01100111 4.) DOWN - LEFT - DOWN - RIGHT
00101111 5.) UP - LEFT - RIGHT - RIGHT
Name: Lila Jane C. Miclat Score: _______
Section: BSN-1-YA-7 Instructor: Mr. Melanio Nipas Date: December 18, 2021
Activity 3.3
Coding
I. What is/are the advantages and disadvantages of adding more redundancy bit in a message? Explain
briefly.
When it comes to this, redundancy of bits in a message can be a safeguard. They are generated
and moved within a data transfer to make sure that no bits were lost during the data transfer. It can also
protect a storage array against loss of data in the event of hard disks errors/ failures. On the other hand,
it doesn’t guarantee a very high percentage of its ability to detect errors, especially that nowadays, there
are many experts on doing illegal things with regards to systems.
II. Complete the given table by writing the channel encoded message by using parity check of adding 1
bit in the message.
Source Channel
Message
Encoding Encoding
ALLY 000 1.) 0000
ENEMY 011 2.) 0111
ATTACK 100 3.) 1000
RETREAT 111 4.) 1110
SURRENDER 101 5.) 1011
Name: Lila Jane C. Miclat Score: _______
Section: BSN-1-YA-7 Instructor: Mr. Melanio Nipas Date: December 18, 2021
Activity 5.4
CODING
I. Encode the following messages using the given message and the value of r.
Source Encoding r Channel Encoding
101 2 1.) 101101101101101
100 3 2.) 100100100100100100100
001 2 3.) 001001001001001
011 2 4.) 011011011011011
110 3 5.) 110110110110110110110
II. Decode the following messages that encounter noises in the channel where the channel encoding uses
repetition code where k = 3.
1.) 101 101 011 100 110 101 .
2.) 010 010 001 010 011 010 .
3.) 111 110 110 010 100 110 .
4.) 100 100 001 010 010 000 .
5.) 101 111 101 111 110 111 .