MCQ Practice Question
In polynomial representation of cyclic codes, multiplication by x followed by reduction modulo x^n-1 corresponds to?
Correct Answer: A. A cyclic shift
Explanation: Multiplication by x shifts polynomial coefficients; modulo x^n-1 wraps the end coefficient around, implementing a cyclic shift.
Reference: Standard communication systems: cyclic-code polynomial representation
