GATE EC 2022 Set 1 — Question 29
Go beyond PYQs with Success TrackerAI-powered personalised practice and doubt support. Unlimited practice on eligible plans; AI usage limits apply.MSQ+1 / -0HardInformation Measure & EntropyInformation TheoryCommunications
Communications → Information Theory → Information Measure & Entropy
Last updated
Question
Let
H(X) denote the entropy of a discrete random variable taking possible distinct real values. Which of the following statements is/are necessarily true?Correct answer
(A) H(X) ≤ ₂ K bits; (B) H(X) ≤ H(2X); (D) H(X) ≤ H(2^X)
Solution
The question asks to identify the statements that are necessarily true regarding the entropy
This is a fundamental property of entropy. The maximum entropy for a discrete random variable with possible outcomes occurs when all outcomes are equally probable (i.e., a uniform distribution). In this case, . For any other probability distribution, the entropy will be less than . Thus, is always true. This statement is correct.Option (B):
Let . If takes distinct values , then takes distinct values . The mapping is a one-to-one function. For any one-to-one deterministic function , the entropy remains unchanged, i.e., . Therefore, . The statement is true because . This statement is correct.Option (C):
Let . The mapping is not necessarily a one-to-one function. For example, if can take values and with and , then bit. However, will only take the value (since and ). So, , and bits. In this case, . Therefore, is not necessarily true. This statement is incorrect.Option (D):
Let . The mapping is a one-to-one function for real values of . If takes distinct values, then will also take distinct values. Similar to option (B), for a one-to-one deterministic function, the entropy remains unchanged. Therefore, . The statement is true because . This statement is correct.The final answer is
H(X) of a discrete random variable taking distinct real values.Option (A): bitsThis is a fundamental property of entropy. The maximum entropy for a discrete random variable with possible outcomes occurs when all outcomes are equally probable (i.e., a uniform distribution). In this case, . For any other probability distribution, the entropy will be less than . Thus, is always true. This statement is correct.Option (B):
Let . If takes distinct values , then takes distinct values . The mapping is a one-to-one function. For any one-to-one deterministic function , the entropy remains unchanged, i.e., . Therefore, . The statement is true because . This statement is correct.Option (C):
Let . The mapping is not necessarily a one-to-one function. For example, if can take values and with and , then bit. However, will only take the value (since and ). So, , and bits. In this case, . Therefore, is not necessarily true. This statement is incorrect.Option (D):
Let . The mapping is a one-to-one function for real values of . If takes distinct values, then will also take distinct values. Similar to option (B), for a one-to-one deterministic function, the entropy remains unchanged. Therefore, . The statement is true because . This statement is correct.The final answer is
Continue learning with Success Tracker
A step still unclear? Work through it with support
Use Success Tracker to ask about the reasoning, then try another GATE EC question to check your understanding.
AI-powered practice· Unlimited practice on eligible plans
- PYQs with solutions
- Attempt available previous-year questions, then compare your reasoning with the worked solution. Coverage varies by stream.
- Practice that adapts
- Choose a topic, work on weaker areas and bookmark questions to revisit. Your attempts feed your progress tracking.
- AI doubt support
- Ask follow-up questions about a step or concept while practising, instead of stopping at the final answer.
Unlimited practice is available on eligible plans. Free practice and AI usage have limits; check the current plan allowances before choosing.
This page stays readable without an account. AI responses can be wrong; check them against the solution and source material.
More questions on Information Theory
2026 Set 1 Q22Consider a discrete memoryless source with an alphabet of four source symbols. is a…2026 Set 1 Q32A wireless digital transmission scheme is using -QAM over an additive white Gaussian noise…2026 Set 1 Q44A QPSK modulated signal from an additive white Gaussian noise (AWGN) channel is received with an…2026 Set 1 Q55Let the relevant bandwidth () of a digital communication system be and…2026 Set 1 Q57Consider a real, narrowband signal where the maximum…