Jump to:  Browse | Search | Email 

Browse:  most popular entries | oldest entries | most recent entries 

Information Theory, Inference, and Learning Algorithms > Information Theory > Noisy Channel Coding

What is the solution to Exercise 11.6 (p.188)?

What do I need to set up a Turbo coding lab?

How do you calculate the BER Shannon limit curve (as in "Gallager Codes - Recent Results" fig 3a, p.5)

Usually all information bits on a channel are equally "important". Is there any _principled_ theory about encoding data of _unequal_ importance?

Why do you define the shannon limit equation(i.e. the equation of the borderline between the achievable and the unachievable)as R = \frac{C}{(1-H_2(\pb))}? I was wondering where it comes from.

What is the solution to Exercise 13.9 (p.218)? How can I prove that the code has low-weight codewords ?

On the page 214 (Concatenation of Hamming Codes) there is an equation of the probability of block error to the leading order. Also on page 223. Is this correct?

I’ve unsuccessfully tried to replicate the calculations used to produce figure 13.14 using the probability of bit error to leading order $p_{\rm b} = \frac{3}{N} {{N} \choose {2}} f^2$, calculating pb for each N (3, 21, 315,…) and f=0.0588. Does f change for each N? If not, which equation was used to make this figure? Thank you in advance. Lucas

Should the 1/2 on the RHS of eq (11.40) be replaced by 1/2 Log[2 Pi E]?

I have read the book. I find the formula (11.33) is a little hard to understand. Why you said C= log(M)/N ?

Showing 1 to 10 of 13 entries   (Next)