Information and coding
The capacity and reliability of communication through noise, deletions and networks.
5 problemsRecovering and transmitting information when observations are incomplete or noisy.
Also under Communication systems
The capacity and reliability of communication through noise, deletions and networks.
5 problemsWhat is the exact reliable information rate when bits disappear independently and the receiver cannot see where they were removed?
Do polynomially many independently damaged copies always suffice to recover every unknown binary string exactly?
Seven symbols sit around a circle, and neighboring symbols can be confused. How many messages can long strings of these symbols carry with absolutely no decoding mistakes?
If each transmitted bit flips independently with a fixed probability, adding redundancy reduces mistakes. How quickly can the best possible error probability fall as the message block gets longer?
Several senders share a network of two-way links. Can mixing their messages inside the network ever carry more independent traffic than forwarding and splitting the messages along paths?