Error Control Basics

Every real communication channel introduces errors due to noise, interference, and fading. Error control coding is the systematic approach to detecting and correcting these errors at the receiver without requesting retransmission in every case. It is one of the most GATE-intensive topics in digital communications, covering detection, correction, channel capacity, and coding tradeoffs.

Core Concept Explanation

An error control code is a mapping from k information bits to n codeword bits (n > k) such that the added r = n - k redundant bits allow the receiver to detect or correct errors. The ratio k/n is called the code rate R, which measures the fraction of transmitted bits that carry actual information.

There are two fundamental error control strategies. In Automatic Repeat reQuest (ARQ), the receiver only detects errors and requests retransmission through a feedback channel. In Forward Error Correction (FEC), the receiver both detects and corrects errors without any retransmission. ARQ is simpler and more efficient when the channel error rate is low. FEC is necessary when a feedback channel is unavailable or when the propagation delay makes retransmission impractical, such as in satellite communication and deep-space probes.

The theoretical limit on reliable communication is set by Shannon's channel capacity theorem: for any channel with capacity C bits per use, reliable communication is possible at any rate R < C, and impossible at R > C. Error control coding is the practical tool for approaching this limit.

Mathematical Expression

The error-detecting and correcting power of a code is quantified by the minimum Hamming distance d_min of the code. The Hamming distance between two codewords is the number of bit positions in which they differ. For a code with minimum distance d_min:

To detect up to t_d errors: d_min is greater than or equal to t_d + 1

To correct up to t_c errors: d_min is greater than or equal to 2*t_c + 1

These conditions ensure that any received word with up to t_d errors is still closer to the transmitted codeword than to any other codeword, enabling unique decoding. A single code can simultaneously detect t_d errors and correct t_c errors provided d_min is greater than or equal to t_c + t_d + 1.

Practical Understanding

The choice between ARQ and FEC depends on the channel conditions and system constraints. In wireless data networks (Wi-Fi, 4G, 5G), Hybrid ARQ (HARQ) is used, combining FEC with selective retransmission. The receiver attempts FEC correction and only requests retransmission if correction fails, giving the best tradeoff between overhead and reliability.

Code rate directly affects bandwidth efficiency. A rate 1/2 code sends 2 bits for every 1 information bit, doubling the required bandwidth for the same data throughput. Higher code rates (like 3/4 or 7/8) waste less bandwidth but provide weaker error correction. Modern systems use punctured codes and adaptive rate selection to match code rate to channel quality dynamically.

Given:
A block code has n = 7, k = 4, d_min = 3
Code rate R = k/n
Channel has bit error probability p = 0.01

Why this formula applies:
d_min determines detection and correction capability.

Formula:
Code rate R = k/n
Error correction capacity: t_c = floor((d_min - 1)/2)
Error detection capacity: t_d = d_min - 1

Substitution:
R = 4/7 ≈ 0.571 (57.1% of bits carry information)
t_c = floor((3-1)/2) = floor(1) = 1 (can correct 1 error)
t_d = 3-1 = 2 (can detect up to 2 errors)

Calculation:
Uncoded bit error rate = 0.01
After correction of 1-bit errors in 7-bit blocks:
Residual block error ≈ C(7,2)*p^2*(1-p)^5 ≈ 21*(0.0001)*0.951 ≈ 0.002

Final Answer:
Code rate = 4/7 ≈ 0.571
Corrects 1 error, detects 2 errors per codeword
Residual block error rate ≈ 0.002 (reduced from 0.01 uncoded)

Exam Tip: A code that corrects t errors must have d_min greater than or equal to 2t+1. GATE frequently tests this formula in reverse: given d_min, find maximum correctable errors as t = floor((d_min-1)/2).

Key Concepts Summary

• Code rate R = k/n measures information efficiency; lower R means more redundancy and stronger protection.
• ARQ detects and retransmits; FEC corrects locally. HARQ combines both for modern wireless systems.
• d_min is greater than or equal to t+1 for t-error detection; d_min is greater than or equal to 2t+1 for t-error correction.
• Shannon capacity sets the theoretical maximum rate for reliable communication.
• FEC preferred for satellite, deep-space, and broadcast channels; ARQ preferred for low-delay duplex links.
• Puncturing increases code rate at the cost of reduced error protection.

Quick Revision

• Code rate R = k/n; r = n-k redundant bits added per k information bits.
• Detect t errors: d_min is greater than or equal to t+1. Correct t errors: d_min is greater than or equal to 2t+1.
• ARQ: detect + retransmit (needs feedback). FEC: detect + correct locally (no feedback needed).
• HARQ = FEC + selective ARQ, used in 4G/5G wireless systems.
• Shannon limit: reliable communication possible if and only if R < C.
• GATE trap: t_c = floor((d_min - 1)/2), not (d_min)/2.
• Higher code rate means less redundancy, less protection, but better spectral efficiency.