IEEE Information Theory Society Newsletter

Total Page:16

File Type:pdf, Size:1020Kb

IEEE Information Theory Society Newsletter IEEE Information Theory Society Newsletter Vol. 53, No.4, December 2003 Editor: Lance C. Pérez ISSN 1059-2362 The Shannon Lecture Hidden Markov Models and the Baum-Welch Algorithm Lloyd R. Welch Content of This Talk what the ‘running variable’ is. The lectures of previous Shannon Lecturers fall into several Of particular use will be the concept of conditional probabil- categories such as introducing new areas of research, resusci- ity and recursive factorization. The recursive factorization tating areas of research, surveying areas identified with the idea says that the joint probability of a collection of events can lecturer, or reminiscing on the career of the lecturer. In this be expressed as a product of conditional probabilities, where talk I decided to restrict the subject to the Baum-Welch “algo- each is the probability of an event conditioned on all previous rithm” and some of the ideas that led to its development. events. For example, let A, B, and C be three events. Then I am sure that most of you are familiar with Markov chains Pr(A ∩ B ∩ C) = Pr(A)Pr(B | A)Pr(C | A ∩ B) and Markov processes. They are natural models for various communication channels in which channel conditions change Using the bracket notation, we can display the recursive fac- with time. In many cases it is not the state sequence of the torization of the joint probability distribution of a sequence of model which is observed but the effects of the process on a discrete random variables: signal. That is, the states are not observable but some func- tions, possibly random, of the states are observed. In some X( ) N= N = (X( ) = )· Pr [ k ]0 [xk]0 Pr 0 x0 cases it is easy to assign the values of the parameters to model N a channel. All that remains is to determine what probabilities X( )= | X( ) n−1 = n−1 Pr n xn [ k ]0 [xk]0 are desired and derive the necessary algorithms to compute n=0 them. Markov Chains and Hidden Markov In other cases, the choice of parameter values is only an esti- Chains mate and it is desired to find the “best” values. The usual cri- terion is maximum likelihood. That is: find the values of We will treat only Markov Chains which have finite state parameters which maximizes the probability of the observed spaces. The theory is more general, but to cover the more gen- data. This is the problem that the Baum-Welch computation eral case will only obscure the basic ideas. addresses. Let S be a finite set, the set of states. Let the number of ele- Preliminaries ments in S be M. It will be convenient to identify the ele- ments of S with the integers from 1 to M. Let N be the set of non-negative integers. Let’s introduce some useful notation to replace the usual n-tuple notations: Let {S(t) : t ∈ N } be a sequence of random variables with Pr(S(t) ∈ S) = 1 for all t ∈ N . That is, the values of S(t) are j confined to S. ≡ ( , + ,... , ) [ak]k=i ai ai 1 aj ( ) j ≡ ( ( ), ( + ),... , ( )) [a k ]k=i a i a i 1 a j Applying the above factorization to the joint distribution of the first N + 1 random variables gives: The ‘k =’ will be dropped from the subscript when it is clear continued on page 10 2 From the Editor Lance C. Pérez This issue of the IEEE Information Theory Society Newsletter high- Electronic submission, especially in lights Lloyd Welch's article “Hidden Markov Models and the ascii and Word formats, is encouraged. Baum-Welch Algorithm” based on his Shannon Lecture at the 2003 International Symposium on Information Theory. Once again sev- I may be reached at the following eral members of the IT community have received major awards address: including an Emmy! Please see the announcements on pages 4 and 5 of this issue for details. Lance C. Pérez Department of Electrical Engineering Please help make the Newsletter as interesting and informative as 209N Walter Scott Engineering Center possible by offering suggestions and contributing news. The dead- University of Nebraska-Lincoln lines for the 2004 issues of the newsletter are as follows: Lincoln, NE 68588-0511 Phone: (402)472-6258 Issue Deadline Fax: (402)472-4732 March 2004 January 15, 2004 Email: [email protected] June 2004 April 15, 2004 September 2004 July 15, 2004 December 2004 October 15, 2004 Sincerely, Lance C. Pérez IEEE Table of Contents Information Theory Society Newsletter Hidden Markov Models and the Baum-Welch Algorithm . .1 From the Editor . .2 IEEE Information Theory Society Newsletter (USPS 360-350) is published quarterly by the President’s Column . .3 Information Theory Society of the Institute of Call for Nominations for the 2004 IEEE Information Theory Society Paper Award . .4 Electrical and Electronics Engineers, Inc. Call for Nominations for the 2004 Joint Information Theory /Communications Society Headquarters: 3 Park Avenue, 17th Floor, Paper Award . .4 New York, NY 10016-5997. 2003 Paper Award Winners Announced . .4 Cost is $1.00 per member per year (included Emmy Award For Kees Immink . .5 in Society fee) for each member of the Information Theory Society. Printed in the Historians Column . .6 U.S.A. Periodicals postage paid at New York, NY and at additional mailing offices. Information Theorist Robert Gallager of MIT and Engineer-Entrepreneur Bob Metcalfe Selected For Prestigious Marconi International Fellowships . .7 Postmaster: Send address changes to IEEE Information Theory Society Newsletter, Golumb’s Puzzle Solutions . .8 IEEE, 445 Hoes Lane, Piscataway, NJ 08854. Gerard J. Foschini Named Bell Labs Fellows . .8 © 2003 IEEE. Information contained in this Golumb’s Puzzle . .9 newsletter may be copied without permis- sion provided that the copies are not made 2003 Fall Workshop on Information Theory & Communications . .14 or distributed for direct commercial advan- tage, and the title of the publication and its Board of Governors Meeting . .15 date appear. Conference Calendar . .24 IEEE Information Theory Society Newsletter December 2003 3 President’s Column Han Vinck In 2003, an IEEE research project measured mum price. Tutorials are well appreciat- membership satisfaction with each society ed and we will continue to have tutorials and the IEEE. A total of 478 IT members in future symposia. responded to the questionnaire. I want to thank the participants for their valuable Transactions: (1) Many respondents com- input. The figure below illustrates the main plain about the time between submission result for the question about IT Society and final publication in the transactions. (ITS) membership satisfaction and IEEE This problem was discussed in the June membership satisfaction. BoG meeting and in the September 2003 President’s column. We are currently test- The general conclusions are: (1) Most of the ing a web based editorial tool developed members are very to highly satisfied with by Publications Editor Kevin Quirk. The ITS membership; (2) The IT transactions are software is intended to simplify the elec- rated as extremely useful by a very high tronic submission, reviewing and tracking percentage of our members and, together of submitted manuscripts; (2) It has also with the newsletter, are the main reason for been suggested that the ITS consider joining the ITS; (3) Chapter activities and the introduction of a new "fast-track" publicity need improvement; and (4) The letters publication similar to the IEEE symposium (ISIT) and workshop (ITW) are IT Society President Han Vinck in front of Communications Letters for timely dis- considered to be of great interest by about Allerton House, location of the 41st Annual semination of research. This idea is a logi- 50% of our members. These outcomes are Allerton Conference. cal consequence of the previous complaint very stimulating for the volunteers work- and could be a point of attention for the ing for you in all kind of positions. Participants in the question- future; (3) The Transactions should be more reader friendly and naire also indicated how we could improve our service to the more survey and tutorial papers are requested. From the responses members. I will summarize and briefly comment on the reactions. I conclude that we have to improve the presentation of fundamen- tal results in order to achieve a broader audience. If we want to Conferences: Members suggested longer summaries (up to 4 attract young researchers to our work and promote information the- pages), which requires a CD/DVD version of the proceedings, ory, we need to present the work in an understandable way, which and the participation fee is considered to be high. Conference fees even includes small worked out examples. This is also of interest to will remain a discussion item for the BoG. We try to minimize the the authors! All together, our journals are highly ranked within and costs of our symposium, but we also want to include a banquet outside the IEEE. The Editorial Board members under the leader- for all, an award luncheon, a get-together party and nice coffee ship of Editor in Chief Paul Siegel deserve great respect for their breaks. In addition, for 30% of the participants we want a reduced dedication as Information Theory Society volunteers. student participation fee and about 50 participants from low- income countries need support. Last, but not least, perfect organ- Volunteers are the basis of our society. They keep the operational ization is expected. Obviously, these requirements lead to a mini- costs very low and create professional friendships. We need your input to maintain our high technical standards and the quality of our organized events. A point of concern is the chapter activity. The chapters act on a local level and are of direct importance to our mem- bers and students.
Recommended publications
  • Digital Communication Systems 2.2 Optimal Source Coding
    Digital Communication Systems EES 452 Asst. Prof. Dr. Prapun Suksompong [email protected] 2. Source Coding 2.2 Optimal Source Coding: Huffman Coding: Origin, Recipe, MATLAB Implementation 1 Examples of Prefix Codes Nonsingular Fixed-Length Code Shannon–Fano code Huffman Code 2 Prof. Robert Fano (1917-2016) Shannon Award (1976 ) Shannon–Fano Code Proposed in Shannon’s “A Mathematical Theory of Communication” in 1948 The method was attributed to Fano, who later published it as a technical report. Fano, R.M. (1949). “The transmission of information”. Technical Report No. 65. Cambridge (Mass.), USA: Research Laboratory of Electronics at MIT. Should not be confused with Shannon coding, the coding method used to prove Shannon's noiseless coding theorem, or with Shannon–Fano–Elias coding (also known as Elias coding), the precursor to arithmetic coding. 3 Claude E. Shannon Award Claude E. Shannon (1972) Elwyn R. Berlekamp (1993) Sergio Verdu (2007) David S. Slepian (1974) Aaron D. Wyner (1994) Robert M. Gray (2008) Robert M. Fano (1976) G. David Forney, Jr. (1995) Jorma Rissanen (2009) Peter Elias (1977) Imre Csiszár (1996) Te Sun Han (2010) Mark S. Pinsker (1978) Jacob Ziv (1997) Shlomo Shamai (Shitz) (2011) Jacob Wolfowitz (1979) Neil J. A. Sloane (1998) Abbas El Gamal (2012) W. Wesley Peterson (1981) Tadao Kasami (1999) Katalin Marton (2013) Irving S. Reed (1982) Thomas Kailath (2000) János Körner (2014) Robert G. Gallager (1983) Jack KeilWolf (2001) Arthur Robert Calderbank (2015) Solomon W. Golomb (1985) Toby Berger (2002) Alexander S. Holevo (2016) William L. Root (1986) Lloyd R. Welch (2003) David Tse (2017) James L.
    [Show full text]
  • Principles of Communications ECS 332
    Principles of Communications ECS 332 Asst. Prof. Dr. Prapun Suksompong (ผศ.ดร.ประพันธ ์ สขสมปองุ ) [email protected] 1. Intro to Communication Systems Office Hours: Check Google Calendar on the course website. Dr.Prapun’s Office: 6th floor of Sirindhralai building, 1 BKD 2 Remark 1 If the downloaded file crashed your device/browser, try another one posted on the course website: 3 Remark 2 There is also three more sections from the Appendices of the lecture notes: 4 Shannon's insight 5 “The fundamental problem of communication is that of reproducing at one point either exactly or approximately a message selected at another point.” Shannon, Claude. A Mathematical Theory Of Communication. (1948) 6 Shannon: Father of the Info. Age Documentary Co-produced by the Jacobs School, UCSD- TV, and the California Institute for Telecommunic ations and Information Technology 7 [http://www.uctv.tv/shows/Claude-Shannon-Father-of-the-Information-Age-6090] [http://www.youtube.com/watch?v=z2Whj_nL-x8] C. E. Shannon (1916-2001) Hello. I'm Claude Shannon a mathematician here at the Bell Telephone laboratories He didn't create the compact disc, the fax machine, digital wireless telephones Or mp3 files, but in 1948 Claude Shannon paved the way for all of them with the Basic theory underlying digital communications and storage he called it 8 information theory. C. E. Shannon (1916-2001) 9 https://www.youtube.com/watch?v=47ag2sXRDeU C. E. Shannon (1916-2001) One of the most influential minds of the 20th century yet when he died on February 24, 2001, Shannon was virtually unknown to the public at large 10 C.
    [Show full text]
  • Information Theory and Statistics: a Tutorial
    Foundations and Trends™ in Communications and Information Theory Volume 1 Issue 4, 2004 Editorial Board Editor-in-Chief: Sergio Verdú Department of Electrical Engineering Princeton University Princeton, New Jersey 08544, USA [email protected] Editors Venkat Anantharam (Berkeley) Amos Lapidoth (ETH Zurich) Ezio Biglieri (Torino) Bob McEliece (Caltech) Giuseppe Caire (Eurecom) Neri Merhav (Technion) Roger Cheng (Hong Kong) David Neuhoff (Michigan) K.C. Chen (Taipei) Alon Orlitsky (San Diego) Daniel Costello (NotreDame) Vincent Poor (Princeton) Thomas Cover (Stanford) Kannan Ramchandran (Berkeley) Anthony Ephremides (Maryland) Bixio Rimoldi (EPFL) Andrea Goldsmith (Stanford) Shlomo Shamai (Technion) Dave Forney (MIT) Amin Shokrollahi (EPFL) Georgios Giannakis (Minnesota) Gadiel Seroussi (HP-Palo Alto) Joachim Hagenauer (Munich) Wojciech Szpankowski (Purdue) Te Sun Han (Tokyo) Vahid Tarokh (Harvard) Babak Hassibi (Caltech) David Tse (Berkeley) Michael Honig (Northwestern) Ruediger Urbanke (EPFL) Johannes Huber (Erlangen) Steve Wicker (GeorgiaTech) Hideki Imai (Tokyo) Raymond Yeung (Hong Kong) Rodney Kennedy (Canberra) Bin Yu (Berkeley) Sanjeev Kulkarni (Princeton) Editorial Scope Foundations and Trends™ in Communications and Information Theory will publish survey and tutorial articles in the following topics: • Coded modulation • Multiuser detection • Coding theory and practice • Multiuser information theory • Communication complexity • Optical communication channels • Communication system design • Pattern recognition and learning • Cryptology
    [Show full text]
  • IEEE Information Theory Society Newsletter
    IEEE Information Theory Society Newsletter Vol. 63, No. 3, September 2013 Editor: Tara Javidi ISSN 1059-2362 Editorial committee: Ioannis Kontoyiannis, Giuseppe Caire, Meir Feder, Tracey Ho, Joerg Kliewer, Anand Sarwate, Andy Singer, and Sergio Verdú Annual Awards Announced The main annual awards of the • 2013 IEEE Jack Keil Wolf ISIT IEEE Information Theory Society Student Paper Awards were were announced at the 2013 ISIT selected and announced at in Istanbul this summer. the banquet of the Istanbul • The 2014 Claude E. Shannon Symposium. The winners were Award goes to János Körner. the following: He will give the Shannon Lecture at the 2014 ISIT in 1) Mohammad H. Yassaee, for Hawaii. the paper “A Technique for Deriving One-Shot Achiev - • The 2013 Claude E. Shannon ability Results in Network Award was given to Katalin János Körner Daniel Costello Information Theory”, co- Marton in Istanbul. Katalin authored with Mohammad presented her Shannon R. Aref and Amin A. Gohari Lecture on the Wednesday of the Symposium. If you wish to see her slides again or were unable to attend, a copy of 2) Mansoor I. Yousefi, for the paper “Integrable the slides have been posted on our Society website. Communication Channels and the Nonlinear Fourier Transform”, co-authored with Frank. R. Kschischang • The 2013 Aaron D. Wyner Distinguished Service Award goes to Daniel J. Costello. • Several members of our community became IEEE Fellows or received IEEE Medals, please see our web- • The 2013 IT Society Paper Award was given to Shrinivas site for more information: www.itsoc.org/honors Kudekar, Tom Richardson, and Rüdiger Urbanke for their paper “Threshold Saturation via Spatial Coupling: The Claude E.
    [Show full text]
  • Network Information Theory
    Network Information Theory This comprehensive treatment of network information theory and its applications pro- vides the first unified coverage of both classical and recent results. With an approach that balances the introduction of new models and new coding techniques, readers are guided through Shannon’s point-to-point information theory, single-hop networks, multihop networks, and extensions to distributed computing, secrecy, wireless communication, and networking. Elementary mathematical tools and techniques are used throughout, requiring only basic knowledge of probability, whilst unified proofs of coding theorems are based on a few simple lemmas, making the text accessible to newcomers. Key topics covered include successive cancellation and superposition coding, MIMO wireless com- munication, network coding, and cooperative relaying. Also covered are feedback and interactive communication, capacity approximations and scaling laws, and asynchronous and random access channels. This book is ideal for use in the classroom, for self-study, and as a reference for researchers and engineers in industry and academia. Abbas El Gamal is the Hitachi America Chaired Professor in the School of Engineering and the Director of the Information Systems Laboratory in the Department of Electri- cal Engineering at Stanford University. In the field of network information theory, he is best known for his seminal contributions to the relay, broadcast, and interference chan- nels; multiple description coding; coding for noisy networks; and energy-efficient packet scheduling and throughput–delay tradeoffs in wireless networks. He is a Fellow of IEEE and the winner of the 2012 Claude E. Shannon Award, the highest honor in the field of information theory. Young-Han Kim is an Assistant Professor in the Department of Electrical and Com- puter Engineering at the University of California, San Diego.
    [Show full text]
  • Andrew J. and Erna Viterbi Family Archives, 1905-20070335
    http://oac.cdlib.org/findaid/ark:/13030/kt7199r7h1 Online items available Finding Aid for the Andrew J. and Erna Viterbi Family Archives, 1905-20070335 A Guide to the Collection Finding aid prepared by Michael Hooks, Viterbi Family Archivist The Andrew and Erna Viterbi School of Engineering, University of Southern California (USC) First Edition USC Libraries Special Collections Doheny Memorial Library 206 3550 Trousdale Parkway Los Angeles, California, 90089-0189 213-740-5900 [email protected] 2008 University Archives of the University of Southern California Finding Aid for the Andrew J. and Erna 0335 1 Viterbi Family Archives, 1905-20070335 Title: Andrew J. and Erna Viterbi Family Archives Date (inclusive): 1905-2007 Collection number: 0335 creator: Viterbi, Erna Finci creator: Viterbi, Andrew J. Physical Description: 20.0 Linear feet47 document cases, 1 small box, 1 oversize box35000 digital objects Location: University Archives row A Contributing Institution: USC Libraries Special Collections Doheny Memorial Library 206 3550 Trousdale Parkway Los Angeles, California, 90089-0189 Language of Material: English Language of Material: The bulk of the materials are written in English, however other languages are represented as well. These additional languages include Chinese, French, German, Hebrew, Italian, and Japanese. Conditions Governing Access note There are materials within the archives that are marked confidential or proprietary, or that contain information that is obviously confidential. Examples of the latter include letters of references and recommendations for employment, promotions, and awards; nominations for awards and honors; resumes of colleagues of Dr. Viterbi; and grade reports of students in Dr. Viterbi's classes at the University of California, Los Angeles, and the University of California, San Diego.
    [Show full text]
  • IEEE Information Theory Society Newsletter
    IEEE Information Theory Society Newsletter Vol. 66, No. 3, September 2016 Editor: Michael Langberg ISSN 1059-2362 Editorial committee: Frank Kschischang, Giuseppe Caire, Meir Feder, Tracey Ho, Joerg Kliewer, Anand Sarwate, Andy Singer, Sergio Verdú, and Parham Noorzad President’s Column Alon Orlitsky ISIT in Barcelona was true joy. Like a Gaudi sion for our community along with extensive masterpiece, it was artfully planned and flaw- experience as board member, associate editor, lessly executed. Five captivating plenaries and a first-class researcher. Be-earlied con- covered the gamut from communication and gratulations, Madam President. coding to graphs and satisfiability, while Al- exander Holevo’s Shannon Lecture reviewed Other decisions and announcements con- the fascinating development of quantum cerned the society’s major awards, including channels from his early theoretical contribu- three Jack Wolf student paper awards and the tions to today’s near-practical innovations. James Massey Young Scholars Award that The remaining 620 talks were presented in 9 went to Andrea Montanari. Surprisingly, the parallel sessions and, extrapolating from those IT Paper Award was given to two papers, I attended, were all superb. Two records were “The Capacity Region of the Two-Receiver broken, with 888 participants this was the Gaussian Vector Broadcast Channel With Pri- largest ISIT outside the US, and at 540 Euro vate and Common Messages” by Yanlin Geng registration, the most economical in a decade. and Chandra Nair, and “Fundamental Limits of Caching” by Mohammad Maddah-Ali and Apropos records, and with the recent Rio Games, isn’t ISIT Urs Niesen. While Paper Awards were given to two related like the Olympics, except even better? As with the ultimate papers recently, not since 1972 were papers on different top- sports event, we convene to show our best results, further our ics jointly awarded.
    [Show full text]
  • Bog Candidate Bios
    From: "Steven W. McLaughlin" <[email protected]> Subject: BoG Candidate Bios Date: June 11, 2007 13:49:36 GMT+02:00 To: Bixio Rimoldi <bixio.rimoldi@epfl.ch> Cc: "Steven W. McLaughlin" <[email protected]>, Urbashi Mitra <[email protected]>, Giuseppe Caire <[email protected]>, Andrea Goldsmith <[email protected]>, Rob Calderbank <[email protected]>, Muriel Medard <[email protected]>, Dan Costello <[email protected]>, Sergio Servetto <[email protected]>, "John D. Anderson" <[email protected]>, Dave Forney <[email protected]>, Alex Grant <[email protected]>, Venu Veeravalli <[email protected]>, Hans- Andrea Loeliger <[email protected]>, Ryuji Kohno <[email protected]>, Richard Cox <[email protected]>, Shlomo Shamai <[email protected]>, Ezio Biglieri <[email protected]>, Frank Kschischang <[email protected]>, Vince Poor <[email protected]>, Elza Erkip <[email protected]>, David Tse <[email protected]>, Alon Orlitsky <[email protected]>, Adriaan van Wijngaarden <[email protected]>, João Barros <[email protected]>, Imai Hideki <[email protected]>, Tony Ephremides <[email protected]>, Tor Helleseth <[email protected]>, [email protected], Vinck Han <[email protected]>, Marc Fossorier <[email protected]>, Prakash Narayan <[email protected]>, Anant Sahai <[email protected]>, Laneman Nicholas J <[email protected]>, Ken Zeger <[email protected]>, Daniela Tuninetti <[email protected]>, Ralf Koetter <[email protected]>, Dave Neuhoff <[email protected]> Dear BoG members Below are the bios of those who have agreed to be candidates for the Board of Governors election this Fall.
    [Show full text]
  • IEEE Information Theory Society Newsletter
    IEEE Information Theory Society Newsletter Vol. 53, No. 1, March 2003 Editor: Lance C. Pérez ISSN 1059-2362 LIVING INFORMATION THEORY The 2002 Shannon Lecture by Toby Berger School of Electrical and Computer Engineering Cornell University, Ithaca, NY 14853 1 Meanings of the Title Information theory has ... perhaps The title, ”Living Information Theory,” is a triple enten- ballooned to an importance beyond dre. First and foremost, it pertains to the information its actual accomplishments. Our fel- theory of living systems. Second, it symbolizes the fact low scientists in many different that our research community has been living informa- fields, attracted by the fanfare and by tion theory for more than five decades, enthralled with the new avenues opened to scientific the beauty of the subject and intrigued by its many areas analysis, are using these ideas in ... of application and potential application. Lastly, it is in- biology, psychology, linguistics, fun- tended to connote that information theory is decidedly damental physics, economics, the theory of the orga- alive, despite sporadic protestations to the contrary. nization, ... Although this wave of popularity is Moreover, there is a thread that ties together all three of certainly pleasant and exciting for those of us work- these meanings for me. That thread is my strong belief ing in the field, it carries at the same time an element that one way in which information theorists, both new of danger. While we feel that information theory is in- and seasoned, can assure that their subject will remain deed a valuable tool in providing fundamental in- vitally alive deep into the future is to embrace enthusias- sights into the nature of communication problems tically its applications to the life sciences.
    [Show full text]
  • Universal Source Coding for Multiple Decoders with Side
    2010 IEEE International Symposium on Information Theory Proceedings (ISIT 2010) Austin, Texas, USA 13 – 18 June 2010 Pages 1-908 IEEE Catalog Number: CFP10SIF-PRT ISBN: 978-1-4244-7890-3 1/3 TABLE OF CONTENTS Plenary Sessions Monday 8:30 – 9:30 — Completely Random Measures for Bayesian Nonparametrics .........................................................................xlv Michael I. Jordan Tuesday 8:30 – 9:30 — Coding for Noisy Networks .................................................................................................................................xlv Abbas El Gamal Wednesday 8:30 – 9:30 — THE AUDACITY OF THROUGHPUT – A Trilogy of Rates – ........................................................................xlv Anthony Ephremides Thursday 8:30 – 9:30 — Musing upon Information Theory ......................................................................................................................xliv Te Sun Han Friday 8:30 – 9:30 — Can Structure Beat Shannon? — The Secrets of Lattice-codes ...............................................................................xlv Ram Zamir S-Mo-1: MULTI-TERMINAL SOURCE CODING S-Mo-1.1: UNIVERSAL SOURCE CODING FOR MULTIPLE DECODERS WITH SIDE ............................................................................... 1 INFORMATION Shigeaki Kuzuoka, Akisato Kimura, Tomohiko Uyematsu S-Mo-1.2: ROBUST MULTIRESOLUTION CODING WITH HAMMING DISTORTION ............................................................................ 6 MEASURE Jun Chen, Sorina Dumitrescu, Ying Zhang,
    [Show full text]
  • The Bell Labs Shannon Conference on the Future Of
    The Bell Labs Shannon Conference on the Future of the Information Age A two-day conference to celebrate Claude Shannon’s centennial and explore the continued impact of information theory on our society. Date: April 28-29, 2016 Location: Murray Hill, New Jersey Attendees: 250 leaders, visionaries and researchers from industry, academia and Bell Labs Celebrate the dawn of a new digital era We are at the dawn of a new digital era, where everyone and everything will be digitally connected and controllable, allowing an unprecedented level of automation and consequently the ability to ‘create time’. The extent of disruption to human existence local – physical economy. The magnitude of Bell Labs is celebrating the centennial of will be such that this will likely be viewed change will be comparable in the departure Shannon’s birthday — April 30th, 1916 as the 6th technological revolution of the from the past and impact on the future - to — by hosting a unique 2-day conference modern era. This revolution will profoundly the agricultural revolution 12 millennia ago focusing on a discussion of the future digital change the global techno-economic fabric, and the industrial revolution 2 centuries ago. information economy and the impact of massively shifting towards a new global- This revolution is rooted in the dawn of the information theory on society today and local paradigm, where any digital ‘good’ is Information Age, characterized by the shift in the digital future. This special event accessible, anywhere. from industrial activity to an information- celebrates Shannon’s life and influence based economy, based on emergence of and commemorates his profound impact Furthermore, with the emergence of ever digital computing and digital transmission with the creation of new Bell Labs Shannon more sophisticated 3D printing techniques, techniques, which were in turn based largely Visionary Awards presented at the event.
    [Show full text]
  • ITW2015 2015 IEEE Information Theory Workshop October 11~15, 2015 / Lotte City Hotel Jeju, Jeju Island, Korea
    IEEE Information Theory Society Newsletter Vol. 65, No. 1, March 2015 Editor: Tara Javidi ISSN 1059-2362 Editorial committee: Frank Kschischang, Giuseppe Caire, Meir Feder, Tracey Ho, Joerg Kliewer, Anand Sarwate, Andy Singer, and Sergio Verdú President’s Column Michelle Effros It is an honor and a privilege to take on the reaching out to other research communities, role of 2015 President of the Information working with the popular press, or develop- Theory Society. This community has been ing materials for children and their teachers, an intellectual home to me throughout my I believe that we should spend more time career, and I am grateful for the opportu- sharing the questions and results that inspire nity to serve. us with people who are not already similarly inspired. Every school child learns the name To me, the Information Theory Society is of Albert Einstein; his most famous equation characterized by the beauty of its questions has somehow entered the realm of popular and answers, the brilliance of its partici- culture. Why is it that so few people know the pants, the intellectual rigor and honesty of name or have heard about the contributions of its technical activities, and the warmth of Claude Elwood Shannon? Clearly the respec- its community. The society stands on solid tive fame of these two men is not a measure footing today because of the leaders who of the direct impact that each man’s results came before me. We are fiscally sound. Our have had on the substance of those school Transactions remain a model of excellence.
    [Show full text]