DOCSLIB.ORG

IEEE Information Theory Society Board of Governors Meeting

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
IEEE Information Theory Society Board of Governors Meeting itNL1206.qxd 11/7/06 8:58 AM Page 1 IEEE Information Theory Society Newsletter Vol. 56, No. 4, December 2006 Editor: Daniela Tuninetti ISSN 1059-2362 President’s Column David L. Neuhoff I would like to begin this column Finally, two areas of concern to information theorists were with a summary of the highlights of discussed. First, the apparently declining funding for infor- the September Board of Governors mation theory research in the US was discussed. It was decid- meeting at the Allerton Conference ed to form an ad hoc committee to examine the situation. on Communication, Control and Second, Sandeep Pradhan described the difficulty of obtain- Computing in Monticello, Illinois, ing classic information theory books that are now out of print. USA. As typically happens, recent The Board shares this concern and asked Sandeep to look for and forthcoming conferences and and propose possible solutions. workshops were reviewed. A pro- posal from Bill Ryan and Krishna By the time you read this, you should have seen the IEEE Narayanan to hold an IT Workshop membership renewal brochure for 2007, and I hope, renewed David L. Neuhoff in Lake Tahoe, California, USA, Sept. your IT membership. I also hope that you noticed the “IT 2-6, 2007 was approved. This joins Conference Digital Library” in the “What’s New for 2007”, as the June ISIT in Nice, France, and the July IT Workshop in well as the IT section of the brochure. This indicates that Bergen, Norway, as the principal IT sponsored meetings for online access to IT sponsored conference workshop proceed- 2007. One of the new features of ISIT 2007, approved by the ings will be available through IEEE Xplore as a basic compo- Board, is a Best Student Paper Award. If successful, this is nent of membership in the IT Society. As I mentioned in the likely to become a regular feature of future ISIT's. Prior to the September Newsletter, we received permission to offer this September BoG meeting, the Board approved technical for 2007 as a promotional trial. However, at this writing, I cosponsporship of the June 2007 Canadian Workshop on have just returned from an October IEEE meeting in Information Theory to be held in Edmonton, Alberta. Morristown, NJ, USA, in which permission was granted to extend this trial through 2009. The IT BoG views the inclu- The Board discussed and approved a proposal from the Ad sion of such online access as a way to increase the value of IT Hoc Committee on Conferences, constituted at the July BoG membership, as well as to stimulate the information theory meeting and chaired by Bruce Hajek, to form a standing field and to promote the Information Theory Transactions by Conference Committee. This new committee will recommend making the early announcements of new results, which first sponsorship of various conferences and workshops, provide appear in IT conference and workshop proceedings and are oversight thereof, maintain guidelines for such, monitor the published later in the Transactions, widely available in a time- conference pipeline, recommend policies for conferences, and ly fashion to all IT members. While we view this as a very provide advice and assistance to meeting organizers. positive step, it must be said that for IEEE central adminis- tration, this is an experiment with potentially negative, as Prompted by a call from IEEE, the Board discussed a number well as positive, outcomes.. Both IEEE and the IT Society of small Constitution and Bylaw changes, such as the defini- receive considerable revenue from conference proceedings, tion of a quorum at BoG meetings and the makeup of the principally through IEEE Xplore and sales to large organiza- Nominations Committee. A couple of changes were approved tions such as universities and corporations. For example the at this meeting; further changes will be considered in 2007. IT Society receives approximately $200K US annually. There is considerable concern that if many IEEE societies include Andrea Goldsmith reported on the activities of the Student online access to conference proceedings, this may decrease Committee which in the past year or so has held a number of the appetites of large organizations for purchasing access to well attended events at conferences and workshops. The conference proceedings, and substantially reduce current rev- Board is quite enthusiastic about these activities, and the Committee budget for the 2007 was increased to $10,000 US. continued on page 3 itNL1206.qxd 11/7/06 8:58 AM Page 2 2 From the Editor Daniela Tuninetti Dear IT society members, Nick Laneman, the online editor, and myself are also trying to set up an online version of the newsletter. We envision each The fall semester is almost over, as well as article to be individually accessible from the table of content. this calendar year, which also means that I Nick has done a wonderful job of atomizing the submission of have been serving as Editor for this newslet- reports for the BoG meetings. I would like to leverage this auto- ter for nearly a year … time really flies! It mated tool to encourage authors to submit their articles to the has been an extremely interesting and newsletter. For example, chairmen of IT Society-sponsored con- enriching year. I would like to thank my ferences could submit both their report to the BoG and a sum- predecessor Lance Perez, who still gives me mary for publication in the Newsletter through the web site. We precious advice on how to handle newslet- are open to suggestions, so please write to us with your ideas. ter-related matters, and our President Dave Neuhoff, who has always been available. Back to this last issue of 2006: I hope you will enjoy the column of our President David L. Neuhoff, as well as Anthony Ephremides’ Historian’s column, and Sol Golomb’s puzzle. For this first year, I am proud of having You will also find the announcement of the winners of the IT Society Awards, by our first two new columns on a regular basis: the vice president Bixio Rimoldi, interesting reflections on Network Coding by the winners of guest column for NSF program manager the 2005 IT Paper Award Ning Cai, Robert Li, and Raymond Yeung. In addition, there are Sirin Tekinai and the report on the initia- reports on the activities of the Hong Kong Chapter, on the recent workshop in honor of tives of the IT Society Student Committee. Robert Gallager’s 75th birthday, on the workshop in honor of Rolf Johannesson’s 60th birthday, and on the many initiatives on the IT Society Student Chapter. Don’t miss the For next year, I would like to have at least one report on the first ITA workshop in San Diego, and the interesting “Call for Problems” for technical article in each issue. In this respect, the second ITA workshop to be held in January 2007 in San Diego. Last but not the least, I will keep on soliciting reflections from the enjoy the minutes from the BoG meeting in Seattle by Mehul Motani. I would also like to winners of the IT Paper award and of the thank Mehul for his service to the society, and extend a warm welcome to the new socie- Joint ComSoc/IT Paper award. However, ty secretary Joao Barros. Finally, you will find interesting insider news from program everybody is invited to contact me to discuss manager Sirin Tekinay at the National Science Foundation, the calls for nominations for whether his/her idea is suitable for the the 2007 society awards, and the list of the this year new book by Raymond Yeung. newsletter. I would especially encouraged plenary speakers at conferences of general Finally, in the September 2006 article "Bin Yu Wins Guggenheim Fellowship" we mistaken- interest for the IT community, to submit a ly wrote "He was selected from ..." when we should have written "She was selected from summary of their lecture. I believe our socie- ty member will greatly appreciate this. continued on page 3 IEEE Table of Contents Information Theory President’s Column . .1 Society Newsletter From the Editor . .2 The Historian’s Column . .3 IT Society Announces 2006 Paper Award Winners . .4 IEEE Information Theory Society Newsletter Reflection on Linear Network Coding . .5 (USPS 360-350) is published quarterly by the Bob Gallager’s 75th Birthday Workshop . .8 Information Theory Society of the Institute of Operation Polar Bear: Workshop Held on the Occasion of Rolf Johannesson’s 60th Birthday . .10 Electrical and Electronics Engineers, Inc. Hong Kong Chapter at a Glance . .11 Headquarters: 3 Park Avenue, 17th Floor, Golomb’s Puzzle Column: The 3X+1 Problem . .11 New York, NY 10016-5997. The Information Theory and Applications Center and Workshop . .12 Call for Problems . .13 Cost is $1.00 per member per year (included Call for Nominations . .13 in Society fee) for each member of the Recent Activities of the Information Theory Society Student Committee . .14 Information Theory Society. Printed in the IEEE Information Theory Society Board of Governors Meeting . .16 U.S.A. Periodicals postage paid at New York, 2006 Kailath Lecture and Colloquia . .19 NY and at additional mailing offices. Workshop Report: Europe Meets Australia . .20 Golomb’s Puzzle Column: Some Quadratic Matrix Equations Solutions . .21 Postmaster: Send address changes to IEEE New Books . .22 Information Theory Society Newsletter, Workshop Report: 5th Asia-Europe (AEW5) Workshop on “Concepts in Information Theory” . .24 IEEE, 445 Hoes Lane, Piscataway, NJ 08854. Guest Column: From the National Science Foundation . .25 © 2006 IEEE. Information contained in this Job Vacancies . .27 newsletter may be copied without permission Call for Papers: Fifth International Workshop on Optimal Codes and Related Topics (OC 2007) .
Load more

