Formalization of Shannon's Theorems in SSReflect-Coq

@inproceedings{Affeldt2012FormalizationOS,
  title={Formalization of Shannon's Theorems in SSReflect-Coq},
  author={Reynald Affeldt and Manabu Hagiwara},
  booktitle={ITP},
  year={2012}
}
The most fundamental results of information theory are Shannon’s theorems. These theorems express the bounds for reliable data compression and transmission over a noisy channel. Their proofs are non-trivial but rarely detailed, even in the introductory literature. This lack of formal foundations makes it all the more unfortunate that crucial results in computer security rely solely on information theory (the so-called “unconditional security”). In this paper, we report on the formalization of a… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 13 references

Similar Papers

Loading similar papers…