Scribd
Upload
141 views

CW Math in Digital Communications Codes PDF

This document discusses the basics of coding theory, which deals with designing error-correcting codes to reliably transmit information over noisy channels. Some key points covered include: - The main goal of coding theory is to detect or correct errors during transmission. Simple codes like parity codes and repetition codes are described. - Hamming codes are introduced as a single error-correcting code. - Minimum distance and error detection/correction capability allow decoders to identify how many errors a code can handle. - Claude Shannon is credited with founding information theory, while Richard Hamming constructed early error-correcting codes.

Uploaded by

luxasuhi
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
141 views

CW Math in Digital Communications Codes PDF

This document discusses the basics of coding theory, which deals with designing error-correcting codes to reliably transmit information over noisy channels. Some key points covered include: - The main goal of coding theory is to detect or correct errors during transmission. Simple codes like parity codes and repetition codes are described. - Hamming codes are introduced as a single error-correcting code. - Minimum distance and error detection/correction capability allow decoders to identify how many errors a code can handle. - Claude Shannon is credited with founding information theory, while Richard Hamming constructed early error-correcting codes.

Uploaded by

luxasuhi
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

CW: Math in Digital

Communications (Codes)
Epifanio, Krizzie Urielle R.
Villavert, Maria Jevesha E.
Yu, Don Calvin S.

Coding Theory
➔ Deals with the design of error-correcting codes for the
reliable transmission of information across noisy channels
➔ The theory of error-correcting codes

Application:
➔ Transmission of pictures from distant space
➔ Quality of sound in CDs
➔ Establishment of computer networks
➔ Communication through telephone lines
➔ Messaging through wireless communication

The ​Main Goal of the Coding Theory is to detect, or even


correct, errors

➔ Error detection - Improve the reliability of digital


communication by devising methods that enable the receiver
to decide whether there have been errors during the
transmission.

➔ Error correction - If possible, to recover the original


message.
Simple Codes

1. Parity Code ​is the simplest form of error detection. A


single bit is appended to a bit string. There are two types
of parity which are odd and even parity.

➔ Even parity- number 1’s in


it is even

➔ Odd parity- number of 1’s


➔ in its odd

Illustration:

2. Repetition Code ​is the simplest possible error-correcting


code. It uses the process of majority decoding in which in
each block of 5 letters, the original letter is the one
that appears the most frequently in the block.

Illustration:
3.Hamming Code H(7,4) ​is a single error-correcting code.

Illustration:

Minimum Distance ​is the smallest distance of a code between


any two distinct codewords in the code. This method of decoding
uses the closest amount of hamming distance with the notation
d(C).
Error Detection and Error Correction Capability of a
Code allows the decoder to identify how much the minimum
distance can detect, and correct.

Claude Shannon is the author of “A


Mathematical Theory of Communication” that gave
birth to the information theory, commonly known
today as coding theory. Shannon published the
theoretical foundation of the said theory is
also credited for the idea of using redundancy
to add reliability to information.

Richard Hamming ​was the first to actually


construct and implement error-correcting codes.
his research included work in the areas of
coding theory, numerical methods, statistics,
and digital filtering.

You might also like