CODING THEORY

Coding Theory Vice versa if it is also odd like 00111. Replace the
last bit from 1 to 0 to get an even parity, 00110.
- CODING THEORY is to detect or even
correct errors. Repetition Code
- Communication channel is the physical
medium in which messages are being - is performed by taking the k bits, then
transmitted repeat it 2r + 1 times, where 𝑟 ≥ 1 is a fixed
- Examples of these are telephone lines, integer.
internet cables, fiber-optic lines and air.
Storage of data is another example which
includes CD rom, DVDs, USB port, etc.
- Noises may affect the communication
- Examples of these are *Look at the first digit of each group. Find out which
- sunspots, lightning, meteor showers and is dominant between 0 and 1, until you get the
even human errors source code.
Encoding

- transforming messages into bits of message

that is suitable to the communication
channel.

Decoding

- is the opposite of encoding.

Parity Check

- The process that ensures accurate data

transmission between nodes during
communication. Modular Arithmetic
- encoding scheme wherein a single bit is - If a and b are integers and m is a natural
added to the message as redundancy bit number, in symbols
(last bit).
- used not only in communications but also to -
test memory storage devices. - meaning, “a is congruent to b modulo m.” If
- The goal in doing parity check is to end up a – b or b – a is divisible by m, then a is
with an even parity congruent to b (mod m).
- 0 (zero) is always an even number
1. Odd Parity
- Where the number of 1s is odd
2. Even Parity
- Where the number of 1s is even

*after adding the redundancy bit or the last bit then

the number of 1s is odd. For example: 11100.
*If m does not divide a – b or b – a, then 𝑟 ≅ 𝑏 (𝑚𝑜𝑑
Replace the last bit to 1 to get an even result, 11101.
𝑚) where r is the least residue (remainder) of m.
Below are some examples.
1
 CODING THEORY

*if dividend is less than the divisor let it be the b

value.