Let $H(X)$ denote the entropy of a discrete random variable $X$ taking $K$ possible distinct real values. Which of the following statements is/are necessarily true?
Entropy is maximised by the uniform distribution, so $H(X)\le\log_2K$. The maps $x\to2x$ and $x\to2^x$ are one-to-one, so they preserve the probabilities and $H(2X)=H(2^X)=H(X)$. The map $x\to x^2$ can merge $\pm a$ and can only lose information, so $H(X^2)\le H(X)$ and C is not necessarily true.
More Information Theory questions
GATE 2022 EC Q61– The transition diagram of a discrete memoryless channel with three input symbols and three…
GATE 2022 EC Q62– Consider communication over a memoryless binary symmetric channel using a (7, 4) Hamming…
GATE 2021 EC Q33– A speech signal, band limited to 4 kHz, is sampled at 1.25 times the Nyquist rate. The…
GATE 2021 EC Q44– A digital transmission system uses a (7,4) systematic linear Hamming code for transmitting…
GATE 2021 EC Q61– In a high school having equal number of boy students and girl students, 75% of the…
GATE 2020 EC Q32– A binary random variable X takes the value +2 or -2. The probability P(X=+2)=. The value…