Scribd
Upload
3 views14 pages

EE5605 ECC For Comm Distr Systems Lec03

The document discusses the concepts of decoders and Hamming distance in the context of error-correcting codes for communications. It defines the decoder as a mapping from the channel output to codewords or a failure state, and introduces Hamming distance as a measure of difference between two words. Additionally, it outlines properties of Hamming distance and introduces the concept of minimum distance for block codes.

Uploaded by

Surajit Sahoo
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
3 views14 pages

EE5605 ECC For Comm Distr Systems Lec03

The document discusses the concepts of decoders and Hamming distance in the context of error-correcting codes for communications. It defines the decoder as a mapping from the channel output to codewords or a failure state, and introduces Hamming distance as a measure of difference between two words. Additionally, it outlines properties of Hamming distance and introduces the concept of minimum distance for block codes.

Uploaded by

Surajit Sahoo
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
You are on page 1/ 14

EE5605: Error-Correcting Codes for

Communications and Distributed Systems


Lec 03

Nikhil Krishnan M

[email protected]
https://iitpkd.ac.in/people/nikhil
Recap: Lec 02

𝒎 Encoder Channel Decoder


𝒄 𝒚
Decoder
• Given an (𝑛, 𝑀) code 𝒞 over 𝐹 and a channel, decoder is a mapping
from Φ𝑛 to 𝒞 ∪ {“FAIL”}
Example 1
Example 2
Definition: Hamming Distance
Given two words 𝑎, 𝑏 ∈ 𝐹 𝑛 , Hamming distance between them is the

symbols/coordinates on which they differ. We will denote it by: 𝑑(𝑎, 𝑏)


Hamming Distance: Some Useful Properties
• 𝑑 𝑎, 𝑏 ≥ 0 & 𝑑 𝑎, 𝑏 = 0 iff 𝑎 = 𝑏

• 𝑑 𝑎, 𝑏 = 𝑑 𝑏, 𝑎

• 𝑑 𝑎, 𝑐 ≤ 𝑑 𝑎, 𝑏 + 𝑑 𝑏, 𝑐
Definition: Minimum Distance of a Block Code
Given an (𝑛, 𝑀) block code 𝒞, its minimum distance is defined as:
Minimum Distance and Errors
Thank you

You might also like