The inequality $\chi \le H(X)$ gives the upper bound on accessible information. This much is clear to me. However, what isn't clear is how this tells me I cannot transmit more than $n$ bits of information.

I understand that if $\chi < H(X)$, then reliable in-ferment isn't possible, with the Fano inequality giving the lower bound for the chance of an error being made.

However, I've seen some examples state that $\chi\le n$ proves this, which I can only see being the case of $H(X)$ is maximum for each qubit. Do they mean that if $\chi = H(X)$ then given that this is all the information about one qubit, then for $n$ qubits, if $\chi=H(X)$ for all of them then $\chi =n$?

Is it taking the $H(X)$ as all the information of a single qubit/bit, regardless of its value, and as such if $\chi$ is equal to it, it is said to have access to all that information as well?

The inequality $\chi \le H(X)$ gives the upper bound on accessible information. This much is clear to me. However, what isn't clear is how this tells me I cannot transmit more than $n$ bits of information.

I understand that if $\chi < H(X)$, then reliable in-ferment isn't possible, with the Fano inequality giving the lower bound for the chance of an error being made.

However, I've seen some examples state that $\chi\le n$ proves this, which I can only see being the case of $H(X)$ is maximum for each qubit. Do they mean that if $\chi = H(X)$ then given that this is all the information about one qubit, then for $n$ qubits, if $\chi=H(X)$ for all of them then $\chi =n$?

Is it taking the $H(X)$ as all the information of a single qubit/bit, regardless of its value, and as such if $\chi$ is equal to it, it is said to have access to all that information as well?

Edit: Maybe to make this clearer, I am asking where $n$ comes from if we take $\chi \le H(X)$, as in many cases $H(X)$ will not be maximum.

$\chi \le H(X)$ gives the upper bound on accessible information. This much is clear to me. However what isn't clear is how this tells me I cannot transmit more than $n$ bits of information. I understand that if $\chi < H(X)$, then reliable in-ferment isn't possibe, with the fano inequality giving the lowerbound for the chance of an error being made. However, I've seen some examples state that $\chi\le n$ proves this, which I can only seen being the case of $H(X)$ is maximum for each qubit. Do they mean that if $\chi = H(X)$ then given that this is all the information about one qubit, then for n qubits, if $\chi=H(X)$ for all of them then $\chi =n$? Is it taking the $H(X)$ as all the information of a single qubit/bit, regardless of its value, and as such if $\chi$ is equal to it, it is said to have access to all that information as well?

The inequality $\chi \le H(X)$ gives the upper bound on accessible information. This much is clear to me. However, what isn't clear is how this tells me I cannot transmit more than $n$ bits of information. 

I understand that if $\chi < H(X)$, then reliable in-ferment isn't possible, with the Fano inequality giving the lower bound for the chance of an error being made. 

However, I've seen some examples state that $\chi\le n$ proves this, which I can only see being the case of $H(X)$ is maximum for each qubit. Do they mean that if $\chi = H(X)$ then given that this is all the information about one qubit, then for $n$ qubits, if $\chi=H(X)$ for all of them then $\chi =n$? 

Is it taking the $H(X)$ as all the information of a single qubit/bit, regardless of its value, and as such if $\chi$ is equal to it, it is said to have access to all that information as well?