Recommended publications
  • Solving 8 × 8 Domineering
    Theoretical Computer Science 230 (2000) 195–206 www.elsevier.com/locate/tcs View metadata, citation and similar papers at core.ac.uk brought to you by CORE Mathematical Games provided by Elsevier - Publisher Connector Solving 8 × 8 Domineering D.M. Breuker, J.W.H.M. Uiterwijk ∗, H.J. van den Herik Department of Computer Science, MATRIKS Research Institute, Universiteit Maastricht, P.O. Box 616, 6200 MD Maastricht, Netherlands Received May 1998; revised October 1998 Communicated by A.S. Fraenkel Abstract So far the game of Domineering has mainly been investigated by combinatorial-games re- searchers. Yet, it is a genuine two-player zero-sum game with perfect information, of which the general formulation is a topic of AI research. In that domain, many techniques have been developed for two-person games, especially for chess. In this article we show that one such technique, i.e., transposition tables, is ÿt for solving standard Domineering (i.e., on an 8×8 board). The game turns out to be a win for the player ÿrst to move. This result coincides with a result obtained independently by Morita Kazuro. Moreover, the technique of transposition tables is also applied to di erently sized m × n boards, m ranging from 2 to 8, and n from m to 9. The results are given in tabular form. Finally, some conclusions on replacement schemes are drawn. In an appendix an analysis of four tournament games is provided. c 2000 Published by Elsevier Science B.V. All rights reserved. Keywords: Domineering; Solving games; Transposition tables; Replacement schemes 1. Introduction Domineering is a two-player zero-sum game with perfect information.
    [Show full text]
  • By Glenn A. Emelko
    A NEW ALGORITHM FOR EFFICIENT SOFTWARE IMPLEMENTATION OF REED-SOLOMON ENCODERS FOR WIRELESS SENSOR NETWORKS by Glenn A. Emelko Submitted to the Office of Graduate Studies at Case Western Reserve University in partial fulfillment of the requirements for the degree of DOCTOR OF PHILOSOPHY in ELECTRICAL ENGINEERING Department of Electrical Engineering and Computer Science Case Western Reserve University Glennan 321, 10900 Euclid Ave. Cleveland, Ohio 44106 May 2009 CASE WESTERN RESERVE UNIVERSITY SCHOOL OF GRADUATE STUDIES We hereby approve the thesis/dissertation of _Glenn A. Emelko____________________________________ candidate for the _Doctor of Philosophy_ degree *. (signed)_Francis L. Merat______________________________ (chair of the committee) _Wyatt S. Newman______________________________ _H. Andy Podgurski_____________________________ _William L. Schultz______________________________ _David A. Singer________________________________ ________________________________________________ (date) _March 2, 2009__________ * We also certify that written approval has been obtained for any proprietary material contained therein. i Dedication For my loving wife Liz, and for my children Tom and Leigh Anne. I thank you for giving me love and support and for believing in me every step along my journey. ii Table of Contents Dedication........................................................................................................................... ii List of Figures......................................................................................................................4
    [Show full text]
  • Claude Elwood Shannon (1916–2001) Solomon W
    Claude Elwood Shannon (1916–2001) Solomon W. Golomb, Elwyn Berlekamp, Thomas M. Cover, Robert G. Gallager, James L. Massey, and Andrew J. Viterbi Solomon W. Golomb Done in complete isolation from the community of population geneticists, this work went unpublished While his incredibly inventive mind enriched until it appeared in 1993 in Shannon’s Collected many fields, Claude Shannon’s enduring fame will Papers [5], by which time its results were known surely rest on his 1948 work “A mathematical independently and genetics had become a very theory of communication” [7] and the ongoing rev- different subject. After his Ph.D. thesis Shannon olution in information technology it engendered. wrote nothing further about genetics, and he Shannon, born April 30, 1916, in Petoskey, Michi- expressed skepticism about attempts to expand gan, obtained bachelor’s degrees in both mathe- the domain of information theory beyond the matics and electrical engineering at the University communications area for which he created it. of Michigan in 1936. He then went to M.I.T., and Starting in 1938 Shannon worked at M.I.T. with after spending the summer of 1937 at Bell Tele- Vannevar Bush’s “differential analyzer”, the an- phone Laboratories, he wrote one of the greatest cestral analog computer. After another summer master’s theses ever, published in 1938 as “A sym- (1940) at Bell Labs, he spent the academic year bolic analysis of relay and switching circuits” [8], 1940–41 working under the famous mathemati- in which he showed that the symbolic logic of cian Hermann Weyl at the Institute for Advanced George Boole’s nineteenth century Laws of Thought Study in Princeton, where he also began thinking provided the perfect mathematical model for about recasting communications on a proper switching theory (and indeed for the subsequent mathematical foundation.
    [Show full text]
  • 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]
  • Marconi Society - Wikipedia
    9/23/2019 Marconi Society - Wikipedia Marconi Society The Guglielmo Marconi International Fellowship Foundation, briefly called Marconi Foundation and currently known as The Marconi Society, was established by Gioia Marconi Braga in 1974[1] to commemorate the centennial of the birth (April 24, 1874) of her father Guglielmo Marconi. The Marconi International Fellowship Council was established to honor significant contributions in science and technology, awarding the Marconi Prize and an annual $100,000 grant to a living scientist who has made advances in communication technology that benefits mankind. The Marconi Fellows are Sir Eric A. Ash (1984), Paul Baran (1991), Sir Tim Berners-Lee (2002), Claude Berrou (2005), Sergey Brin (2004), Francesco Carassa (1983), Vinton G. Cerf (1998), Andrew Chraplyvy (2009), Colin Cherry (1978), John Cioffi (2006), Arthur C. Clarke (1982), Martin Cooper (2013), Whitfield Diffie (2000), Federico Faggin (1988), James Flanagan (1992), David Forney, Jr. (1997), Robert G. Gallager (2003), Robert N. Hall (1989), Izuo Hayashi (1993), Martin Hellman (2000), Hiroshi Inose (1976), Irwin M. Jacobs (2011), Robert E. Kahn (1994) Sir Charles Kao (1985), James R. Killian (1975), Leonard Kleinrock (1986), Herwig Kogelnik (2001), Robert W. Lucky (1987), James L. Massey (1999), Robert Metcalfe (2003), Lawrence Page (2004), Yash Pal (1980), Seymour Papert (1981), Arogyaswami Paulraj (2014), David N. Payne (2008), John R. Pierce (1979), Ronald L. Rivest (2007), Arthur L. Schawlow (1977), Allan Snyder (2001), Robert Tkach (2009), Gottfried Ungerboeck (1996), Andrew Viterbi (1990), Jack Keil Wolf (2011), Jacob Ziv (1995). In 2015, the prize went to Peter T. Kirstein for bringing the internet to Europe. Since 2008, Marconi has also issued the Paul Baran Marconi Society Young Scholar Awards.
    [Show full text]
  • Hexaflexagons, Probability Paradoxes, and the Tower of Hanoi
    HEXAFLEXAGONS, PROBABILITY PARADOXES, AND THE TOWER OF HANOI For 25 of his 90 years, Martin Gard- ner wrote “Mathematical Games and Recreations,” a monthly column for Scientific American magazine. These columns have inspired hundreds of thousands of readers to delve more deeply into the large world of math- ematics. He has also made signifi- cant contributions to magic, philos- ophy, debunking pseudoscience, and children’s literature. He has produced more than 60 books, including many best sellers, most of which are still in print. His Annotated Alice has sold more than a million copies. He continues to write a regular column for the Skeptical Inquirer magazine. (The photograph is of the author at the time of the first edition.) THE NEW MARTIN GARDNER MATHEMATICAL LIBRARY Editorial Board Donald J. Albers, Menlo College Gerald L. Alexanderson, Santa Clara University John H. Conway, F.R. S., Princeton University Richard K. Guy, University of Calgary Harold R. Jacobs Donald E. Knuth, Stanford University Peter L. Renz From 1957 through 1986 Martin Gardner wrote the “Mathematical Games” columns for Scientific American that are the basis for these books. Scientific American editor Dennis Flanagan noted that this column contributed substantially to the success of the magazine. The exchanges between Martin Gardner and his readers gave life to these columns and books. These exchanges have continued and the impact of the columns and books has grown. These new editions give Martin Gardner the chance to bring readers up to date on newer twists on old puzzles and games, on new explanations and proofs, and on links to recent developments and discoveries.
    [Show full text]
  • IEEE Information Theory Society Newsletter
    IEEE Information Theory Society Newsletter Vol. 59, No. 3, September 2009 Editor: Tracey Ho ISSN 1059-2362 Optimal Estimation XXX Shannon lecture, presented in 2009 in Seoul, South Korea (extended abstract) J. Rissanen 1 Prologue 2 Modeling Problem The fi rst quest for optimal estimation by Fisher, [2], Cramer, The modeling problem begins with a set of observed data 5 5 5 c 6 Rao and others, [1], dates back to over half a century and has Y yt:t 1, 2, , n , often together with other so-called 5 51 c26 changed remarkably little. The covariance of the estimated pa- explanatory data Y, X yt, x1,t, x2,t, . The objective is rameters was taken as the quality measure of estimators, for to learn properties in Y expressed by a set of distributions which the main result, the Cramer-Rao inequality, sets a lower as models bound. It is reached by the maximum likelihood (ML) estima- 5 1 u 26 tor for a restricted subclass of models and asymptotically for f Y|Xs; , s . a wider class. The covariance, which is just one property of u5u c u models, is too weak a measure to permit extension to estima- Here s is a structure parameter and 1, , k1s2 real- valued tion of the number of parameters, which is handled by various parameters, whose number depends on the structure. The ad hoc criteria too numerous to list here. structure is simply a subset of the models. Typically it is used to indicate the most important variables in X. (The traditional Soon after I had studied Shannon’s formal defi nition of in- name for the set of models is ‘likelihood function’ although no formation in random variables and his other remarkable per- such concept exists in probability theory.) formance bounds for communication, [4], I wanted to apply them to other fi elds – in particular to estimation and statis- The most important problem is the selection of the model tics in general.
    [Show full text]
  • 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.
    [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]
  • 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]
  • Combinatorial Game Theory
    Combinatorial Game Theory Aaron N. Siegel Graduate Studies MR1EXLIQEXMGW Volume 146 %QIVMGER1EXLIQEXMGEP7SGMIX] Combinatorial Game Theory https://doi.org/10.1090//gsm/146 Combinatorial Game Theory Aaron N. Siegel Graduate Studies in Mathematics Volume 146 American Mathematical Society Providence, Rhode Island EDITORIAL COMMITTEE David Cox (Chair) Daniel S. Freed Rafe Mazzeo Gigliola Staffilani 2010 Mathematics Subject Classification. Primary 91A46. For additional information and updates on this book, visit www.ams.org/bookpages/gsm-146 Library of Congress Cataloging-in-Publication Data Siegel, Aaron N., 1977– Combinatorial game theory / Aaron N. Siegel. pages cm. — (Graduate studies in mathematics ; volume 146) Includes bibliographical references and index. ISBN 978-0-8218-5190-6 (alk. paper) 1. Game theory. 2. Combinatorial analysis. I. Title. QA269.S5735 2013 519.3—dc23 2012043675 Copying and reprinting. Individual readers of this publication, and nonprofit libraries acting for them, are permitted to make fair use of the material, such as to copy a chapter for use in teaching or research. Permission is granted to quote brief passages from this publication in reviews, provided the customary acknowledgment of the source is given. Republication, systematic copying, or multiple reproduction of any material in this publication is permitted only under license from the American Mathematical Society. Requests for such permission should be addressed to the Acquisitions Department, American Mathematical Society, 201 Charles Street, Providence, Rhode Island 02904-2294 USA. Requests can also be made by e-mail to [email protected]. c 2013 by the American Mathematical Society. All rights reserved. The American Mathematical Society retains all rights except those granted to the United States Government.
    [Show full text]