the next year Raj Chandra Bose and Dwijendra Kumar Ray-Chaudhuri, discover BCH codes 1960 – Irving S. Reed and Gustave Solomon propose Reed–Solomon codes 1962 – Robert G. Gallager proposes low-density parity-check codes; they are unused for 30 years due to technical limitations 1965 – Dave Forney discusses concatenated codes 1966 – Fumitada Itakura (Nagoya University) and Shuzo Saito (Nippon Telegraph and Telephone) develop linear predictive coding (LPC), a form of speech coding 1967 – Andrew Viterbi reveals the Viterbi algorithm, making decoding of convolutional codes practicable 1968 – Elwyn Berlekamp invents the Berlekamp–Massey algorithm; its application to decoding BCH and Reed–Solomon codes is pointed out by James L. Massey the following year 1968 – Chris Wallace and David M. Boulton publish the first of many papers on Minimum Message Length (MML) statistical and inductive inference 1970 – Valerii Denisovich Goppa introduces Goppa codes 1972 – Jørn Justesen proposes Justesen codes, an improvement of Reed–Solomon codes 1972 – Nasir Ahmed proposes the discrete cosine transform (DCT), which he develops with T. Natarajan and K. R. Rao in 1973; the DCT later became the most widely used lossy compression algorithm, the basis for multimedia formats such as JPEG, MPEG and MP3 1973 – David Slepian and Jack Wolf discover and prove the Slepian–Wolf coding limits for distributed source coding 1976 – Gottfried Ungerboeck gives the first paper on trellis modulation; a more detailed exposition in 1982 leads to a raising of analogue modem POTS speeds from 9.6 kbit/s to 33.6 kbit/s 1976 – Richard Pasco and Jorma J. Rissanen develop effective arithmetic coding techniques 1977 – Abraham Lempel and Jacob Ziv develop Lempel–Ziv compression (LZ77) 1989 – Phil Katz publishes the .zip format including DEFLATE (LZ77 + Huffman coding); later to become the most widely used archive container 1993 – Claude Berrou, Alain Glavieux and Punya Thitimajshima introduce Turbo codes 1994 – Michael Burrows and David Wheeler publish the Burrows–Wheeler transform, later to find use in bzip2 1995 – Benjamin Schumacher coins the term qubit and proves the quantum noiseless coding theorem 2003 – David J. C. MacKay shows the connection between information theory, inference and machine learning in his book. 2006 – first Asymmetric numeral systems entropy coding: since 2014 popular replacement of Huffman and arithmetic coding in compressors like Facebook Zstandard, Apple LZFSE, CRAM or JPEG XL 2008 – Erdal Arıkan introduces polar codes, the first practical construction of