Editing Coding theory (section)

==History of coding theory==
{{excerpt|History of information theory}}

Shannon’s paper focuses on the problem of how best to encode the [[information]] a sender wants to transmit. In this fundamental work he used tools in probability theory, developed by [[Norbert Wiener]], which were in their nascent stages of being applied to communication theory at that time. Shannon developed [[information entropy]] as a measure for the uncertainty in a message while essentially inventing the field of [[information theory]].

The [[binary Golay code]] was developed in 1949. It is an error-correcting code capable of correcting up to three errors in each 24-bit word, and detecting a fourth.

[[Richard Hamming]] won the [[Turing Award]] in 1968 for his work at [[Bell Labs]] in numerical methods, automatic coding systems, and error-detecting and error-correcting codes. He invented the concepts known as [[Hamming code]]s, [[Hamming window]]s, [[Hamming numbers]], and [[Hamming distance]].

In 1972, [[N. Ahmed|Nasir Ahmed]] proposed the [[discrete cosine transform]] (DCT), which he developed with T. Natarajan and [[K. R. Rao]] in 1973.<ref name="Ahmed">{{cite web|url=https://www.scribd.com/doc/52879771/DCT-History|title=How I Came Up With the Discrete Cosine Transform|author=Nasir Ahmed|publisher = Digital Signal Processing, Vol. 1, Iss. 1, 1991, pp. 4-5|author-link=N. Ahmed}}</ref> The DCT is the most widely used [[lossy compression]] algorithm, the basis for multimedia formats such as [[JPEG]], [[MPEG]] and [[MP3]].