0% found this document useful (0 votes)
4 views3 pages

Coding Theory and Modular Arithmetic

Uploaded by

qamrestar
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
0% found this document useful (0 votes)
4 views3 pages

Coding Theory and Modular Arithmetic

Uploaded by

qamrestar
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

CODING THEORY AND MODULAR ARITHMETIC - the goal of parity check is to end up with a even

- the study of the properties of codes and their respective foe parity
specific application. TYPES: ODD parity
- codes are used for data compression, cryptography, error EVEN parity
detection and correction, data transmission and data correction Ex. 1.) Perform the channel encoding by adding a redundancy bit
size of 3.
HISTORY 1.) 00 - 00000 = 0 EVEN
- codes are studied by various scientific disciplines, such as 2.) 01 - 01111 = 4 EVEN
information theory, electrical engineering, mathematics linguistic, 3.) 11 - 11111 = 5 ODD
and computer science for the purpose of designing efficient and 11110 = 4 EVEN
reliable data transmission methods. 4.) 10 - 10000 = 1 ODD
10001 = 2 EVEN
CODING THEORY - includes the removal of redundancy and the Ex. 2.) Perform the channel encoding by adding a redundancy bit
correction of detection of errors in the transmitted data. size 4.
1.) 001 - 0011111 = 5 ODD
Sender Noise Receiver 0011110 = 4 EVEN
/ / / 2.) 010 - 010000 = 1 ODD
Source encoder - Communication Channel - Source Decoder 010001 = 2 EVEN
3.) 110 - 1100000 = 2 EVEN
COMMUNICATION CHANNEL 4.) 101 - 1011111 = 6 EVEN
- there are physical medium where information is transmitted. 2. REPETITION CHECK
- telephone lines, internet cables, fiber optic lines, and some - is performed by taking bits than repeat it 2r + 1 times, where
storage data can be considired channels will be the message?

NOISE ,
- it alters message in the channel that will cause disruption and
error in the messages.

SOURCE CODING/CHANNEL CODING


- in transmitting messages, coding is defined as source coding
and channel coding.

TWO PROCESS IN CODING


1. ENCODING - transforming message into bits of message
that is cuitable in communication.
2. DECODING - the opposite of process of encoding.

DATA COMPRESSION OR SOURCE ENCODING


- it is defined as converting the message from sender into BITS
suitable to the communication channel.

BIT/BINARY DIDGIT
BIT (short for “binary digit”) - smallest unit of
measurement used to quantify computer data. It contains
a single binary value of 0 or 1.

ASCII - an example of bit is ASCII that converts each


character of a message into a byte of B bits.

Ex. Consider the source encoding of from direction is required


known as CHANNEL CODING
/
defined as adding same
redundancy to the source
encoded message so the
errors can be detected or
even corrected .

TYPES OF CHECK
1. PARITY CHECK
- also called as “vertical redundancy check”
- this is a process that ensures accurate data
transmission.
MODULAR ARITHMETIC .
- a system of arithmetic for integers a given fixed quantity to
leave a remainder.
- also known as “modulo”
- number “wrap around” upong reaching a given fixed quantity
to leave a remainder.

“Least Residue”
- to determine the least residue simply get the reminder when b
is devided by m.
- b (mod m) means b divided by m.
.
.
EX:

You might also like