To take a really simple code, let's say you have this data:
10110
Then you append a checksum (actually a parity bit here) to the data 1+0+1+1+0 = 1 (in binary)
101101
Now let's say there's interference and a bit flips:
100101
The receiver calculates the checksum and sees that the sum is 1+0+0+1+0 = 0, which does not fit since the sum is supposed to be 1. Thus the receiver knows that an error happened and can request a retransmission. More advanced codes like those discussed here can allow arbitrary levels of error correction, instead of only detection of single errors like the parity bit; but higher levels of error correction come with an overhead, and apparently the innovation here is a technique to reduce this cost in wireless networks.
The two problems (data compression, and noisy channel coding) are tied together quite neatly by information theory though: http://www.inference.phy.cam.ac.uk/mackay/itila/book.html