This article was accepted into the corpus but its outbound wikilinks were never NER-processed — typical at the deepest BFS hop or when the run's entity cap was reached. No expansion funnel to show.
| Symposium on Information Theory | |
|---|---|
| Name | Symposium on Information Theory |
| Abbreviation | SIT |
| Discipline | Information theory |
| Established | 1950s |
| Frequency | biennial / annual |
| Venue | international |
| Organizer | Institute of Electrical and Electronics Engineers, other regional societies |
Symposium on Information Theory The Symposium on Information Theory is an international conference series focusing on Claude Shannon, Robert Fano, Norbert Wiener, David Slepian, and Thomas M. Cover-era topics in Bell Labs, IEEE, AIMS contexts, drawing participants from MIT, Stanford University, Harvard University, Princeton University and University of Cambridge. It brings together researchers from Bell Labs Research, AT&T, Nokia Bell Labs, IBM Research, Microsoft Research and Google Research alongside representatives of National Science Foundation, DARPA, European Research Council and Royal Society. The symposium has featured work connected to Shannon–Hartley theorem, Huffman coding, Reed–Solomon codes, Claude Shannon Award and IEEE Information Theory Society initiatives.
The origins trace to post‑war developments influenced by Claude Shannon, Norbert Wiener, Harry Nyquist, Ralph Hartley and Alan Turing and early forums at Bell Labs, Institute of Radio Engineers and Massachusetts Institute of Technology where pioneers from Princeton University, Cornell University, Columbia University, University of California, Berkeley and University of Illinois Urbana‑Champaign met. Early symposia in the 1950s and 1960s featured figures from John von Neumann circles, Richard Hamming, David G. Luenberger and Robert Fano and were influenced by results such as the Noisy-channel coding theorem and Shannon limit. Through the 1970s and 1980s the event expanded with contributions from Ilya Prigogine-era theorists and engineering groups at Bell Labs Research, AT&T Bell Laboratories and Hewlett-Packard, and later integrated cybersecurity and compression themes from RSA Conference, IETF and ACM SIGCOMM communities. The 1990s and 2000s saw cross‑pollination with Claude Shannon Award recipients, Thomas M. Cover collaborators, and European hubs like École Polytechnique, ETH Zurich and Technical University of Munich.
Sessions cover topics rooted in work by Claude Shannon, Solomon Golomb, Richard Hamming, Jack Keil Wolf, Andrew Viterbi and Elias Peter. Core themes include channel coding inspired by Reed–Solomon codes, Turbo codes, Low-density parity-check codes and Polar codes developed by groups at University of Waterloo, University of Cambridge, Tsinghua University and KTH Royal Institute of Technology. Information measures trace to Kullback–Leibler divergence, Fisher information, Shannon entropy and extensions used by researchers at Stanford University, University of California, Los Angeles, Yale University and Columbia University. Cryptography and secrecy link to Diffie–Hellman key exchange, RSA (cryptosystem), Wyner wiretap channel and work from Cambridge University, ETH Zurich and Princeton University. Other topics include network information theory following Ahlswede network coding, rate‑distortion theory connected to Berger–Tung bounds, and machine learning interfaces influenced by Geoffrey Hinton, Yoshua Bengio, Yann LeCun and institutions like OpenAI and DeepMind.
The symposium is organized by the IEEE Information Theory Society, regional sections such as IEEE Communications Society, national bodies like Institute of Electrical and Electronics Engineers chapters, and academic hosts from University of Cambridge, Massachusetts Institute of Technology, University of Oxford, National University of Singapore and University of Tokyo. Typical events include plenary talks by Claude Shannon Award winners, invited tutorials from IEEE Fellows, contributed sessions from groups at Google Research, Microsoft Research, IBM Research and poster sessions featuring students from Stanford University, Carnegie Mellon University, University of California, Berkeley and University of Illinois. Proceedings are often published under IEEE Xplore or hosted in partnership with ACM Digital Library and coordinated through conference committees chaired by scholars affiliated with Princeton University, Columbia University and ETH Zurich.
Historically notable talks have presented milestones such as rigorous proofs related to the Noisy-channel coding theorem, breakthroughs on Turbo codes and LDPC codes by researchers from France Télécom, Nokia Bell Labs and École Polytechnique, the introduction of Polar codes from Ecole Polytechnique Federale de Lausanne and capacity results in network coding from teams at University of Texas at Austin, MIT, Caltech and Georgia Institute of Technology. Seminal presentations often reference algorithms by Richard Hamming, bounds from Shannon, computational frameworks by John von Neumann and modern contributions linking Yoshua Bengio and Geoffrey Hinton-style learning to coding theory. Results integrating Fano's inequality, Slepian–Wolf coding, Wyner–Ziv problem and Ahlswede–Körner lemma have been widely discussed with contributors from Princeton University, Harvard University, University of Cambridge and Cornell University.
Work showcased influenced technologies at Bell Labs Research, AT&T, Nokia, Samsung Electronics, Qualcomm and Intel Corporation in areas such as wireless standards driven by 3GPP, IEEE 802.11, LTE and 5G NR. The symposium’s theoretical advances shaped error‑correcting systems used in Deep Space Network, European Space Agency missions, NASA probes and CERN data links, and enabled compression standards like JPEG, MPEG, H.264 and H.265 adopted by Sony, Panasonic and Philips. Cross-disciplinary influence appears in genomics pipelines used at Broad Institute, Wellcome Sanger Institute and Cold Spring Harbor Laboratory, and in finance algorithms used by firms in Wall Street and research labs at NYSE, NASDAQ-affiliated centers.
Prominent recognitions presented at the symposium include the Claude Shannon Award, IEEE Richard Hamming Medal, Marconi Prize mentions, and fellowships from IEEE Information Theory Society and Royal Society. Awardees often hail from Bell Labs, Princeton University, Stanford University, University of Cambridge and ETH Zurich and receive additional honors such as the Turing Award, National Medal of Science, Wolf Prize in Physics and election to National Academy of Sciences.
The symposium collaborates with organizations including the IEEE Information Theory Society, IEEE Communications Society, ACM SIGCOMM, International Federation for Information Processing, European Association for Theoretical Computer Science, American Mathematical Society, Society for Industrial and Applied Mathematics, Royal Society, National Science Foundation and regional bodies like IEEE UK and Ireland Section, IEEE Japan Council and IEEE China Council. Joint workshops and special sessions are co‑organized with IETF, RSA Conference, NeurIPS, ICML, CVPR, ICASSP and Allerton Conference on Communication, Control, and Computing.