Scribd
Upload
32 views10 pages

Perfect Codes

The document discusses two types of codes: perfect codes and quasi-perfect codes. Perfect codes achieve the Hamming bound and examples include repetition codes. Repetition codes repeat each data bit across the codeword to achieve error-free communication. Quasi-perfect codes have a very low probability of errors and examples are linear codes, which apply symbols like bits to the communication channel and can detect errors in the message block. Both types of codes are used to encode and decode messages over a communication channel.

Uploaded by

ASHAMDEV
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
32 views10 pages

Perfect Codes

The document discusses two types of codes: perfect codes and quasi-perfect codes. Perfect codes achieve the Hamming bound and examples include repetition codes. Repetition codes repeat each data bit across the codeword to achieve error-free communication. Quasi-perfect codes have a very low probability of errors and examples are linear codes, which apply symbols like bits to the communication channel and can detect errors in the message block. Both types of codes are used to encode and decode messages over a communication channel.

Uploaded by

ASHAMDEV
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 10

PERFECT CODES

AND

QUASI PERFECT CODES


PERFECT CODES
CODES THAT ATTAINS HAMMING
BOUNDING ARE CALLED PERFECT
CODES

THE HAMMING BOUND IS A LIMIT


OF THE PARAMETERS OF AN
ARBITRARY CODE
 EXAMPLE OF PERFECT CODE IS REPETITION CODES.

 REPETITION CODES HAVE ONLY ONE CODEWORD.

 REPETITION CODE IS AN (r,1) CODING SCHEME.

 IT REPEATS THE BITS ACROSS A CHANNEL TO ACHIEVE


ERROR FREE COMMUNICATION.

r = IS THE NO OF BITS IN EACH CODE WORD


1 = REPRESENTS FOR EACH DATA BIT TO BE CODED.
 IN REPETITION ENCODER.

SUPPOSE WE HAVE A (3,1) REPETITION CODE AND THEN

ENCODING THE SIGNAL m = 101001 WHICH YEILDS

A CODE C = 111000111000000111

REPETITION CODE IS VERY EASY FOR IMPLEMENTATION


 IN REPETITION DECODER.

SUPPOSE WE HAVE A (3,1) REPETITION CODE AND WE ARE DECODING

THE SIGNAL C = 11000111000000111 THE DECODED MESSAGE IS

m = 101001 BECAUSE OF MOST OCCURANCE OF 1’S AND 0’S.

REPETETION DECODING IS USUALLY DONE USING MAJORITY LOGIC

DETECTION.
APPLICATIONS

1. REPETITION CODES ARE KNOWN CODES WHOSE CODERATE

CAN BE AUTOMATICALLY VARIED FOR CHANNEL CAPACITY.

2. MOST MODULATION TECHNIQUES TRANSMIT A BIT OVER MANY

CYCLES OF SINUSOIDAL CARRIER SIGNAL.

3. DUE TO SIMPLYCITY OF CHANNEL ENCODING AND DECODING

THEY FIND APPLICATION IN MANY TYPES OF CHANNELS.


QUASI PERFECT CODES
IT HAS A VERY LESS PROBABILITY OF ERRORS .

EG: OF QUASI PERFECT CODE ARE LINEAR CODES.

LINEAR CODES ARE APPLIED IN METHODS OF TRANSMITTING

SYMBOLS EG: BITS ON THE COMMUNICATION CHANNEL.

IF ERRORS OCCUR IN THE COMMUNICATION IT IS DETECTED

BY THE MESSAGE BLOCK .


LINEAR CODES ARE BLOCKS OF SYMBOLES WHICH ARE

ENCODED USING MORE SYMBOLS THAN THE ORIGINAL

VALUE TO BE SENT.

EG: CONSIDER (m , n) BINARY LINEAR CODES.

EG: CONSIDER (7,4) BINARY LINEAR CODES.

7 REPRESENTS 4 BITS VALUES 3 BITS SYMBOLS .

4 REPRESENTS 4 BIT VALUES .

AS THERE ARE 16 DISTINCT 4 BIT VALUES EXPRESSED IN BINARY,

THE SIZE OF THE (7,4) CODE IS 16.


ENCODING

IN (7,4) LINEAR CODES ,LET CODE TO BE SENT IS 1100

AND MESSAGE BITS ARE 111 THEN ENCODED BITS ARE

C= 1100111.
DECODING

IF THE RECEIVED BITS ARE r= 1100111

THEN ERROR IS NOT OCCUERD.

IF THE RECIEVIED BITS ARE r=1101110 THEN IT INDICATES THAT

ERROR IS OCCURRED BECAUSE LAST THREE BITS ARE 110 INSTEAD

OF 111.

You might also like