Past exam question: 2071 Chaitra, Q13(b)
Open in the Padhaiko appQuestion
Differentiate between linear block codes and cyclic codes.
Solution
Comparison: Linear Block Codes vs Cyclic Codes:
| Parameter | Linear Block Codes | Cyclic Codes |
|---|---|---|
| Definition | Any code where the modulo-2 sum (XOR) of any two valid codewords is also a valid codeword in the code space. | A special subclass of linear block codes that satisfies an additional cyclic shift property. |
| Cyclic Shift Property | Not necessarily satisfied; shifting a valid codeword cyclically may produce an invalid word. | Mandatory: If is a valid codeword, its cyclic right shift is guaranteed to be a valid codeword. |
| Mathematical Formulation | Represented using matrix algebra over with generator matrix () and parity matrix . | Represented algebraically as polynomials modulo , generated by a generator polynomial that divides . |
| Hardware Implementation | Requires complex matrix multiplication hardware (XOR gate matrices). | Implemented easily and compactly in hardware using linear feedback shift registers (LFSR) and simple XOR gates. |
| Examples | Standard parity codes, basic Hamming code. | Cyclic Redundancy Check (CRC), BCH codes, Reed-Solomon codes. |
Answer:
In linear block codes, the XOR sum of any two valid codewords is a valid codeword; cyclic codes are a strict subclass of linear block codes that also satisfy cyclic-shift closure (every cyclic shift of a codeword is a codeword), enabling compact LFSR hardware implementation.