June 25 - June 30, 2017, Aachen, Germany

2017 IEEE International Symposium on Information TheoryAachen, Germany | June 25 - 30, 2017

2017 www.isit2017.org

© Peter Winandy

Program

2

ISIT 2017

Organization

General Co-ChairsRudolf Mathar

Gerhard Kramer

Publications ChairsGiuseppe DurisiChristoph Studer

Student Travel GrantsBernhard Geiger

TPC Co-ChairsMartin Bossert

Stephan ten BrinkStephen HanlySennur Ulukus

Tutorial ChairsEduard Jorswieck

Jörg Kliewer

EDAS AdministrationGholamreza Alirezaei

Giuseppe Durisi

Finance ChairMeik Dörpinghaus

Recent Results ChairAnke Schmeink

Local ArrangementsChristine CoxNiklas Koep

Markus Rothe

Technical Program CommitteeSalman Avestimehr, Sasha Barg, Andrew R. Barron, Gerhard Bauch, Matthieu Bloch, Holger Boche, Georg Böcherer, Helmut Bölcskei, Fredrik Brännström, Viveck Cadambe, Giuseppe Caire, Thomas Courtade, Mar-co Dalai, Nathasha Devroye, Suhas Diggavi, Alex Dimakis, Dariush Divsalar, Stark Draper, Tolga Duman, Michelle Effros, Abbas El Gamal, Salim El Rouayheb, Uri Erez, Elza Erkip, Meir Feder, Robert Fischer, Christina Fragouli, Michael Gastpar, Norbert Görtz, Pulkit Grover, Deniz Gündüz, Bruce Hajek, Tracey Ho, Camilla Hollanti, Tanya Ignatenko, Syed Jafar, Sid Jaggi, Tara Javidi, Thomas Johansson, Sarah Johnson, Eduard Jorswieck, Wei Kang, Kenta Kasai, Ashish Khisti, Young-Han Kim, Negar Kiyavash, Jörg Kliewer, Tobias Koch, Frank R. Kschischang, Volker Kühn, Vijay Kumar, Gitta Kutyniok, Amos Lapidoth, Gottfried Lechner, Michael Lentmaier, Yingbin Liang, Nan Liu, Gianluigi Liva, Angel Lozano, Arya Mazumdar, Muriel Médard, Olgica Milenkovic, Urbashi Mitra, Guido Montorsi, Stefan Moser, Mehul Motani, Pierre Moulin, Ralf Müller, Chandra Nair, Bobak Nazer, Lawrence Ong, Yasutada Oohama, Ayfer Özgür, Haim Permuter, Li Ping, H Vincent Poor, Maxim Raginsky, Lars Rasmussen, Stefano Rini, Anant Sahai, Lalitha Sankar, Anand Sarwate, Igal Sason, Jossy Sayir, Robert Schober, Christian Senger, Aydin Sezgin, Shlomo Shamai, Vladimir Sidorenko, Osvaldo Simeone, Mikael Skoglund, Changho Suh, Vincent Tan, Toshiyuki Tanaka, Ravi Tandon, Andrew Thangaraj, Antonia Tulino, Ertem Tuncel, Daniela Tuninetti, Himanshu Tyagi, Rüdiger Urbanke, Vinay Vaishampayan, Venu Veeravalli, Pramod Viswanath, Emanuele Viterbo, Aaron Wagner, Shun Watanabe, Tsachy Weissman, Rick Wesel, Michèle Wigger, Andreas Winter, Stefan Wolf, Gregory W. Wornell, Jing Yang, Roy Yates, Aylin Yener, Raymond Yeung, Wei Yu, Lizhong Zheng

Sponsors

3

June 25 - June 30, 2017, Aachen, Germany

Foyer

Stage

Info

Foyer

Board room

Cloakroom O3

Cloakroom O6

WC

K2

Berlin2

1

3

Brüssel

Stage

K6 K7+8

K1

K3 K4 K5 K9

MeetingRoom

Foyer

Brüssel

Europa

Gallery

Europa

Main Entrance

Open space

Passageway

Exhibition

GROUND FLOOR EUROGRESS

FIRST FLOOR EUROGRESS

EurogressHotel Quellenhof

HotelLobby

Amsterdam

4

ISIT 2017

Symposium RegistrationRegistration will open on Sunday at 8:00 and close at 18:00. Registration then opens every day at 7:30.

Optional Pre-Conference Tutorial Sessions - Sunday, June 25

Special Events

Sunday, June 25 K2 9:30 - 13:00

Codes for Distributed ComputingViveck Cadambe and Pulkit Grover

Sunday, June 25 K3 9:30 - 13:00

Information Limits on Finding and Hiding Message Sources on Networks: Social Media and CryptocurrenciesGiulia Fanti and Pramod Viswanath

Sunday, June 25 K3 14:00 - 17:30

Information Theoretic Cryptography for Information TheoristsHimanshu Tyagi and Shun Watanabe

Sunday, June 25 K2 14:00 - 17:30

Statistical Foundations of Interactive LearningKamalika Chaudhuri and Tara Javidi

Sunday, June 25 Foyer 18:00 - 21:00

Welcome Reception

Women in Information Theory (WITHITS) Speed Networking Event: Time to Ask the Burning Questions

Monday, June 26 K1 12:50 - 14:40

Mentoring OutreachMonday, June 26 Foyer 18:30 - 20:00

5

June 25 - June 30, 2017, Aachen, Germany

Fano MemorialTuesday, June 27 Brüssel hall 18:30 - 19:15

Award SessionWednesday, June 28 Europa hall 12:45 - 13:45

Thursday, June 29 Europa hall 19:30 - 23:00

Banquet

Student Activities

Thursday, June 29 K1 12:50 - 13:20

Student Lunch

Thursday, June 29 Brüssel hall 13:30 - 14:30

Interview with the Shannon Awardee

Wednesday, June 28 Brüssel hall 9:50 - 12:30

Jack Keil Wolf Student Paper Award: Candidate Talks

Multiplexing Zero-Error and Rare-Error Communications over a Noisy Channel with FeedbackTibor Keresztfalvi (ETH Zurich, Switzerland), Amos Lapidoth (ETHZ, Switzerland)

The Exact Rate-Memory Tradeoff for Caching with Uncoded PrefetchingQian Yu (University of Southern California, USA); Mohammad Ali Maddah-Ali (Bell Labs, Alcatel Lucent, USA); Salman Avestimehr (University of Southern California, USA)

Greedy-Merge Degrading has Optimal Power-LawAssaf Kartowsky and Ido Tal (Technion, Israel)

A Generic Transformation for Optimal Repair Bandwidth and Rebuilding Access in MDS CodesJie Li (Southwest Jiaotong University, P.R. China); Xiaohu Tang (SWJTU, P.R. China); Chao Tian (University of Tennessee Knoxville, USA)

A High-SNR Normal Approximation for Single-Antenna Rayleigh Block-Fading ChannelsAlejandro Lancho and Tobias Koch (Universidad Carlos III de Madrid & Gregorio Marañón Health Research Institute, Spain); Giuseppe Durisi (Chalmers University of Technology, Sweden)

A Tight Rate Bound and a Matching Construction for Locally Recoverable Codes with Sequential Recovery From Any Number of Multiple ErasuresBalaji Srinivasan Babu (IISc, India); Ganesh Kini (Indian Institute of Science, India); P Vijay Kumar (Indian Institute of Science & University of Southern California, India)

Feedback Capacity and Coding for the (0,k)-RLL Input-Constrained BECOri Peled, Oron Sabag and Haim H Permuter (Ben-Gurion University, Israel)

6

ISIT 2017

Social Program

Visit of the RWE power plant WeisweilerWednesday, June 28 Weisweiler 12:15

Please note, you need to register with EDAS for this event.A bus will leave from the Eurogress at the above mentioned time. The tour starts at 13:00 in Weisweiler.

Tour of the old townWednesday, June 28 Elisenbrunnen 14:30 - 16:00

Please note, you need to register with EDAS for this event.The historic old town of Aachen invites to go for a stroll. Let yourself be guided through narrow alleys and across historic squares through the 2000 year-old history of Aachen. Experience all facets of Aachen, a mo-dern city with beautiful historic town houses, many old and new fountains and innumerable stories all about the Cathedral and the ‚Rathaus‘ (town hall).

Tour of the RathausWednesday, June 28 Elisenbrunnen 14:30 - 16:00

Please note, you need to register with EDAS for this event.In the 14th century the ‚Rathaus‘ (town hall) of Aachen was built on the foundation walls of the Carolingian palace. The neo-Gothic outside appearance and the baroque inside of the building are a reflection of its eventful history. Let yourself be guided through a building, which today is the location for the famous Inter-national Charlemagne Prize and at the same time is the official residence of the Lord Mayor.

Combined tour old town and Centre CharlemagneWednesday, June 28 Elisenbrunnen 14:30 - 16:30

Please note, you need to register with EDAS for this event.The guided tour through the ‚Centre Charlemagne – Neues Stadtmuseum Aachen‘ (new city museum Aachen) and the old town offers the perfect possibility of getting to know the imperial city from the past to the present. In the Centre Charlemagne you will learn everything worth knowing about Aachen’s city history; starting with early settlements from the 5th millennium B.C. to the European city of the 20th and 21st cen-tury. During a subsequent guided tour of the old town you will experience everything close up and in addition learn interesting stories about Cathedral and the ‚Rathaus‘ (town hall).

Really true? – The lies tourWednesday, June 28 Elisenbrunnen 14:30 - 16:30

Please note, you need to register with EDAS for this event.Have a guess and get to know Aachen and its stories. Listen to the many anecdotes told on the way along Aachen’s sights. The tour guide will not always strictly keep to the truth; was the first chocolate actually invented in Aachen? And did the devil have a hand in the construction of the Aachen cathedral? Is the smell around the Elisenbrunnen really that of rotten egg? Really true? In a guessing competition with other partici-pants you decide with a green or red card, whether you believe or you don’t believe the curious stories told by our tour guide.

7

June 25 - June 30, 2017, Aachen, Germany

HopOn-HopOff-Bus tourWednesday, June 28 Elisenbrunnen, Bus Stop H2 15:30 - 17:30

Please note, you need to register with EDAS for this event.Explore Aachen on a city tour: With a double-decker bus you will be on a tour through Aachen to see the most important sights. At 15 stops you can take the „HopOn-HopOff-Ticket“ and stop again.

Organ Recital in the Aachen CathedralWednesday, June 28 Aachen Cathedral 17:00 - 17:45

Please note, you need to register with EDAS for this event.Enjoy a concert in an incomparable historical atmosphere, which will not be forgotten! We offer you an organ recital in the Aachen Cathedral (German: Aachener Dom), a Roman Catholic church. It is the oldest cathedral in northern Europe and was constructed by order of the emperor Charlemagne, who was buried there after his death in 814. In 1978, it was one of the first 12 items to make the entry into the UNESCO list of world heritage sites, as the first German and one of the first three European historical ensembles.

8

ISIT 2017

Claude E. Shannon Award LectureWednesday, June 28 Europa hall 8:30 - 9:30

The Spirit of Information TheoryDavid Tse, Stanford University, California, USA

BiographyDavid Tse received the B.A.Sc. degree in systems design engineering from University of Waterloo in 1989, and the M.S. and Ph.D. degrees in electrical engineering from Massa-chusetts Institute of Technology in 1991 and 1994 respectively. From 1994 to 1995, he was a postdoctoral member of technical staff at A.T. & T. Bell Laboratories. From 1995 to 2014,

he was on the faculty of the University of California at Berkeley. He is currently a professor at Stanford University.

David Tse is the recipient of the 2017 Claude E. Shannon Award. Previously, he received a NSF CAREER award in 1998, the Erlang Prize from the INFORMS Applied Probability Society in 2000 and a Gilbreth Lectureship from the National Academy of Engineering in 2012. He received multiple best paper awards, including the Information Theory Society Paper Award in 2003, the IEEE Communications Society and Information Theory Society Joint Paper Awards in 2000, 2013 and 2015, the Signal Processing Society Best Paper Award in 2012 and the IEEE Communications Society Stephen O. Rice Prize in 2013. For his contributions to education, he received the Outstanding Teaching Award from the Department of Electrical Engineering and Computer Sciences at U.C. Berkeley in 2008 and the Frederick Emmons Terman Award from the American Society for Engineering Education in 2009. He is a coauthor, with Pramod Viswanath, of the text Fundamentals of Wireless Communication, which has been used in over 60 institutions around the world. He is the inventor of the proportional-fair scheduling algorithm used in all third and fourth-generation cellular systems.

9

June 25 - June 30, 2017, Aachen, Germany

Plenary TalksMonday, June 26 Europa hall 8:45 - 9:45

Reading and Hiding Data in Quantum SystemsAndreas Winter, Universitat Autònoma de Barcelona, Spain

Quantum data hiding, originally invented as a limitation on so-called local operations and classical communications (LOCC) in distinguishing globally orthogonal states, is actually a phenomenon arising generically in statistics whenever comparing a `strong‘ set of measu-rements (i.e., decision rules) with a `weak‘ one. The classical statistical analogue is secret sharing, in which two perfectly distinguishable multi-partite hypotheses appear to be indis-

tinguishable when accessing only a marginal. The quantum versions are richer in that, e.g., LOCC allows for state tomography, so the states cannot become perfectly indistinguishable but only nearly so, and hence the question is one of efficiency. I will discuss two concrete examples and associated sets of problems.1. Gaussian operations and classical computation (GOCC): GOCC cannot distinguish optimally even two coherent states of a single mode (Takeoka/Sasaki, 2008). We find states, each a mixture of multi-mode coherent states, which are almost perfectly distinguishable by suitable measurements, but when restricted to GOCC, i.e., linear optics and post-processing, the states appear almost identical. The construction is ran-dom and relies on coding arguments. Open questions include whether one can give a constructive version of the argument, and whether even thermal states can be used, and how efficient the hiding is.2. Local operation and classical communication (LOCC): It is known that, asymptotically, log d bits can be hidden in a bipartite d x d-system (Hayden/Leung/Shor/Winter, 2004). We show that this is asymptotically optimal by using the calculus of min-entropies. In fact, we get bounds on the data hiding capacity of any pre-paration system; these are, however, not always tight. While it is known that data hiding by separable states is possible, i.e., the state preparation can be done by LOCC, it is open whether the optimal information efficiency of (asymptotically) log d bits can be achieved by separable states.

BiographyAndreas Winter received a Diploma degree in Mathematics from Freie Universität Berlin, Berlin, Germany, in 1997, and a Dr. math. degree from the Fakultät für Mathematik, Bielefeld University, Germany, in 1999. He was Research Associate at Bielefeld University, and from 2001 with the Department of Computer Science at University of Bristol, U.K. In 2003, still with University of Bristol, he was appointed Lecturer in Mathe-matics, and in 2006 Professor of Physics of Information. Since 2012 he is ICREA Research Professor with the Universitat Autònoma de Barcelona, Spain. He is the recipient of a Royal Society Wolfson Research Merit Award (2007), a Philip Leverhulme Prize (2009) and the Whitehead Prize of the London Mathematical Society (2012).Andreas Winter‘s scientific interests revolve around quantum information theory and discrete mathematics, in particular quantum Shannon theory. He is the originator of several technical and conceptual innovations in that field, among them the discovery of state merging as a primitive and the meaning of negative informa-tion; the application of geometric measure concentration in quantum information and statistical mechanics; the development of a matrix tail bound à la Bernstein with numerous applications in information theory, signal processing and combinatorics; techniques towards strong converses and „pretty strong“ converses in quantum Shannon theory; quantum entropy inequalities; and the development of zero-error quantum information theory, including an interpretation of the Lovász number as the zero-error capacity of a graph assisted by no-signalling correlations.

10

ISIT 2017

Tuesday, June 27 Europa hall 8:30 - 9:30

Biological Systems as Communication NetworksUrbashi Mitra, University of Southern California (USC), Los Angeles, USA

Significant progress has been made, of late, on fundamental problems across many areas of biology – in particular, biological interaction and signaling. Two important questions remain elusive. How do complex networks of simple organisms form in order to perform so-phisticated tasks? What are the underlying signaling mechanisms that enable the formation and operation of such networks? Concepts and methods from information theory and com-

munication theory offer some hope in providing abstractions and tools that can enable basic understanding of these two questions as well as determine fundamental limitations. The definition of communication in the biological context is vague and can be considered as „the transfer of information from one cell or molecule to another via chemical, mechanical, or electrical signals,“ or more broadly as „an activity by one organism that changes the behavior of another.“ Given the enormous diversity of organisms, there is an equally large number of communication systems that can be studied, and not all systems yield to a communication- or information-theoretic lens. To this end, we shall consider microbial ecosystems which contain a number of communication/information theoretic architectures. Microbial communities play a significant role in infection, bioremediation, plant growth promotion, human and animal digestion, the carbon cycle, cleaning water and microbial fuel cells. Two canonical multi-terminal structures are of importance: multi-hopped networks moti-vated by bacterial cables, and ad hoc multi-terminal networks as proxies for biofilms and quorum sensing. In this talk, we explore how a communication- and information-theoretic framework can be used to understand — and possibly design — biological systems.

BiographyUrbashi Mitra received the B.S. and the M.S. degrees from the University of California at Berkeley and her Ph.D. from Princeton University. She is currently a Dean’s Professor of Electrical Engineering at the Department of Electrical Engineering at the University of Southern California (USC), Los Angeles. She is the inaugural Editor-in-Chief for the IEEE Transactions on Molecular, Biological and Multi-scale Communi-cations. Dr. Mitra is a Distinguished Lecturer for the IEEE Communications Society for 2015-2017. She is a member of the IEEE Information Theory Society‘s Board of Governors (2002-2007, 2012-2017) and the IEEE Signal Processing Society’s Technical Committee on Signal Processing for Communications and Net-works (2012-2016). Dr. Mitra is a Fellow of the IEEE. She is the recipient of: a 2016 United Kingdom Royal Academy of Engineering, Distinguished Visiting Fellowship, a 2015 US Fulbright Scholar Award, a 2016-2017 Leverhulme Trust Visiting Professorship Fellowship, a 2015 Insight Magazine STEM Diversity Award, 2012 Globecom Signal Processing for Communications Symposium Best Paper Award, 2012 US National Academy of Engineering Lillian Gilbreth Lectureship, USC Center for Excellence in Research Fellowship (2010-2013), the 2009 DCOSS Applications and Systems Best Paper Award, Texas Instruments Visiting Professor (Fall 2002, Rice University), 2001 Okawa Foundation Award, 2000 OSU College of Engineering Lumley Award for Research, 1997 OSU College of Engineering MacQuigg Award for Teaching, and a 1996 National Science Foundation CAREER Award. She has been an Associate Editor for the following IEEE publications: Transactions on Signal Processing (2012--2015), Transactions on Information Theory (2007-2011), Journal of Oceanic Engineering (2006-2011), and Transactions on Communications (1996-2001). She has co-chaired: (technical program) 2014 IEEE International Symposium on Information Theory in Honolulu, HI, 2014 IEEE Information Theory Workshop in Hobart, Tasmania, IEEE 2012 International Con-ference on Signal Processing and Communications, Bangalore India, and the IEEE Communication Theory Symposium at ICC 2003 in Anchorage, AK; and was the general co-chair for the first ACM Workshop on Underwater Networks at Mobicom 2006, Los Angeles, CA. She served as co-Director of the Communication Sciences Institute at the University of Southern California from 2004-2007. Her research interests are in: wi-reless communications, communication and sensor networks, biological communication systems, detection and estimation and the interface of communication, sensing and control.

11

June 25 - June 30, 2017, Aachen, Germany

Thursday, June 29 Europa hall 8:30 - 9:30

The Flesh of Polar CodesEmre Telatar, École polytechnique fédérale de Lausanne, Switzerland

BiographyI. Emre Telatar received the B.Sc. degree in electrical engineering from the Middle East Technical University, Ankara, Turkey, in 1986. He received the S.M. and Ph.D. degrees in electrical engineering and computer science from the Massachusetts Institute of Techno-logy, Cambridge, in 1988 and 1992 respectively. In 1992, he joined the Communications

Analysis Research Department at AT&T Bell Laboratories (later Lucent Technologies), Murray Hill, NJ. He has been at the EPFL since 2000.Emre Telatar was the recipient of the IEEE Information Theory Society Paper Award in 2001. He was a program co-chair for the IEEE International Symposium on Information Theory in 2002, and associate editor for Shannon Theory for the IEEE Information Theory Transactions from 2001 to 2004. He was awarded the EPFL Agepoly teaching prize in 2005.Emre Telatar‘s research interests are in communication and information theories.

Friday, June 30 Europa hall 8:30 - 9:30

Information Theory Out of its BoxCédric Villani, University Claude Bernard, Lyon, France

Some examples of information theoretical tools doing great in various fields of mathematics - kinetic theory, mathematical physics, geometry.

BiographyCédric Villani‘s research interests are in kinetic theory (Boltzmann and Vlasov equations

and their variants), and optimal transport and its applications.Cédric Villani studied mathematics at École Normale Supérieure in Paris. In 1998, he defended his PhD on the mathematical theory of the Boltzmann equation. From 2000 to 2010, he was professor at École Normale Supérieure de Lyon, and now at the Université de Lyon. He occupied visiting professor positions in Atlanta, Berkeley and Princeton. Since 2009, he is the Director of Institut Henri Poincaré in Paris.He received several national and international prizes for his research, in particular the Fields Medal, awar-ded at the 2010 International Congress of Mathematicians in Hyderabad (India), by the President of India.He is a chief editor of the Journal of Functional Analysis, and editor of Inventiones Mathematicae. He participates actively in the administration of science, through the Institut Henri Poincaré, but also by sitting on a number of panels and committees, including the higher council of research and the strategic council of Paris, and the High Level Group of Scientific Advisors at the European Commission. Since 2010 he has been involved in fostering mathematics in Africa, through programs by the Next Einstein Initiative and the World Bank.He has been a member of the Paris Academy of Sciences since December 2013, and a member of the Pontifical Academy of Sciences (Roma, Italy) since 2016.

12

ISIT 2017

Recent ResultsWednesday, June 28 11:30 - 12:30 | Foyer

List of Recent Results Posters

Generalized Chernoff bound: Stochastic Processes, States on Quantum Spin Chains and BeyondYuri Campbell (Max Plank Institute for Mathematics in the Sciences, Leipzig, Germany)

5G Radio Design Enabling Ultra-Reliable and Low-Latency CommunicationShehzad Ali Ashraf, Gustav Wikström, Torsten Dudda, John Camilo Solano Arenas (Ericsson Research, Aachen, Germany)

From Uncoded Prefetching to Coded Prefetching in Coded CachingChao Tian and Kai Zhang (The University of Ten-nessee Knoxville, USA)

Repair of Multiple DescriptionsAnders Høst-Madsen (University of Hawaii, USA), Jungwoo Lee (Seoul National University, South Korea)

On Codes for Tandem and Palindromic Duplication ErrorsAndreas Lenz (Technische Universität München, Germany), Antonia Wachter-Zeh (Israel Institute of Technology), Eitan Yaakobi (Technion, Israel)

Transmit Signal Design Based on Correlation Matrices for MIMO Wiretap Channel with Discrete SignalingSina Rezaei Aghdam, Tolga M. Duman (Bilkent University, Ankara, Turkey)

Repair Duality in Storage SystemsKatina Kralevska, Danilo Gligoroski, Harald Øverby, Rune E. Jensen, and Per Simonsen (Norwegian University of Science and Technology, Norway)

Polar Codes Based on Multiplicative Repetition for High-Order ModulationsPeiyao Chen, Minzi Xu, Baoming Bai, Xiao Ma (Xidian University, China, Sun Yat-sen University, China)

Double Nearest-Neighbor Error Correcting Codes on Multidimensional Signal ConstellationsHiroyoshi Morita (The University of Electro-Commu-nications, Japan)

Cooperative Data Exchange: A Coalition Game PerspectiveAnoosheh Heidarzadeh and Alex Sprintson (Texas

A&M University, USA)

Three-Dimensional Golay Complementary Array PairsYing Li, Ming-Hung Weng (Yuan Ze University, Taiwan)

Info-Clustering AlgorithmsChung Chan (The Chinese University of Hong Kong)

Distributed Learning with Limited Communications: A Coreset FrameworkHusheng Li, Yawen Fan (University of Tennessee, Knoxville, USA)

The Role of Transmitter Cooperation in Linear Interference Networks with Block ErasuresYasemin Karacora, Tolunay Seyfi and Aly El Gamal (Purdue University, USA)

Moment Generating Functions for General MIMO Product ChannelsG. Alfano, G. Taricco (Politecnico di Torino, Italy)

Synchronization Strings: Codes for Insertions and Deletions Approaching the Singleton BoundBernhard Haeupler, Amirbehshad Shahrasbi (Car-negie Mellon University, USA)

Information-theoretic limits, algorithms, and expe-riments to validate Ultra-Resolution EEG in clinical and neuroscientific settingsPraveen Venkatesh (Carnegie Mellon University, USA)

Two-letter Capacity Formula for Channels with Memory and FeedbackChristos K. Kourtellaris, Ioannis Tzortzis and Cha-ralambos D. Charalambous (University of Cyprus)

Multi-Stream Opportunistic Network Decoupling With Virtual Full-Duplex OperationHuifa Lin, Won-Yong Shin, Bang Chul Jung (Dan-kook University, Republic of Korea, Chungnam National University, South Korea)

A Random Coding Analysis of Circular-Shift Linear Network CodingHanqi Tang, Qifu T. Sun, Zongpeng Li (University of Science and Technology, China, University of Calgary, Canada)

13

June 25 - June 30, 2017, Aachen, Germany

14

ISIT 2017

Monday, June 26 10:10-11:1010:10 10:30 10:50Mo1-1: Algebraic Coding Chair: Christian Senger EuropaConstructions of Partial MDS Codes over SmallFieldsEitan Yaakobi, Ryan Gabrys, Mario Blaum, PaulSiegel

Attaining Capacity with iterated (U|U+V) codesbased on AG codes and Koetter-Vardy soft de-codingJean-Pierre Tillich, Irene Márquez-Corbella

An Algebraic-Combinatorial Proof Technique forthe GM-MDS ConjectureAnoosheh Heidarzadeh, Alex Sprintson

Mo1-2: Convolutional Codes Chair: Michael Lentmaier BrusselsOn the Code Distance of a Woven Block CodeConstructionIgor Zhilin, Alexey Kreshchuk, Victor V. Zyablov

Generalized column distances for convolutionalcodesSara D. Cardell, Marcelo Firer, Diego Napp

A Unified Ensemble of Concatenated Convolu-tional CodesSaeedeh Moloudi, Michael Lentmaier, AlexandreGraell i Amat

Mo1-3: Multiple Access 1 Chair: Aydin Sezgin K2Cooperative Binning for Semi-deterministic Chan-nels with Non-causal State InformationIdo Gattegno, Haim Permuter, Shlomo (Shitz)Shamai, Ayfer Özgür

A New Achievable Rate Region for Multiple-Access Channel with StatesMohsen Heidari Khoozani, Farhad Shirani,Sandeep Pradhan

The Benefit of Encoder Cooperation in the Pres-ence of State InformationParham Noorzad, Michelle Effros, Michael Lang-berg

Mo1-4: Entropy 1 Chair: Holger Boche K3A lower bound on the differential entropy for log-concave random variables with applications torate-distortion theoryArnaud Marsiglietti, Victoria Kostina

H(X) vs. H(f(X))Ferdinando Cicalese, Luisa Gargano, Ugo Vac-caro

Concavity of Entropy Power: Equivalent Formula-tions and GeneralizationsThomas Courtade

Mo1-5: Optical Communications Chair: Frank Kschischang K4On Time-Bandwidth Product of Multi-SolitonPulsesAlexander Span, Vahid Aref, Henning Buelow,Stephan ten Brink

A Novel Demodulation Scheme for a Memory-less Optical Interference ChannelKamran Keykhosravi, Erik Agrell

Optical MISO IM/DD Channels: Optimality ofSpatial Repetition Codes among DC-offsetSTBCsYerzhan Sapenov, Anas Chaaban, ZouheirRezki, Mohamed-Slim Alouini

Mo1-6: Precoding Chair: Jinyuan Chen K5Beamforming Codebook Compensation forBeam Squint with Channel Capacity ConstraintMingming Cai, J. Nicholas Laneman, BertrandHochwald

Asymptotics of Nonlinear LSE Precoders withApplications to Transmit Antenna SelectionAli Bereyhi, Mohammad Ali Sedaghat, RalfMüller

MIMO IBC Beamforming with Combined ChannelEstimate and Covariance CSITWassim Tabikh, Dirk Slock, Yi Yuan-Wu

Mo1-7: Quantization Chair: Ioannis Kontoyiannis K6How to Quantize n Outputs of a Binary Symmet-ric Channel to n-1 Bits?Wasim Huleihel, Or Ordentlich

Information-Distilling QuantizersBobak Nazer, Or Ordentlich, Yury Polyanskiy

Mo1-8: Rate Distortion Theory 1 Chair: Shigeaki Kuzuoka K7+8Distortion bounds for source broadcasting andasymmetric data transmission with bandwidthexpansionShraga Bross, Hagai Zalach

Rate-Distortion Region of a Gray-Wyner Problemwith Side-InformationMeryem Benammar, Abdellatif Zaidi

A Multiple Description CEO Problem with Log-Loss DistortionGeorg Pichler, Pablo Piantanida, Gerald Matz

Mo1-9: Hypothesis Testing 1 Chair: Gregory Wornell K9Neyman-Pearson Test for Zero-Rate Multitermi-nal Hypothesis TestingShun Watanabe

Using data-compressors for statistical analysis ofproblems on homogeneity testing and classifica-tionBoris Ryabko, Andrey Guskov, Irina Selivanova

First- and Second-Order Hypothesis Testing forMixed Memoryless Sources with General MixtureTe Sun Han, Ryo Nomura

Mo1-A: Age of Information 1 Chair: Yin Sun Berlin 3Status updates through M/G/1/1 queues withHARQElie Najm, Roy Yates, Emina Soljanin

Information Freshness and Popularity in MobileCachingClement Kam, Sastry Kompella, Gam Nguyen,Jeffrey Wieselthier, Anthony Ephremides

Age-Optimal Constrained Cache UpdatingRoy Yates, Philippe Ciblat, Aylin Yener, MicheleWigger

Technical Program

15

June 25 - June 30, 2017, Aachen, Germany

Monday, June 26 11:30-12:5011:30 11:50 12:10 12:30Mo2-1: Coding Techniques 1 Chair: Jos Weber EuropaPIR schemes with small downloadcomplexity and low storage require-mentsSimon Blackburn, Tuvi Etzion,Maura Paterson

Nearly Optimal Constructions of PIRand Batch CodesHilal Asi, Eitan Yaakobi

Cyclone CodesChristian Schindelhauer, AndreasJakoby, Sven Köhler

Approaching Capacity Using Incre-mental Redundancy without Feed-backHaobo Wang, Sudarsan VasistaSrinivasan Ranganathan, RichardWesel

Mo2-2: Locally Repairable Codes 1 Chair: Iwan Duursma BrusselsRate Optimal Binary Linear LocallyRepairable Codes with Small Avail-abilitySwanand Kadhe, Robert Calder-bank

On Optimal Ternary Locally Re-pairable CodesJie Hao, Shutao Xia, Bin Chen

A Study on the Impact of Localityin the Decoding of Binary CyclicCodesNikhil Krishnan Muralee Krishnan,Bhagyashree Puranik, P Vijay Ku-mar, Itzhak Tamo, Alexander Barg

Locally Repairable Codes with theOptimum Average Information Local-ityMostafa Shahabinejad, Majid Khab-bazian, Masoud Ardakani

Mo2-3: Broadcast Channels 1 Chair: Chandra Nair K2Error Exponent of the Common-Message Broadcast Channel withVariable-Length FeedbackLan Truong, Vincent Tan

Exact Random Coding Exponentsand Universal Decoders for the De-graded Broadcast ChannelRan Averbuch, Neri Merhav

Feedback Halves the Dispersion forSome Two-User Broadcast Chan-nels with Common MessageKasper Trillingsgaard, Wei Yang,Giuseppe Durisi, Petar Popovski

A New Capacity-Approaching Proto-col for General 1-to-K BroadcastPacket Erasure Channels withACK/NACKChih-Hua Chang, Chih-Chun Wang

Mo2-4: Feedback Chair: Gerhard Kramer K3On the Capacity of Burst Noise-Erasure Channels With and WithoutFeedbackLin Song, Fady Alajaji, Tamas Lin-der

The ARMA(k) Gaussian FeedbackCapacityTao Liu, Guangyue Han

An Optimal Coding Scheme for theBIBO Channel with a No-Repeated-Ones Input ConstraintOron Sabag, Haim Permuter, NavinKashyap

Mo2-5: Reconstruction Chair: Urbashi Mitra K4Compressed Sensing with Prior In-formation via Maximizing CorrelationXu Zhang, Wei Cui, Yulong Liu

Low Dimensional Atomic Norm Rep-resentations in Line Spectral Estima-tionMaxime Ferreira Da Costa, Wei Dai

Analysis of Approximate Mes-sage Passing with a Class of Non-Separable DenoisersYanting Ma, Cynthia Rush, DrorBaron

Inexact Projected Gradients onUnions of SubspacesThomas Wiese, Lorenz Weiland,Wolfgang Utschick

Mo2-6: Complexity Chair: Pulkit Grover K5Analysis and Enhancements of aCognitive Based Complexity Mea-sureDilshan De Silva, Nuwan Kodagoda,Saluka Kodituwakku, Amalka J. Pini-diyaarachchi

Generic Cospark of a Matrix Can BeComputed in Polynomial TimeSichen Zhong, Yue Zhao

Enumeration of Boolean Functionsof Sensitivity Three and Inheritanceof NondegeneracyKazuyuki Amano

On the Complexity of EstimatingRenyi DivergencesMaciej Skorski

Mo2-7: ARQ Chair: Zouheir Rezki K6An Information Density Approach toAnalyzing and Optimizing Incremen-tal Redundancy with FeedbackHaobo Wang, Nathan Wong,Alexandar Baldauf, ChristopherBachelor, Sudarsan Vasista Srini-vasan Ranganathan, Dariush Di-vsalar, Richard Wesel

Outage Effective Capacity of Buffer-Aided Diamond Relay Systems Us-ing HARQ-IRDeli Qiao

Constraints for coded tunnelsacross long latency bottlenecks withARQ-based congestion controlUlrich Speidel, Sven Puchinger,Martin Bossert

Throughput of HARQ-IR with FiniteBlocklength Codes and QoS Con-straintsYi Li, M. Cenk Gursoy, Senem Veli-pasalar

Mo2-8: Quantum IT 1 Chair: Marco Dalai K7+8Polar Codes for Arbitrary Classical-Quantum Channels and Arbitrarycq-MACsRajai Nasser, Joseph Renes

Sphere-Packing Bound for Symmet-ric Classical-Quantum ChannelsHao-Chung Cheng, Min-Hsiu Hsieh,Marco Tomamichel

A meta-converse for private commu-nication over quantum channelsMark Wilde, Marco Tomamichel,Mario Berta

Moderate Deviations for Classical-Quantum ChannelsHao-Chung Cheng, Min-Hsiu Hsieh

Mo2-9: Source Coding 1 Chair: Lele Wang K9Entropy of Some General PlaneTreesZbigniew Golebiewski, Abram Mag-ner, Wojciech Szpankowski

On Optimality and Redundancy ofSide Information Version of SWLZAyush Jain, Rakesh Bansal

Two-Dimensional Source Coding byMeans of Subblock EnumerationTakahiro Ota, Hiroyoshi Morita

Mo2-A: Age of Information 2 Chair: Michele Wigger Berlin 3Timely Updates over an ErasureChannelRoy Yates, Elie Najm, Emina Sol-janin, Jing Zhong

Remote Estimation of the WienerProcess over a Channel with Ran-dom DelayYin Sun, Yury Polyanskiy, Elif Uysal-Biyikoglu

Age and Value of Information: Non-linear Age CaseAntzela Kosta, Nikolaos Pappas,Anthony Ephremides, Vangelis An-gelakis

Status Updates Over UnreliableMultiaccess ChannelsSanjit Kaul, Roy Yates

16

ISIT 2017

Monday, June 26 14:40-16:2014:40 15:00 15:20 15:40 16:00Mo3-1: Reed-Solomon Codes Chair: Alexander Vardy EuropaTwisted Reed-SolomonCodesPeter Beelen, SvenPuchinger, JohanRosenkilde

Iterative Soft-Decision De-coding of Reed-SolomonCodes of Prime LengthsShu Lin, Khaled Abdel-Ghaffar, Juane Li, KekeLiu

Optimal Repair Schemesfor Some Families of Full-Length Reed-SolomonCodesHoang Dau, OlgicaMilenkovic

Repairing Reed-SolomonCodes With Two ErasuresHoang Dau, Iwan Duursma,Han Mao Kiah, OlgicaMilenkovic

Decoding of InterleavedReed-Solomon Codes Us-ing Improved Power Decod-ingSven Puchinger, JohanRosenkilde

Mo3-2: LDPC Codes 1 Chair: Paul Siegel BrusselsAverage Spectra for Ensem-bles of LDPC Codes andApplicationsIrina Bocharova, BorisKudryashov, Vitaly Skachek,Yauhen Yakimenka

Time-invariant LDPC convo-lutional codesDimitris Achlioptas, HamedHassani, Wei Liu, RuedigerUrbanke

On LDPC Code Ensem-bles with Generalized Con-straintsYanfang Liu, Pablo M. Ol-mos, Tobias Koch

Non-Uniformly CoupledLDPC Codes: BetterThresholds, Smaller Rate-loss, and Less ComplexityLaurent Schmalen, VahidAref, Fanny Jardel

Reed-Solomon Based Non-binary Globally CoupledLDPC Codes: Correction ofRandom Errors and Burstsof ErasuresJuane Li, Keke Liu, Shu Lin,Khaled Abdel-Ghaffar

Mo3-3: Caching 1 Chair: Osvaldo Simeone K2Characterizing the Rate-Memory Tradeoff in CacheNetworks within a Factor of2Qian Yu, Mohammad AliMaddah-Ali, Salman Aves-timehr

A Computer-Aided Investi-gation on the FundamentalLimits of CachingChao Tian

Capacity Scaling of Wire-less Device-to-DeviceCaching Networks underthe Physical ModelAn Liu, Vincent Lau,Giuseppe Caire

Wireless Coded Caching: ATopological PerspectiveJingjing Zhang, Petros Elia

Multiplex Conductance andGossip Based InformationSpreading in Multiplex Net-worksYufan Huang, Huaiyu Dai

Mo3-4: Channel Capacity 1 Chair: Min Li K3Capacity of Discrete-TimeWiener Phase Noise Chan-nels to Within a ConstantGapLuca Barletta, Stefano Rini

Capacity Sensitivity in Ad-ditive Non-Gaussian NoiseChannelsMalcolm Egan, Samir Per-laza, Vyacheslav Kungurt-sev

Communicating under Tem-perature and Energy Har-vesting ConstraintsOmur Ozel, Sennur Ulukus,Pulkit Grover

On Additive Channels withGeneralized GaussianNoiseAlex Dytso, Ronit Bustin,H. Vincent Poor, Shlomo(Shitz) Shamai

The Capacity of InjectiveSemi-Deterministic Two-Way ChannelsAnas Chaaban, Lav Varsh-ney, Mohamed-Slim Alouini

Mo3-5: Detection and Estimation 1 Chair: Venugopal Veeravalli K4Sequential Estimationbased on Conditional CostGeorge Moustakides, TonyYaacoub, Yajun Mei

Fundamental limit of resolv-ing two point sources limitedby an arbitrary point spreadfunctionRonan Kerviche, SaikatGuha, Amit Ashok

Denoising Linear Modelswith Permuted DataAshwin Pananjady, MartinWainwright, Thomas Cour-tade

Signal Recovery from Unla-beled SamplesSaeid Haghighatshoar,Giuseppe Caire

Estimation of Sparsity viaSimple MeasurementsAbhishek Agarwal, LarkinFlodin, Arya Mazumdar

Mo3-6: Wireless Networks 1 Chair: Andrea Goldsmith K5On Optimal Link Schedulingwith Deadlines for Emptyinga Wireless NetworkQing He, Di Yuan, AnthonyEphremides

On the Coverage Probabilityof a Spatially CorrelatedNetworkChang-sik Choi, Jae OhWoo, Jeffrey Andrews

Efficiently Finding SimpleSchedules in Gaussian Half-Duplex Relay Line NetworksYahya Ezzeldin, MartinaCardone, Christina Fragouli,Daniela Tuninetti

Exact Speed and Trans-mission Cost in a SimpleOne-Dimensional WirelessDelay-Tolerant NetworkDimitrios Cheliotis, Ioan-nis Kontoyiannis, MichailLoulakis, Stavros Toumpis

Analysis of Breakdown Prob-ability of Wireless SensorNetworks with UnreliableRelay NodesTakayuki Nozaki, Taka-fumi Nakano, Tadashi Wa-dayama

Mo3-7: Communications 1 Chair: Nan Liu K6Optimal Frame Synchro-nization Over a Finite StateMarkov ChannelM Sundaram R, ArupDas, Devendra Jalihal,Venkatesh Ramaiyan

Two-way Interference Chan-nels with JammersSidharth Jaggi, MichaelLangberg

Bit-Interleaved Coded Modu-lation for Phase Shift Keyingon the HypersphereChristoph Rachinger, RalfMüller, Johannes Huber

Rigorous Dynamics ofExpectation-Propagation-Based Signal Recoveryfrom Unitarily Invariant Mea-surementsKeigo Takeuchi

Geometrically uniform dif-ferential vector signalingschemesEzio Biglieri, EmanueleViterbo

Mo3-8: Compressed Sensing 1 Chair: Gerhard Wunder K7+8Statistical and computa-tional phase transitions inspiked tensor estimationThibault Lesieur, Leo Mi-olane, Marc Lelarge, FlorentKrzakala, Lenka Zdeborova

Corrupted Sensing with Sub-gaussian MeasurementsJinchi Chen, Yulong Liu

On the Phase Transition ofCorrupted SensingHuan Zhang, Yulong Liu, LeiHong

On the Success Probabil-ity of the Box-ConstrainedRounding and Babai Detec-torsJinming Wen, Xiao-WenChang, Chintha Tellambura

A Characterization of Sam-pling Patterns for Low-Tucker-Rank Tensor Com-pletion ProblemMorteza Ashraphijuo, Va-neet Aggarwal, XiaodongWang

Mo3-9: MIMO 1 Chair: Christoph Studer K9Asymptotic Capacity Resultsfor MIMO Wireless OpticalCommunicationStefan Moser, Michail My-lonakis, Ligong Wang,Michele Wigger

On Capacity of NoncoherentMIMO with Asymmetric LinkStrengthsJoyson Sebastian, AyanSengupta, Suhas Diggavi

On the Degrees-of-Freedomof the MIMO Three-WayChannel with IntermittentConnectivityAnas Chaaban, Aydin Sez-gin, Mohamed-Slim Alouini

Outage Information Rate ofSpatially Correlated Multi-Cluster Scattering MIMOChannelsGiorgio Taricco, GiuseppaAlfano

A Generalized Zero-ForcingPrecoder for Multiple An-tenna Gaussian BroadcastChannelsSha Hu, Fredrik Rusek

Mo3-A: Age of Information 3 Chair: Elif Uysal-Biyikoglu Berlin 3Age of Information: Designand Analysis of OptimalScheduling AlgorithmsYu-Pin Hsu, Eytan Modiano,Lingjie Duan

Backlog-Adaptive Compres-sion: Age of InformationJing Zhong, Roy Yates, Em-ina Soljanin

The Stationary Distribu-tion of the Age of Informa-tion in FCFS Single-ServerQueuesYoshiaki Inoue, HiroyukiMasuyama, Tetsuya Takine,Toshiyuki Tanaka

Age-optimal Information Up-dates in Multihop NetworksAhmed Bedewy, Yin Sun,Ness Shroff

Communication over aChannel that Wears OutTing-Yi Wu, Lav Varshney,Vincent Tan

17

June 25 - June 30, 2017, Aachen, Germany

Monday, June 26 16:40-18:2016:40 17:00 17:20 17:40 18:00Mo4-1: Coding Theory 1 Chair: Juergen Freudenberger EuropaNon-linear Cyclic Codesthat Attain the Gilbert-Varshamov BoundIshay Haviv, Michael Lang-berg, Moshe Schwartz, Ei-tan Yaakobi

Strong Functional Represen-tation Lemma and Applica-tions to Coding TheoremsCheuk Ting Li, Abbas ElGamal

On the VC-Dimension ofBinary CodesSihuang Hu, Nir Weinberger,Ofer Shayevitz

Duality of channels andcodesJoseph Renes

Polynomial Ring Transformsfor Efficient XOR-basedErasure CodingJonathan Detchart, JeromeLacan

Mo4-2: Coding for Storage Chair: Camilla Hollanti BrusselsSecure RAID Schemesfrom EVENODD and STARCodesWentao Huang, JehoshuaBruck

Sector-disk codes with threeglobal paritiesXiao Li, Iwan Duursma

Coding for Racetrack Memo-riesYeow Meng Chee, Han MaoKiah, Alexander Vardy, VanKhu Vu, Eitan Yaakobi

On the Tradeoff Region ofSecure Exact-Repair Regen-erating CodesShuo Shao, Tie Liu, ChaoTian, Cong Shen

Construction of Unrestricted-Rate Parallel Random Input-Output CodeShan Lu, Hiroshi Kamabe,Jun Cheng, Akira Yamawaki

Mo4-3: Interference Channels 1 Chair: Daniela Tuninetti K2Two-way interference chan-nel capacity: How to havethe cake and eat it tooChangho Suh, JaewoongCho, David Tse

Capacity Region of the Sym-metric Injective K-UserDeterministic InterferenceChannelMehrdad Kiamari, SalmanAvestimehr

State-Dependent Z-Interference Channel withCorrelated StatesYunhao Sun, Yingbin Liang,Ruchen Duan, Shlomo(Shitz) Shamai

Novel Outer Bounds andCapacity Results for theInterference Channel withConferencing ReceiversReza K. Farsani, Amir K.Khandani

Approximate Capacity of aClass of Partially ConnectedInterference ChannelsMuryong Kim, Yitao Chen,Sriram Vishwanath

Mo4-4: Shannon Inequalities Chair: Haim Permuter K3Wasserstein Stability of theEntropy Power Inequalityfor Log-Concave RandomVectorsThomas Courtade, MaxFathi, Ashwin Pananjady

Two-Moment Inequalities forRenyi Entropy and MutualInformationGalen Reeves

One-shot Multivariate Cov-ering Lemmas via WeightedSum and Concentration In-equalitiesMohammad Hossein Yas-saee, Jingbo Liu, SergioVerdú

A min-entropy power in-equality for groupsPeng Xu, James Melbourne,Mokshay Madiman

A Minimal Set of Shannon-type Inequalities for Func-tional Dependence Struc-turesSatyajit Thakor, TerenceChan, Alex Grant

Mo4-5: Bounds 1 Chair: Martina Cardone K4Sum-set Inequalities fromAligned Image Sets: Instru-ments for Robust GDoFBoundsArash Gholami Davoodi,Syed Jafar

Scaling Exponent of SparseRandom Linear Codes overBinary Erasure ChannelsHessam Mahdavifar

A Frequency-Domain Ap-proach to Tightening theGeneralized LevenshteinBoundZilong Liu, Yong LiangGuan, Wai Ho Mow

Bounds for CooperativeLocality Using GeneralizedHamming WeightsKhaled Abdel-Ghaffar, JosWeber

Bounds on the AsymptoticRate of Binary ConstantSubblock-CompositionCodesAnshoo Tandon, Han MaoKiah, Mehul Motani

Mo4-6: Multiterminal Source Coding Chair: Michelle Effros K5Distributed CooperativeInformation BottleneckMatias Vera, Leonardo ReyVega, Pablo Piantanida

A Unified Approach to ErrorExponents for MultiterminalSource Coding SystemsShigeaki Kuzuoka

Generalized Gaussian Mul-titerminal Source Codingand Probabilistic GraphicalModelsJun Chen, Farrokh Etezadi,Ashish Khisti

Two-Encoder MultiterminalSource Coding With Side In-formation Under LogarithmicLossAbdellatif Zaidi

Coding for Arbitrarily Vary-ing Remote SourcesAmitalok Budkuley, BikashDey, Vinod Prabhakaran

Mo4-7: Security 1 Chair: Wei Kang K6On The Compound MIMOWiretap Channel with MeanFeedbackAmr Abdelaziz, Ashraf El-bayoumy, Can Koksal, Hes-ham El Gamal

Multiple Access WiretapChannel with CribbingNoha Helal, Aria Nosratinia

Wiretap channel capacity:Secrecy criteria, strong con-verse, and phase changeEric Graves, Tan Wong

The Shannon Cipher Sys-tem with a Guessing Eaves-dropperLanqing Yu, Paul Cuff

Privacy-Aware GuessingEfficiencyShahab Asoodeh, MarioDiaz, Fady Alajaji, TamasLinder

Mo4-8: Privacy 1 Chair: Frans Willems K7+8Optimal Schemes for Dis-crete Distribution Estimationunder Local Differential Pri-vacyMin Ye, Alexander Barg

Limits of Location Privacyunder Anonymization andObfuscationNazanin Takbiri, AmirHoumansadr, DennisGoeckel, Hossein Pishro-Nik

Operational Definitions forSome Common InformationLeakage MetricsIbrahim Issa, Aaron Wagner

Smart Meter Privacy Basedon Adversarial HypothesisTestingZuxing Li, Tobias Oechter-ing, Deniz Gündüz

Hypothesis Testing underMaximal Leakage PrivacyConstraintsJiachun Liao, Lalitha Sankar,Flavio Calmon, Vincent Tan

Mo4-9: Subspace and LDPC Codes Chair: Shu Lin K9Cyclic Subspace Codes andSidon SpacesNetanel Raviv, Itzhak Tamo

Grassmannian Codes fromMultiple Families of MutuallyUnbiased BasesOlav Tirkkonen, ChristopherBoyd, Roope Vehkalahti

Performance of ML De-coding for Ensembles ofBinary and Nonbinary Reg-ular LDPC Codes of FiniteLengthsIrina Bocharova, BorisKudryashov, Vitaly Skachek

Interleaved SubspaceCodes in Fountain ModeVladimir Sidorenko, HannesBartz, Antonia Wachter-Zeh

LT codes on Partial ErasureChannelsCarolyn Mayer, ChristineKelley

Mo4-A: Energy Harvesting 1 Chair: Yu-Pin Hsu Berlin 3Energy Harvesting Net-works with General UtilityFunctions: Near OptimalOnline PoliciesAhmed Arafa, AbdulrahmanBaknina, Sennur Ulukus

On Achievable Rates ofAWGN Energy-HarvestingChannels with Block EnergyArrival and Non-VanishingError ProbabilitiesSilas Fong, Vincent Tan,Ayfer Özgür

Optimal Transmission forEnergy Harvesting Nodesunder Battery Size and Us-age ConstraintsJing Yang, Jingxian Wu

Single-User Channel withData and Energy Arrivals:Online PoliciesAbdulrahman Baknina, Sen-nur Ulukus

18

ISIT 2017

Tuesday, June 27 09:50-11:109:50 10:10 10:30 10:50Tu1-1: Array Codes Chair: Joachim Rosenthal EuropaLocality and Availability of ArrayCodes Constructed from SubspacesNatalia Silberstein, Tuvi Etzion,Moshe Schwartz

Efficient Lowest Density MDS ArrayCodes of Column Distance 4Zhijie Huang, Hong Jiang, NongXiao

Triple-Fault-Tolerant Binary MDSArray Codes with AsymptoticallyOptimal RepairHanxu Hou, Patrick Pak-Ching Lee,Yunghsiang Han, Yuchong Hu

Codes for Graph ErasuresLev Yohananov, Eitan Yaakobi

Tu1-2: Polar Codes 1 Chair: Ilya Dumer BrusselsFast Polarization for Non-StationaryChannelsHessam Mahdavifar

A Lower Bound on the Probabilityof Error of Polar Codes over BMSChannelsBoaz Shuval, Ido Tal

On the Pointwise Threshold Behav-ior of the Binary Erasure Polariza-tion SubchannelsErik Ordentlich, Ron Roth

Exploiting Source Redundancy toImprove the Rate of Polar CodesYing Wang, Krishna Narayanan,Anxiao Andrew Jiang

Tu1-3: Multiple Access 2 Chair: Abbas El Gamal K2Outer Bounds for Gaussian MultipleAccess Channels with State Knownat One EncoderWei Yang, Yingbin Liang, Shlomo(Shitz) Shamai, H. Vincent Poor

Homologous Codes for MultipleAccess ChannelsPinar Sen, Young-Han Kim

An Achievable Error Exponent forthe Multiple Access Channel withCorrelated SourcesArezou Rezazadeh, Josep Font-Segura, Alfonso Martinez, AlbertGuillén i Fàbregas

A Broadcast Approach to MultipleAccess Adapted to the MultiuserChannelSamia Kazemi, Ali Tajer

Tu1-4: Information Measures Chair: Thomas Courtade K3On the Information Dimension Rateof Stochastic ProcessesBernhard Geiger, Tobias Koch

A Variational Characterization ofRényi DivergencesVenkat Anantharam

A de Bruijn identity for discrete ran-dom variablesOliver Johnson, Saikat Guha

Direct Estimation of InformationDivergence Using Nearest NeighborRatiosMorteza Noshad, Kevin Moon, Sal-imeh Yasaei Sekeh, Alfred Hero III

Tu1-5: Joint Source-Channel Coding 1 Chair: Aaron Wagner K4Expurgated Joint Source-ChannelCoding Bounds and Error Expo-nentsJonathan Scarlett, Alfonso Martinez,Albert Guillén i Fàbregas

Graph Information RatioLele Wang, Ofer Shayevitz

Second Order Analysis for JointSource-Channel Coding with Marko-vian SourceRyo Yaguchi, Masahito Hayashi

On the Necessary Conditions forTransmitting Correlated Sourcesover a Multiple Access ChannelBasak Guler, Deniz Gündüz, AylinYener

Tu1-6: Strong Converses Chair: Shun Watanabe K5Strong Converse for Content Identifi-cation with Lossy RecoveryLin Zhou, Vincent Tan, MehulMotani

Strong Converse Theorems for Dis-crete Memoryless Networks withTight Cut-Set BoundSilas Fong, Vincent Tan

Reverse hypercontractivity regionfor the binary erasure channelChandra Nair, Yan Nan Wang

Beyond the Blowing-Up Lemma:Sharp Converses via Reverse Hy-percontractivityJingbo Liu, Ramon van Handel, Ser-gio Verdú

Tu1-7: Crypto 1 Chair: Matthieu Bloch K6An Information-theoretic Approachto Hardness AmplificationUeli Maurer

Witness-Hiding Proofs of Knowl-edge for Cable LocksChen-Da Liu Zhang, Ueli Maurer,Martin Raszyk, Daniel Tschudi

Privacy Amplification of DistributedEncrypted Sources with CorrelatedKeysBagus Santoso, Yasutada Oohama

Tu1-8: Wireless Communication Chair: Yingbin Liang K7+8Can Full-Duplex More than Doublethe Capacity of Wireless Networks?Serj Haddad, Ayfer Özgür, EmreTelatar

Short-Message Communicationand FIR System Identification usingHuffman SequencesPhilipp Walk, Peter Jung, BabakHassibi

Novel Construction Methods ofQuaternion Orthogonal Designsbased on Complex Orthogonal De-signsErum Mushtaq, Sajid Ali, Syed AliHassan

Tu1-9: Hypothesis Testing 2 Chair: Yanina Shkel K9Hypothesis Test for Upper Bound onthe Size of Random Defective SetArkadii Dyachkov, Ilya Vorobyev,Nikita Polyanskii, VladislavShchukin

Distributed Hypothesis Testing OverNoisy ChannelsSreejith Sreekumar, Deniz Gündüz

Linear-Complexity Exponentially-Consistent Tests for Universal Outly-ing Sequence DetectionYuheng Bu, Shaofeng Zou, Venu-gopal Veeravalli

Active Hypothesis Testing on A Tree:Anomaly Detection under Hierarchi-cal ObservationsChao Wang, Kobi Cohen, QingZhao

19

June 25 - June 30, 2017, Aachen, Germany

Tuesday, June 27 11:30-12:5011:30 11:50 12:10 12:30Tu2-1: Coding Techniques 2 Chair: Alexander Barg EuropaFractional decoding: Error correc-tion from partial informationItzhak Tamo, Min Ye, AlexanderBarg

Performance of Optimal Data Shap-ing CodesYi Liu, Pengfei Huang, Paul Siegel

Multilevel Code Construction forCompound Fading ChannelsAntonio Campello, Ling Liu, CongLing

Dense Gray Codes in MixedRadicesJessica Fan, Thomas Cormen

Tu2-2: Locally Repairable Codes 2 Chair: Antonia Tulino BrusselsBalanced and Sparse Tamo-BargCodesWael Halbawi, Iwan Duursma,Hoang Dau, Babak Hassibi

Bounds and Constructions of Codeswith All-Symbol Locality and Avail-abilityStanislav Kruglik, Alexey Frolov

Security for Minimum Storage Re-generating Codes and Locally Re-pairable CodesSwanand Kadhe, Alex Sprintson

Tu2-3: Broadcast Channels 2 Chair: Vincent Tan K2The Arbitrarily Varying DegradedBroadcast Channel with CausalSide Information at the EncoderUzi Pereg, Yossef Steinberg

Sub-optimality of superposition cod-ing region for three receiver broad-cast channel with two degradedmessage setsMehdi Yazdanpanah, Chandra Nair

The Broadcast Channel with De-graded Message Sets and Unreli-able ConferenceDor Itzhak, Yossef Steinberg

On the Capacity Region of the K-User Discrete Memoryless Broad-cast Channel with Two DegradedMessagesMahesh Varanasi, MohamedSalman

Tu2-4: Channel Capacity 2 Chair: Amos Lapidoth K3The Optimal Exponent Functionfor the Additive White GaussianNoise Channel at Rates above theCapacityYasutada Oohama

A Generalized Ozarow-Wyner Ca-pacity Bound with ApplicationsAlex Dytso, Mario Goldenbaum,H. Vincent Poor, Shlomo (Shitz)Shamai

A Bound on the Shannon Capacityvia a Linear Programming VariationSihuang Hu, Itzhak Tamo, OferShayevitz

On the Discreteness of Capacity-Achieving Distributions for the Cen-sored ChannelArash Behboodi, GholamrezaAlirezaei, Rudolf Mathar

Tu2-5: Massive MIMO Chair: Christoph Studer K4Massive Device Connectivity withMassive MIMOLiang Liu, Wei Yu

On the MISO Channel with Feed-back: Can Infinitely Massive Anten-nas Achieve Infinite Capacity?Jinyuan Chen

The BOX-LASSO with Application toGSSK Modulation in Massive MIMOSystemsIsmail Ben Atitallah, Christos Thram-poulidis, Abla Kammoun, Tareq Y.Al-Naffouri, Mohamed-Slim Alouini,Babak Hassibi

Multi-Users Space-Time Modula-tion with QAM Division for MassiveUplink CommunicationsJian-Kang Zhang, Zheng Dong

Tu2-6: MIMO 2 Chair: Vasanthan Raghavan K5Generalized Degrees-of-Freedomof the 2-User Case MISO BroadcastChannel with Distributed CSITAntonio Bazco, Paul de Kerret,David Gesbert, Nicolas Gresset

Spatially Correlated MIMO Broad-cast Channel: Analysis of Overlap-ping Correlation EigenspacesFan Zhang, Mohamed Fadel, AriaNosratinia

On the Achievable Rates of Decen-tralized Equalization in MassiveMU-MIMO SystemsCharles Jeon, Kaipeng Li, JosephCavallaro, Christoph Studer

V-BLAST in Lattice Reduction andInteger ForcingSebastian Stern, Robert Fischer

Tu2-7: Energy Harvesting 2 Chair: Deniz Gündüz K6Energy-Based Adaptive MultipleAccess in LPWAN IoT Systems withEnergy HarvestingNicolò Michelusi, Marco Levorato

Near Optimal Online Distortion Min-imization for Energy HarvestingNodesAhmed Arafa, Sennur Ulukus

Scheduling Status Updates to Min-imize Age of Information with anEnergy Harvesting SensorTan Bacinoglu, Elif Uysal-Biyikoglu

Code Design for Binary Energy Har-vesting ChannelMehdi Dabirnia, Tolga Duman

Tu2-8: Compressed Sensing 2 Chair: Tara Javidi K7+8A Greedy Blind Calibration Methodfor Compressed Sensing with Un-known Sensor GainsValerio Cambareri, AmirafsharMoshtaghpour, Laurent Jacques

Information-theoretic bounds andphase transitions in clustering,sparse PCA, and submatrix local-izationJess Banks, Cristopher Moore, Ro-man Vershynin, Nicolas Verzelen,Jiaming Xu

Almost Optimal Phaseless Com-pressed Sensing with SublinearDecoding TimeVasileios Nakos

A Characterization of Sampling Pat-terns for Low-Rank Multi-View DataCompletion ProblemMorteza Ashraphijuo, XiaodongWang, Vaneet Aggarwal

Tu2-9: Source Coding 2 Chair: Ertem Tuncel K9Coding of Binary AIFV Code TreesKentaro Sumigawa, Hirosuke Ya-mamoto

Universal lossy compression underlogarithmic lossYanina Shkel, Maxim Raginsky, Ser-gio Verdú

Towards Optimal Quantization ofNeural NetworksAvhishek Chatterjee, Lav Varshney

Stochastic Stability of Non-Markovian Processes and AdaptiveQuantizersSerdar Yüksel

20

ISIT 2017

Tuesday, June 27 14:40-16:2014:40 15:00 15:20 15:40 16:00Tu3-1: Network Coding 1 Chair: Tuvi Etzion EuropaSecrecy and Robustnessfor Active Attack in SecureNetwork CodingMasahito Hayashi, MasakiOwari, Go Kato, Ning Cai

Linear Network Coding forTwo-Unicast-Z Networks: ACommutative Algebraic Per-spective and FundamentalLimitsMohammad Fahim, ViveckCadambe

Network-Coded FronthaulTransmission for Cache-Aided C-RANTian Ding, Xiaojun Yuan,Soung Chang Liew

Optimal Secondary Accessin Retransmission basedPrimary Networks via ChainDecodingNicolò Michelusi

Tu3-2: LDPC Codes 2 Chair: Khaled Abdel-Ghaffar BrusselsCharacterization and Effi-cient Exhaustive SearchAlgorithm for ElementaryTrapping Sets of IrregularLDPC CodesYoones Hashemi Toroghi,Amir Banihashemi

An Adaptive EMS Algorithmfor Nonbinary LDPC CodesYoungjun Hwang, SunghyeCho, Kyeongcheol Yang

A Two-Stage Decoding Al-gorithm for Short NonbinaryLDPC Codes with Near-MLPerformanceDixia Deng, Hengzhou Xu,Baoming Bai, Ji Zhang

Design of Improved Quasi-Cyclic Protograph-BasedRaptor-Like LDPC Codesfor Short Block-LengthsSudarsan Vasista Srini-vasan Ranganathan, Dar-iush Divsalar, Richard We-sel

Finite-Length LDPC Codeson the q-ary Multi-Bit Chan-nelRami Cohen, Yuval Cassuto

Tu3-3: Caching 2 Chair: Bobak Nazer K2Online Edge Caching inFog-Aided Wireless Net-worksSeyyed MohammadrezaAzimi, Osvaldo Simeone,Avik Sengupta, Ravi Tandon

Benefits of Cache Assign-ment on Degraded Broad-cast ChannelsShirin Saeedi Bidokhti,Michele Wigger, Aylin Yener

Rate-Memory Trade-off forthe Two-User BroadcastCaching Network with Corre-lated SourcesParisa Hassanzadeh, An-tonia Tulino, Jaime Llorca,Elza Erkip

On the Optimality of Sepa-ration between Caching andDelivery in General CacheNetworksNavid Naderializadeh, Mo-hammad Ali Maddah-Ali,Salman Avestimehr

Tu3-4: Second Order Chair: Giuseppe Durisi K3Dispersion of the DiscreteArbitrarily-Varying Channelwith Limited Shared Ran-domnessOliver Kosut, Joerg Kliewer

On the calculation of theminimax-converse of thechannel coding problemNir Elkayam, Meir Feder

Exact Moderate DeviationAsymptotics in StreamingData TransmissionSi-Hyeon Lee, Vincent Tan,Ashish Khisti

Infinite Dispersion in BurstyCommunicationLongguang Li, AslanTchamkerten

Achievable Moderate De-viations Asymptotics forStreaming Slepian-WolfCodingLin Zhou, Vincent Tan,Mehul Motani

Tu3-5: Detection and Estimation 2 Chair: Jing Yang K4Demystifying Fixed k-Nearest Neighbor Informa-tion EstimatorsWeihao Gao, Sewoong Oh,Pramod Viswanath

Structure of optimal strate-gies for remote estimationover Gilbert-Elliott channelwith feedbackJhelum Chakravorty, AdityaMahajan

Sparse Gaussian MixtureDetection: Low Complexity,High Performance Tests viaQuantizationJonathan Ligo, GeorgeMoustakides, VenugopalVeeravalli

Compressive Estimation ofa Stochastic Process withUnknown AutocorrelationFunctionMahdi Barzegar Khalilsarai,Saeid Haghighatshoar,Giuseppe Caire, GerhardWunder

Robust sequential change-point detection by convexoptimizationYang Cao, Yao Xie

Tu3-6: Sequences 1 Chair: Prakash Narayan K5Perfect polyphase se-quences from cubic poly-nomialsMin Kyu Song, Hong-YeopSong

Bayesian definition of ran-dom sequences with re-spect to conditional probabil-itiesHayato Takahashi

On the Correlation betweenBoolean Functions of Se-quences of Random Vari-ablesFarhad Shirani, SandeepPradhan

The Hybrid k-Deck Problem:Reconstructing Sequencesfrom Short and Long TracesRyan Gabrys, OlgicaMilenkovic

Tu3-7: Communications 2 Chair: Tobias Koch K6Reliability of Universal De-coding Based on Vector–Quantized CodewordsNeri Merhav

Sample Complexity of theBoolean MultireferenceAlignment ProblemJoao Pereira, Amit Singer,Emmanuel Abbe

On the optimality of treatinginterference as noise in the2 x M LD X-channelSoheil Gherekhloo, YaseminKaracora, Aydin Sezgin

Interaction Information forCausal Inference: The Caseof Directed TriangleAmirEmad Ghassami, Ne-gar Kiyavash

Completely blind sensing ofmulti-band signalsTaehyung Lim, MassimoFranceschetti

Tu3-8: Information Theory and Statistics 1 Chair: Pierre Moulin K7+8An Information-TheoreticApproach to UniversalFeature Selection in High-Dimensional InferenceShao-Lun Huang, AnuranMakur, Lizhong Zheng, Gre-gory Wornell

Identifying Nonlinear 1-StepCausal Influences in Pres-ence of Latent VariablesSaber Salehkaleybar, JalalEtesami, Negar Kiyavash

Closed-Form Momentsof Finite-Dimension Non-central Wishart Matrices viaConcentration of SpectralMeasureXinmin Li, Ling Qiu

Information-geometricalcharacterization of statisticalmodels which are statisti-cally equivalent to probabil-ity simplexesHiroshi Nagaoka

Density Functional Estima-tors with k-Nearest NeighborBandwidthsWeihao Gao, Sewoong Oh,Pramod Viswanath

Tu3-9: Machine Learning 1 Chair: Toshiyuki Tanaka K9Energy decay and conser-vation in deep convolutionalneural networksPhilipp Grohs, Thomas Wia-towski, Helmut Bölcskei

Neural Offset Min-Sum De-codingLoren Lugosch, WarrenGross

Learning-Based EpsilonMost Stringent Test forGaussian Samples Clas-sificationLionel Fillatre, Igor Nikiforov

Quickest Search and Learn-ing over Multiple SequencesJavad Heydari, Ali Tajer

Minimax Lower Boundsfor Ridge CombinationsIncluding Neural NetsJason Klusowski, AndrewBarron

21

June 25 - June 30, 2017, Aachen, Germany

Tuesday, June 27 16:40-18:2016:40 17:00 17:20 17:40 18:00Tu4-1: Coding Theory 2 Chair: Emina Soljanin EuropaPseudo-Wigner Matricesfrom Dual BCH CodesIlya Soloveychik, Yu Xiang,Vahid Tarokh

On codes achieving zeroerror capacities in limitedmagnitude error channelsBella Bose, Noha Elarief,Luca Tallini

On the Capacities of Bal-anced Codes with Run-Length ConstraintsAkiko Manada, HiroyoshiMorita

Geometric OrthogonalCodes Better than OpticalOrthogonal CodesYeow Meng Chee, Han MaoKiah, San Ling, Hengjia Wei

The Augustin Center andThe Sphere Packing BoundFor Memoryless ChannelsBaris Nakiboglu

Tu4-2: Coding for Distributed Storage 1 Chair: Vitaly Skachek BrusselsSecrecy Capacity of Mini-mum Storage RegeneratingCodesAnkit Singh Rawat

Cooperative Data Exchangebased on MDS codesSu Li, Michael Gastpar

Asymptotically Optimal Re-generating Codes Over AnyFieldNetanel Raviv

Private Information Retrievalin Distributed Storage Sys-tems Using an ArbitraryLinear CodeSiddhartha Kumar, EirikRosnes, Alexandre Graell iAmat

Tu4-3: Interference Channels 2 Chair: Changho Suh K2Nash Region of the LinearDeterministic InterferenceChannel with Noisy OutputFeedbackVictor Quintero, Samir Per-laza, Jean-Marie Gorce, H.Vincent Poor

Characterization of De-grees of Freedom versusReceivers Backhaul Load inK-User Interference Chan-nelBorna Kananian, Moham-mad Ali Maddah-Ali, SeyedPooya Shariatpanahi, BabakHossein Khalaj

Discrete Modulation for In-terference MitigationMirza Uzair Baig, AndersHøst-Madsen, Aria Nosra-tinia

Communicating CorrelatedSources Over an Interfer-ence ChannelArun Padakandla

Topological InterferenceManagement: Linear Co-operation is not useful forWyner’s NetworksAly El Gamal

Tu4-4: Entropy 2 Chair: Stefan Moser K3Urns and entropies revisitedFrantišek Matúš

Metric and topological en-tropy bounds on state esti-mation for stochastic non-linear systemsChristoph Kawan, SerdarYüksel

Playing Games withBounded EntropyMehrdad Valizadeh, AminGohari

Entropic Causality andGreedy Minimum EntropyCouplingMurat Kocaoglu, AlexandrosDimakis, Sriram Vishwanath,Babak Hassibi

On Structural Entropy ofUniform Random Intersec-tion GraphsMarcin Kardas, Zbig-niew Golebiewski, JakubLemiesz, Krzysztof Majcher

Tu4-5: Bounds 2 Chair: Viveck Cadambe K4Dependence MeasuresBounding the ExplorationBias for General Measure-mentsJiantao Jiao, Yanjun Han,Tsachy Weissman

Binary Subblock Energy-Constrained Codes: Boundson Code Size and Asymp-totic RateAnshoo Tandon, Han MaoKiah, Mehul Motani

Sampled Graph-Signals:Iterative Recovery with anAnalytic Error BoundNorbert Goertz

Multidimensional Semicon-strained SystemsOhad Elishco, TomMeyerovitch, MosheSchwartz

Variable-length codes forchannels with memory andfeedback: error-exponentlower boundsAchilleas Anastasopoulos,Jui Wu

Tu4-6: Sequences 2 Chair: Yossef Steinberg K5On Empirical Cumulant Gen-erating Functions of CodeLengths for Individual Se-quencesNeri Merhav

Degree-(k + 1) PerfectGaussian Integer Se-quences of Period pk

Ho-Hsuan Chang

Reconstruction of Se-quences over Non-IdenticalChannelsMichal Horovitz, EitanYaakobi

Classification of a SequenceFamily Using PlateauedFunctionsSerdar Boztas, FerruhOzbudak, Eda Tekin

Tu4-7: Security 2 Chair: Arya Mazumdar K6Secret Key Agreement un-der Discussion Rate Con-straintsChung Chan, ManujMukherjee, Navin Kashyap,Qiaoqiao Zhou

A Game Theoretic Treat-ment for Pair-wise Secret-Key Generation in Many-to-One NetworksRemi Chou, Aylin Yener

Information-TheoreticallySecure Key Generation andManagementXin-Wen Wu, En-hui Yang

Secret-Key Agreement withPublic Discussion over Multi-Antenna Transmitters withAmplitude ConstraintsZouheir Rezki, Mohamed-Slim Alouini

Robust and Secure Identifi-cationHolger Boche, ChristianDeppe

Tu4-8: Quantum IT 2 Chair: Joseph Renes K7+8Moderate deviation analysisfor classical communicationover quantum channelsChristopher Chubb, VincentTan, Marco Tomamichel

Quantum Information onSpectral SetsPeter Harremoës

Kolmogorov Amplificationfrom Bell CorrelationÄmin Baumeler, CharlesAlexandre Bédard, GillesBrassard, Stefan Wolf

Degradable states and one-way entanglement distilla-tionFelix Leditzky, NilanjanaDatta, Graeme Smith

Tu4-9: Compression 1 Chair: Faramarz Fekri K9Recovery of Vertex Order-ings in Dynamic GraphsAbram Magner, AnanthGrama, Jithin Sreedharan,Wojciech Szpankowski

Variable-Length Lossy Com-pression Allowing PositiveOverflow and Excess Distor-tion ProbabilitiesShota Saito, Hideki Yagi,Toshiyasu Matsushima

On Lossy Compression ofBinary MatricesRonit Bustin, Ofer Shayevitz

Universal Lossless Com-pression of Graphical DataPayam Delgosha, VenkatAnantharam

Compressing data ongraphs with clustersAmir Asadi, EmmanuelAbbe, Sergio Verdú

22

ISIT 2017

Wednesday, June 28 09:50-11:109:50 10:10 10:30 10:50We1-1: Iterative Decoding 1 Chair: Albert Guillén i Fàbregas EuropaVector Approximate Message Pass-ingSundeep Rangan, Philip Schniter,Alyson Fletcher

Generalized Approximate Message-Passing Decoder for UniversalSparse Superposition CodesErdem Biyik, Jean Barbier, Mo-hamad Dia

Block Markov Superposition Trans-mission of BCH Codes with IterativeHard-decision DecodingNina Lin, Suihua Cai, Xiao Ma

Belief Propagation for SubgraphDetection with Imperfect Side-informationArun Kadavankandy, KonstantinAvrachenkov, Laura Cottatellucci,Rajesh Sundaresan

We1-2: Student Paper Awards Candidate Talks 1 Chair: Wei Yu BrusselsMultiplexing Zero-Error and Rare-Error Communications over a NoisyChannel with FeedbackTibor Keresztfalvi, Amos Lapidoth

The Exact Rate-Memory Tradeofffor Caching with Uncoded Prefetch-ingQian Yu, Mohammad Ali Maddah-Ali, Salman Avestimehr

Greedy-Merge Degrading has Opti-mal Power-LawAssaf Kartowsky, Ido Tal

A Generic Transformation for Opti-mal Repair Bandwidth and Rebuild-ing Access in MDS CodesJie Li, Xiaohu Tang, Chao Tian

We1-3: Coding for Storage and Streaming Chair: Ashish Khisti K2Multipermutation Ulam Sphere Anal-ysis Toward Characterizing MaximalCode SizeJustin Kong, Manabu Hagiwara

Multiplexed FEC for MultipleStreams with Different PlayoutDeadlinesAhmed Badr, Devin Lui, AshishKhisti, Wai-Tian Tan, Xiaoqing Zhu,John Apostolopoulos

A Code Equivalence betweenStreaming Network Coding andStreaming Index CodingMing Fai Wong, Michelle Effros,Michael Langberg

On the error probability of stochasticdecision and stochastic decodingJun Muramatsu, Shigeki Miyake

We1-4: Zero Error Capacity Chair: Alon Orlitsky K3The Birthday Problem and Zero-Error List CodesParham Noorzad, Michelle Effros,Michael Langberg, Victoria Kostina

The Zero-Error Capacity of a Col-lision Channel With SuccessiveInterference CancellationYijin Zhang, Yi Chen, Yuan-Hsun Lo,Wing Shing Wong

An improved bound on the zero-error list-decoding capacity of the4/3 channelMarco Dalai, Venkatesan Gu-ruswami, Jaikumar Radhakrishnan

We1-5: Joint Source-Channel Coding 2 Chair: Sandeep Pradhan K4Dependence Balance in MultipleAccess Channels with CorrelatedSourcesAmos Lapidoth, Shirin SaeediBidokhti, Michele Wigger

On Minimum Energy for RobustGaussian Joint Source-ChannelCoding with a Distortion-Noise Pro-fileErman Köken, Ertem Tuncel

Communicating Correlated SourcesOver a MACArun Padakandla

We1-6: Spatial Coupling Chair: Laurent Schmalen K5Spatially Coupled LDLC: New Con-structionsSvetlana Reznikov, Meir Feder

A Protograph-Based Design ofQuasi-Cyclic Spatially CoupledLDPC CodesLi Chen, Shiyuan Mo, DanielCostello, David Mitchell, RoxanaSmarandache

Complexity-Optimized Concate-nated LDGM-Staircase CodesLei Zhang, Frank Kschischang

A Novel Combinatorial Frameworkto Construct Spatially-CoupledCodes: Minimum Overlap Partition-ingHoma Esfahanizadeh, Ahmed Ha-reedy, Lara Dolecek

We1-7: Security 3 Chair: Salim El Rouayheb K6Secure wireless communicationunder spatial and local Gaussiannoise assumptionsMasahito Hayashi

The Degraded Gaussian Multi-ple Access Wiretap Channel withSelfish Transmitters: A CoalitionalGame Theory PerspectiveRemi Chou, Aylin Yener

MIMO Gaussian Wiretap Channelswith Two Transmit Antennas: Opti-mal Precoding and Power AllocationMojtaba Vaezi, Wonjae Shin, H.Vincent Poor, Jungwoo Lee

Computation of the Random CodingSecrecy Exponent for a ConstantComposition EnsembleYutaka Jitsumatsu

We1-8: Quantum IT 3 Chair: Min-Hsiu Hsieh K7+8Codes for Simultaneous Transmis-sion of Quantum and Classical Infor-mationMarkus Grassl, Sirui Lu, Bei Zeng

Belief propagation decoding ofquantum channels by passing quan-tum messagesJoseph Renes

Semidefinite programming conversebounds for classical communicationover quantum channelsXin Wang, Wei Xie, Runyao Duan

On the Feasibility Conditions ofQuantum State DiscriminationChung-Chin Lu, Shiuan-Hao Kuo

We1-9: Source Coding 3 Chair: Charalambos Charalambous K9An Information-Theoretic Analysis ofDeduplicationUrs Niesen

Extended Gray-Wyner System withComplementary Causal Side Infor-mationCheuk Ting Li, Abbas El Gamal

Variable-Length Resolvability forGeneral SourcesHideki Yagi, Te Sun Han

Universal Tree Source Coding Us-ing Grammar-Based CompressionMarkus Lohrey, Danny Hucke

23

June 25 - June 30, 2017, Aachen, Germany

Wednesday, June 28 11:30-12:3011:30 11:50 12:10We2-1: Coding Techniques (Focus Session) Chair: Irina Bocharova EuropaMulti-Block Interleaved Codes for Local andGlobal Read AccessYuval Cassuto, Evyatar Hemo, Sven Puchinger,Martin Bossert

Successive Cancellation Decoding of SingleParity-Check Product CodesMustafa Coşkun, Gianluigi Liva, Alexandre Graelli Amat, Michael Lentmaier

Codes for Channels With Segmented EditsMahed Abroshan, Ramji Venkataramanan, AlbertGuillén i Fàbregas

We2-2: Student Paper Awards Candidate Talks 2 Chair: Elza Erkip BrusselsA High-SNR Normal Approximation for Single-Antenna Rayleigh Block-Fading ChannelsAlejandro Lancho, Tobias Koch, Giuseppe Durisi

A Tight Rate Bound and a Matching Constructionfor Locally Recoverable Codes with SequentialRecovery From Any Number of Multiple ErasuresBalaji Srinivasan Babu, Ganesh Kini, P VijayKumar

Feedback Capacity and Coding for the (0,k)-RLLInput-Constrained BECOri Peled, Oron Sabag, Haim Permuter

We2-3: Crypto (Focus Session) Chair: Natasa Zivic K2Efficiency Lower Bounds for Commit-and-ProveConstructionsChen-Da Liu Zhang, Christian Badertscher, San-dro Coretti, Ueli Maurer

Information Set Decoding with Soft Informationand some cryptographic applicationsQian Guo, Thomas Johansson, Erik Mårtensson,Paul Stankovski

Statistical DecodingThomas Debris-Alazard, Jean-Pierre Tillich

We2-4: Security (Focus Session) Chair: Andrew Thangaraj K3Security of Helper Data Schemes for SRAM-PUFin Multiple Enrollment ScenariosLieneke Kusters, Tanya Ignatenko, FransWillems, Roel Maes, Erik van der Sluis, Geor-gios. Selimis

New Models for Interference and BroadcastChannels with Confidential MessagesMohamed Nafea, Aylin Yener

Secret Sharing with Optimal Decoding and Re-pair BandwidthWentao Huang, Jehoshua Bruck

We2-5: Network Information Theory (Focus Session) Chair: Anthony Ephremides K5Towards an Algebraic Network Information The-ory: Simultaneous Joint Typicality DecodingSung Hoon Lim, Chen Feng, Adriano Pastore,Bobak Nazer, Michael Gastpar

On the Sub-optimality of Single-letter Coding inMulti-terminal CommunicationsFarhad Shirani, Sandeep Pradhan

Coordination with Clustered Common Random-ness in a Three-Terminal Line NetworkIshaque Ashar Kadampot, Matthieu Bloch

We2-P: Recent Results Posters Chair: Anke Schmeink Foyer Brussels

Wednesday, June 28 12:45-13:45We3-1: Awards Session Chair: Ruediger Urbanke Europa

Wednesday, June 28 AfternoonSocial Events

24

ISIT 2017

Thursday, June 29 09:50-11:109:50 10:10 10:30 10:50Th1-1: Lattice Codes 1 Chair: Stark Draper EuropaCapacity Optimality of Lattice Codesin Common Message GaussianBroadcast Channels with CodedSide InformationLakshmi Natarajan, Yi Hong,Emanuele Viterbo

On the Communication Cost of De-termining an Approximate NearestLattice PointMaiara Bollauf, Vinay Vaisham-payan, Sueli Costa

Communication Cost of Transform-ing a Nearest Plane Partition to theVoronoi PartitionVinay Vaishampayan, Maiara Bol-lauf

Compute-and-Forward over Block-Fading Channels Using AlgebraicLatticesShanxiang Lyu, Antonio Campello,Cong Ling, Jean-Claude Belfiore

Th1-2: Polar Codes 2 Chair: Ruediger Urbanke BrusselsConstruction of Polar Codes withSublinear ComplexityMarco Mondelli, Hamed Hassani,Ruediger Urbanke

On the Error Probability of ShortConcatenated Polar and CyclicCodes with InterleavingGiacomo Ricciutelli, Marco Baldi,Franco Chiaraluce, Gianluigi Liva

A Randomized Construction of PolarSubcodesPeter Trifonov, Grigorii Trofimiuk

On Design of CRC Codes for PolarCodes with Successive CancellationList DecodingTakumi Murata, Hideki Ochiai

Th1-3: Broadcast Channels 3 Chair: Shlomo (Shitz) Shamai K2Block-fading Broadcast Channelwith Hybrid CSIT and CSIRMohamed Fadel, Aria Nosratinia

Application of Yamamoto-Itoh Cod-ing Scheme to Discrete MemorylessBroadcast ChannelsHirosuke Yamamoto, Shintaro Hara

Coding Across Heterogeneous Par-allel Erasure Broadcast Channels isUsefulSunghyun Kim, Soheil Mohajer,Changho Suh

Rate Splitting and SuperpositionCoding for Concurrent Groupcast-ing over the Broadcast Channel: AGeneral FrameworkHenry Romero, Mahesh Varanasi

Th1-4: Private Information Retrieval Chair: Michael Gastpar K3Private Information Retrieval fromMDS Coded Data with ColludingServers: Settling a Conjecture byFreij-Hollanti et alHua Sun, Syed Jafar

Multi-Message Private InformationRetrievalKarim Banawan, Sennur Ulukus

Robust Private Information Retrievalon Coded DataRazane Tajeddine, Salim El Rouay-heb

Private Information RetrievalSchemes for Coded Data with Ar-bitrary Collusion PatternsRazane Tajeddine, Oliver Gnilke,David Karpuk, Ragnar Freij-Hollanti,Camilla Hollanti, Salim El Rouayheb

Th1-5: Rate Distortion Theory 2 Chair: Tsachy Weissman K4A Distortion Based Approach forProtecting InferencesChi-Yo Tsai, Gaurav Kumar Agarwal,Christina Fragouli, Suhas Diggavi

Rate-Distortion Regions of In-stances of Cascade Source Codingwith Side InformationChien-Yi Wang, Abdellatif Zaidi

The Rate-Distortion Function forSuccessive Refinement of AbstractSourcesVictoria Kostina, Ertem Tuncel

Rate-Distortion Tradeoffs underKernel-Based Distortion MeasuresKazuho Watanabe

Th1-6: Coding for Insertion and Deletion Channels 1 Chair: Joseph Jean Boutros K5Coding for the Permutation Channelwith Insertions, Deletions, Substitu-tions, and ErasuresMladen Kovačević, Vincent Tan

Perfect Codes for Single BalancedAdjacent DeletionsManabu Hagiwara

Timing-Drift Channel Model andMarker-Based Error Correction Cod-ingHaruhiko Kaneko

Limits to List Decoding of Insertionsand DeletionsAntonia Wachter-Zeh

Th1-7: Security 4 Chair: Lifeng Lai K6The Gelfand-Pinsker wiretap chan-nel: Higher secrecy rates via anovel superposition codeZiv Goldfeld, Paul Cuff, Haim Per-muter

The Gaussian Multiple Access Wire-tap Channel when the Eavesdrop-per can Arbitrarily JamRemi Chou, Aylin Yener

Secrecy Capacity of the First-OrderAutoregressive Moving AverageGaussian Channel with FeedbackChong Li, Yingbin Liang

Asymptotic Converse Bound for Se-cret Key Capacity in Hidden MarkovModelMohammad Reza Khalili Shoja,George Amariucai, Zhengdao Wang,Shuangqing Wei, Jing Deng

Th1-8: Quantum IT 4 Chair: Stefan Wolf K7+8Compression for quantum popula-tion codingYuxiang Yang, Ge Bai, Giulio Chiri-bella, Masahito Hayashi

Moderate Deviations for QuantumHypothesis Testing and a MartingaleInequalityHao-Chung Cheng, Min-Hsiu Hsieh

Classical-Quantum Arbitrarily Vary-ing Wiretap Channel: Secret Mes-sage Transmission under JammingAttacksMinglai Cai, Holger Boche, ChristianDeppe, Janis Noetzel

Quantum Markov Chains and Loga-rithmic Trace InequalitiesDavid Sutter, Mario Berta, MarcoTomamichel

Th1-9: Source Coding 4 Chair: Yasutada Oohama K9Distributed Task EncodingAnnina Bracher, Amos Lapidoth,Christoph Pfister

Performance Limits on the Clas-sification of Kronecker-structuredModelsIshan Jindal, Matthew Nokleby

The Redundancy Gains of AlmostLossless Universal Source Codingover Envelope FamiliesJorge Silva, Pablo Piantanida

Universal Sampling Rate DistortionVinay Praneeth Boda, PrakashNarayan

25

June 25 - June 30, 2017, Aachen, Germany

Thursday, June 29 11:30-12:5011:30 11:50 12:10 12:30Th2-1: Coding Techniques 3 Chair: Vladimir Sidorenko EuropaCooling Codes: Thermal-Management Coding for High-Performance InterconnectsTuvi Etzion, Alexander Vardy, YeowMeng Chee, Han Mao Kiah

Recursive Block Markov Superposi-tion Transmission of Short CodesShancheng Zhao, Qin Huang, XiaoMa, Baoming Bai

Complete Characterization of theSolvability of PAPR Reduction forOFDM by Tone ReservationHolger Boche, Ullrich Mönich, EzraTampubolon

Construction of q-ary ConstantWeight Sequences using a Knuth-like ApproachElie Ngomseu Mambou, Theo Swart

Th2-2: Locally Repairable Codes 3 Chair: P Vijay Kumar BrusselsBounds and Constructions for Lin-ear Locally Repairable Codes overBinary FieldsAnyu Wang, Zhifang Zhang, Dong-dai Lin

Locally Repairable Codes with Multi-ple(ri, δi)-LocalitiesBin Chen, Shutao Xia, Jie Hao

epsilon-MSR Codes with Small Sub-packetizationAnkit Singh Rawat, Itzhak Tamo,Venkatesan Guruswami, Klim Efre-menko

An Explicit, Coupled-Layer Con-struction of a High-Rate MSR Codewith Low Sub-Packetization Level,Small Field Size and d < (n − 1)Birenjith Sasidharan, Myna Vajha, PVijay Kumar

Th2-3: Multicell and Cloud Radio Chair: Salman Avestimehr K2An Upper Bound on the Sum Capac-ity of the Downlink Multicell Process-ing with Finite Backhaul CapacityTianyu Yang, Nan Liu, Wei Kang,Shlomo (Shitz) Shamai

Capacity Bounds on the Downlinkof Symmetric, Multi-Relay, SingleReceiver C-RAN NetworksShirin Saeedi Bidokhti, GerhardKramer, Shlomo (Shitz) Shamai

On the Capacity of Cloud RadioAccess NetworksShouvik Ganguly, Young-Han Kim

On the Capacity of Cloud RadioAccess Networks with ObliviousRelayingInaki Estella, Abdellatif Zaidi,Giuseppe Caire, Shlomo (Shitz)Shamai

Th2-4: Channel Capacity 3 Chair: Muriel Médard K3Intrinsic CapacityShengtian Yang, Rui Xu, Jun Chen,Jian-Kang Zhang

Gaussian Channels with MinimumAmplitude Constraints: When isOptimal Input Binary?Zhengwei Ni, Mehul Motani

On the Achievable Rate of Bandlim-ited Continuous-Time 1-Bit Quan-tized AWGN ChannelsSandra Bender, Meik Dörpinghaus,Gerhard Fettweis

Single-Bit Quantization of Binary-Input, Continuous-Output ChannelsBrian Kurkoski, Hideki Yagi

Th2-5: Estimation 1 Chair: H. Vincent Poor K4Lower Bounds on ParameterModulation-Estimation Under Band-width ConstraintsNir Weinberger, Neri Merhav

Multi-Layer Generalized Linear Esti-mationAndre Manoel, Florent Krzakala,Marc Mézard, Lenka Zdeborova

Minimax Optimal Estimators for Ad-ditive Scalar Functionals of DiscreteDistributionsKazuto Fukuchi, Jun Sakuma

I-MMSE relations in random linearestimation and a sub-extensive in-terpolation methodJean Barbier, Nicolas Macris

Th2-6: MIMO 3 Chair: Hamid Jafarkhani K5Multi-Antenna Coded CachingSeyed Pooya Shariatpanahi,Giuseppe Caire, Babak HosseinKhalaj

Optimally-Tuned NonparametricLinear Equalization for Massive MU-MIMO SystemsRamina Ghods, Charles Jeon, Gul-nar Mirza, Arian Maleki, ChristophStuder

Rate Bounds on 4-group fast decod-able space-time codeBharath Sethuraman

Th2-7: Security 5 Chair: Sidharth Jaggi K6Games on Linear DeterministicChannels with EavesdroppersRuijie Xu, Hao Ge, Randall Berry

A New Broadcast Wiretap ChannelModelMohamed Nafea, Aylin Yener

Secrecy-Reliability Tradeoff forSemi-Deterministic Wiretap Chan-nels at Finite BlocklengthWei Yang, Rafael Schaefer, H. Vin-cent Poor

On Secure Asymmetric MultilevelDiversity Coding SystemsCongduan Li, Xuan Guang, CheeWei Tan, Raymond W. Yeung

Th2-8: Compressed Sensing 3 Chair: Tareq Y. Al-Naffouri K7+8Dynamical Functional Theory forCompressed SensingBurak Çakmak, Manfred Opper, OleWinther, Bernard Fleury

Compressed Sensing under OptimalQuantizationAlon Kipnis, Galen Reeves, YoninaEldar, Andrea Goldsmith

Noisy Tensor Completion for Ten-sors with a Sparse CanonicalPolyadic FactorSwayambhoo Jain, AlexanderGutierrez, Jarvis Haupt

Compressed Sensing of Compress-ible SignalsSajjad Beygi, Shirin Jalali, ArianMaleki, Urbashi Mitra

Th2-9: Statistics 1 Chair: Andrew Barron K9Budget-Optimal Clustering viaCrowdsourcingRavi Kiran Raman, Lav Varshney

Universal Joint Image Clusteringand Registration using PartitionInformationRavi Kiran Raman, Lav Varshney

How to Find a Joint Probability Dis-tribution of Minimum Entropy (al-most) given the MarginalsFerdinando Cicalese, LuisaGargano, Ugo Vaccaro

On the Fundamental Statistical Limitof Community Detection in RandomHypergraphsChung-Yi Lin, I Chien, I-HsiangWang

26

ISIT 2017

Thursday, June 29 14:40-16:2014:40 15:00 15:20 15:40 16:00Th3-1: Coding Theory 3 Chair: Antonia Wachter-Zeh ⇒ Amsterdam ⇐Multiset combinatorial batchcodesHui Zhang, Eitan Yaakobi,Natalia Silberstein

Structured Spherical CodesWith Asymptotically OptimalDistance DistributionsRobert Taylor, Lamine Mili,Amir Zaghloul

Weight Spectrum of Quasi-Perfect Binary Codes withDistance 4Valentin Afanassiev, Alexan-der Davydov

Kronecker Product andTiling of Permutation Arraysfor Hamming DistancesSergey Bereg, Luis GerardoMojica de la Vega, LindaMorales, I. Hal Sudborough

Performance of SpinalCodes with Sliding WindowDecodingWeiqiang Yang, Ying Li,Xiaopu Yu

Th3-2: Coding for Distributed Storage 2 Chair: Joerg Kliewer BrusselsSecure Regenerating Codesfor Hybrid Cloud StorageSystemsIslam Samy, Gokhan Calis,O. Ozan Koyluoglu

Centralized Multi-Node Re-pair for Minimum StorageRegenerating CodesMarwen Zorgui, ZhiyingWang

GDSP: A Graphical Per-spective on the DistributedStorage SystemsSaeid Sahraei, MichaelGastpar

Distributed Storage Alloca-tion for Multi-Class DataKoosha PourtahmasiRoshandeh, Moslem Noori,Masoud Ardakani, ChinthaTellambura

Th3-3: Relaying Chair: Roy Yates K2The Capacity-distortionFunction for Multihop Chan-nels with StateAmir Salimi, Wenyi Zhang,Satish Vedantam, UrbashiMitra

The Geometry of the RelayChannelXiugang Wu, LeightonBarnes, Ayfer Özgür

The CF-DF Approach forRelay Networks Based onMultiple Descriptions withthe Shared BinningLeila Ghabeli

Th3-4: Guessing Chair: Neri Merhav K3Making RecommendationsBandwidth AwareLinqi Song, ChristinaFragouli

The Effect of Bias on theGuesswork of Hash Func-tionsYair Yona, Suhas Diggavi

Guessing With LimitedMemoryWasim Huleihel, SalmanSalamatian, Muriel Médard

Centralized vs Decentral-ized Multi-Agent GuessworkSalman Salamatian, AhmadBeirami, Asaf Cohen, MurielMédard

Th3-5: Detection and Estimation 3 Chair: Alfred Hero III K4Asymptotic Optimality ofD-CuSum for QuickestChange Detection underTransient DynamicsShaofeng Zou, GeorgiosFellouris, Venugopal Veer-avalli

Sketched CovarianceTesting: A Compression-Statistics TradeoffGautam Dasarathy, Parik-shit Shah, Richard Baraniuk

Error bounds for BregmanDenoising and StructuredNatural Parameter Estima-tionAmin Jalali, James Saunder-son, Maryam Fazel, BabakHassibi

On Random Sampling withNodes Attraction: The Caseof Gauss-Poisson ProcessFlavio Zabini, Gianni Pa-solini, Andrea Conti

Low-rank, Sparse and LineConstrained Estimation: Ap-plications to Target Trackingand ConvergenceAmr Elnakeeb, Urbashi Mi-tra

Th3-6: Multiple Access Feedback Chair: Lalitha Sankar K5Two-User Downlink Non-Orthogonal Multiple Accesswith Limited FeedbackXiaoyi Liu, Hamid Ja-farkhani

Role of Feedback in Modulo-Sum Computation over Era-sure Multiple-Access Chan-nelsI-Hsiang Wang, Shih-ChunLin, Yu-Chih Huang

On the Necessity of Struc-tured Codes for Commu-nications over MAC withFeedbackMohsen Heidari Khoozani,Farhad Shirani, SandeepPradhan

On the Gaussian MAC withStop-FeedbackLan Truong, Vincent Tan

Th3-7: Communications 3 Chair: Ralf Müller K6Probabilistic Shaping andNon-Binary CodesJoseph Jean Boutros,Fanny Jardel, Cyril Meas-son

Successive Local and Suc-cessive Global OmniscienceAnoosheh Heidarzadeh,Alex Sprintson

Noncoherent MassiveSpace-Time Codes withPSK Modulation for UplinkNetwork CommunicationsJian-Kang Zhang,Shuangzhi Li, Xiaomin Mu

FPLinQ: A CooperativeSpectrum Sharing Strat-egy for Device-to-DeviceCommunicationsKaiming Shen, Wei Yu

On the Effective Rate ofMISO/TAS Systems inRayleigh FadingYazan Al-Badarneh, CostasGeorghiades, Carlos Mejia

Th3-8: Compressed Sensing 4 Chair: Bernard Henri Fleury K7+8Generalized ExpectationConsistent Signal Recoveryfor Nonlinear MeasurementsHengtao He, Chao-Kai Wen,Shi Jin

Universality of the ElasticNet ErrorAndrea Montanari, PhanMinh Nguyen

Using Mutual Information forDesigning the MeasurementMatrix in Phase RetrievalProblemsNir Shlezinger, Ron Dabora,Yonina Eldar

Information Theoretic Limitsfor Linear Prediction withGraph-Structured SparsityAdarsh Barik, Jean Honorio,Mohit Tawarmalani

Improved Bounds for Uni-versal One-bit CompressiveSensingJayadev Acharya, ArnabBhattacharyya, Pritish Ka-math

Th3-9: Signal Processing Chair: Negar Kiyavash K9Principal Pivot Transformson Radix-2 DFT-type Matri-cesSian-Jheng Lin, Amira Al-loum, Tareq Y. Al-Naffouri

Adversarial Principal Com-ponent AnalysisDaniel Pimentel-Alarcon,Aritra Biswas, Claudia Solis-Lemus

Characterization of the sta-bility range of the Hilberttransform with applicationsto spectral factorizationHolger Boche, Volker Pohl

Mellin-Transform-BasedNew Results of the JointStatistics of Partial Prod-ucts of Ordered RandomVariablesSung Sik Nam, Young-ChaiKo, Mohamed-Slim Alouini

Optimal Sensor Selection inthe Presence of Noise andInterferenceAfshin Abdi, Faramarz Fekri

27

June 25 - June 30, 2017, Aachen, Germany

Thursday, June 29 16:40-18:2016:40 17:00 17:20 17:40 18:00Th4-1: Network Coding 2 Chair: Ron Roth ⇒ Amsterdam ⇐Circular-shift Linear NetworkCodingQifu Sun, Hanqi Tang, Zong-peng Li, Xiaolong Yang,Keping Long

Coding for Networks ofCompound ChannelsFariba Abbasi, Mayank Bak-shi

Distributed Decoding ofConvolutional Network ErrorCorrection CodesHengjie Yang, WangmeiGuo

Multiuser Rate-DiverseNetwork-Coded MultipleAccessHaoyuan Pan, Lu Lu, SoungChang Liew

Th4-2: Coded Computation Chair: Helmut Bölcskei BrusselsCoded convolution for par-allel and distributed comput-ing within a deadlineSanghamitra Dutta, ViveckCadambe, Pulkit Grover

Coded Computation overHeterogeneous ClustersAmirhossein Reisizadeh,Saurav Prakash, RamtinPedarsani, Salman Aves-timehr

Coded Computation for Mul-ticore SetupsKangwook Lee, RamtinPedarsani, Dimitris Papail-iopoulos, Kannan Ramchan-dran

High-Dimensional CodedMatrix MultiplicationKangwook Lee, ChanghoSuh, Kannan Ramchandran

Th4-3: Coded Caching 1 Chair: Giuseppe Caire K2Coded Caching with PartialAdaptive MatchingJad Hachem, Nikhil Karam-chandani, Sharayu Moharir,Suhas Diggavi

Improved Converses andGap-Results for CodedCachingChien-Yi Wang, ShirinSaeedi Bidokhti, MicheleWigger

Coded Caching for Combi-nation Networks with Cache-Aided RelaysAhmed Zewail, Aylin Yener

Asynchronous CodedCachingHooshang Ghasemi, AdityaRamamoorthy

Decentralized CodedCaching in Wireless Net-works: Trade-off betweenStorage and LatencyAntonious Girgis, OzgurErcetin, Mohammed Nafie,Tamer ElBatt

Th4-4: Shannon Theory and Molecular Chair: Olivier Leveque K3A Characterization of theShannon Ordering of Com-munication ChannelsRajai Nasser

On the Input-Degradednessand Input-Equivalence Be-tween ChannelsRajai Nasser

Models and information-theoretic bounds fornanopore sequencingWei Mao, Suhas Diggavi,Sreeram Kannan

Less Noisy Domination bySymmetric ChannelsAnuran Makur, Yury Polyan-skiy

Capacity of Molecular Chan-nels with Imperfect Particle-Intensity Modulation andDetectionNariman Farsad, Christo-pher Rose, Muriel Médard,Andrea Goldsmith

Th4-5: Bounds 3 Chair: I-Hsiang Wang K4Information-theoretic Limitsof Subspace ClusteringKwangjun Ahn, KangwookLee, Changho Suh

The Error Exponent ofSparse Regression Codeswith AMP DecodingCynthia Rush, RamjiVenkataramanan

Lower Bounds on the Num-ber of Write Operations byIndex-less Indexed FlashCode with Inversion CellsAkira Yamawaki, HiroshiKamabe, Shan Lu

Partial Data Extraction viaNoisy Histogram Queries:Information TheoreticBoundsWei-Ning Chen, I-HsiangWang

Asymptotics of the ErrorProbability in Quasi-StaticBinary Symmetric ChannelsJosep Font-Segura, AlfonsoMartinez, Albert Guillén iFàbregas

Th4-6: Wireless Networks 2 Chair: Randall Berry K5Commitment in regulatoryspectrum games: Examin-ing the first-player advan-tageVidya Muthukumar, AnantSahai

Inferring Network Topologyfrom Information CascadesFeng Ji, Wenchang Tang,Wee Peng Tay, EdwinChong

Statistical beamforming forthe large antenna broadcastchannelVasanthan Raghavan, JunilChoi, David Love

Efficient Resource Alloca-tion in Mobile-edge Compu-tation Offloading: Comple-tion Time MinimizationQuy Hong Le, Hussein Al-Shatri, Anja Klein

Scalable Spectrum Allo-cation for Large NetworksBased on Sparse Optimiza-tionBinnan Zhuang, DongningGuo, Ermin Wei, MichaelHonig

Th4-7: Random Access Channels Chair: Robert Calderbank K6A perspective on massiverandom-accessYury Polyanskiy

Low Complexity Schemesfor the Random AccessGaussian ChannelOr Ordentlich, Yury Polyan-skiy

Multi-Cell Aware Opportunis-tic Random AccessHuifa Lin, Won-Yong Shin

Multi-Channel Random Ac-cess with ReplicationsOlga Galinina, Andrey Tur-likov, Sergey Andreev, Yev-geni Koucheryavy

Th4-8: Index Coding 1 Chair: Lawrence Ong K7+8Private Broadcasting: anIndex Coding ApproachMohammed Karmoose,Linqi Song, Martina Car-done, Christina Fragouli

Golden-Coded Index Cod-ingYu-Chih Huang, Yi Hong,Emanuele Viterbo

Generalized Index CodingProblem and Discrete Poly-matroidsAnoop Thomas, B. SundarRajan

A Pliable Index Coding Ap-proach to Data ShufflingLinqi Song, ChristinaFragouli, Tianchu Zhao

Th4-9: Compression 2 Chair: Stefano Rini K9Fixed-Length-Parsing Uni-versal Compression withSide InformationYeohee Im, Sergio Verdú

Coding Theorems for theCompress and EstimateSource Coding ProblemAlon Kipnis, Stefano Rini,Andrea Goldsmith

Row-centric lossless com-pression of Markov imagesMatthew Reyes, DavidNeuhoff

A Practical Approach forSuccessive OmniscienceNi Ding, Rodney Kennedy,Parastoo Sadeghi

28

ISIT 2017

Friday, June 30 09:50-11:109:50 10:10 10:30 10:50Fr1-1: Lattice Codes 2 Chair: Robert Fischer EuropaOn the Universality of Lattice Codesfor a Class of Ergodic Fading Chan-nelsAhmed Hindy, Aria Nosratinia

Index Mapping for Bit-error ResilientMultiple Description Lattice VectorQuantizerSorina Dumitrescu, Yifang Chen,Jun Chen

On Shaping Complex Lattice Con-stellations from Multi-level Construc-tionsPerathorn Pooksombat, J Harshan,Wittawat Kositwattanarerk

On the Design of Multi-DimensionalIrregular Repeat-Accumulate LatticeCodesMin Qiu, Lei Yang, Yixuan Xie, Jin-hong Yuan

Fr1-2: Polar Codes 3 Chair: Peter Trifonov BrusselsPerformance Bounds of Concate-nated Polar Coding SchemesDina Goldin, David Burshtein

Energy-Adaptive Polar Codes: Trad-ing Off Reliability and Decoder Cir-cuit EnergyHaewon Jeong, Christopher Blake,Pulkit Grover

Polar codes with a stepped bound-aryIlya Dumer

Permuted Successive CancellationDecoding for Polar CodesSarit Buzaglo, Arman Fazeli,Veeresh Taranalli, Paul Siegel,Alexander Vardy

Fr1-3: Multiple Access 3 Chair: Young-Han Kim K2On the Degrees of Freedom ofWide-Band Multi-Cell Multiple Ac-cess Channels With No CSITYo-Seb Jeon, Namyoon Lee, RaviTandon

Low-Density Code-Domain NOMA:Better Be RegularOri Shental, Benjamin Zaidel,Shlomo (Shitz) Shamai

Capacity Region of a One-Bit Quan-tized Gaussian Multiple AccessChannelBorzoo Rassouli, Deniz Gündüz,Morteza Varasteh

On OR Many-Access ChannelsWenyi Zhang, Lingyan Huang

Fr1-4: Information Retrieval Chair: Eitan Yaakobi K3Improved Codes for List Decodingin the Levenshtein’s channel andInformation RetrievalTero Laihonen, Tuomo Lehtilä

Binary, Shortened Projective ReedMuller Codes for Coded PrivateInformation RetrievalMyna Vajha, Vinayak Ramkumar, PVijay Kumar

Sparse Ternary Codes for similaritysearch have higher coding gain thandense binary codesSohrab Ferdowsi, SviatoslavVoloshynovskiy, Dimche Kostadi-nov, Taras Holotyak

PIR Array Codes with Optimal PIRRatesTuvi Etzion, Simon Blackburn

Fr1-5: Information Dynamics Chair: Anant Sahai K4The Capacity of Unstable DynamicalSystems-Interaction of Control andInformation TransmissionIoannis Tzortzis, Charalambos Char-alambous, Christos Kourtellaris,Sergey Loyka

Optimal Quantizations of B-DMCsMaximizing α-Mutual Informationwith Monge PropertyYuta Sakai, Ken-ichi Iwata

Information and estimation inFokker-Planck channelsAndre Wibisono, Varun Jog, Po-LingLoh

Dynamical Systems, Ergodicity, andPosterior MatchingTodd Coleman

Fr1-6: Coding for Insertion and Deletion Channels 2 Chair: Vahid Aref K5Asymptotically Optimal Sticky-Insertion-Correcting Codes withEfficient Encoding and DecodingHessam Mahdavifar, AlexanderVardy

Permutation Codes Correcting aSingle Burst Deletion II: Stable Dele-tionsYeow Meng Chee, San Ling,Tuan Thanh Nguyen, Van Khu Vu,Hengjia Wei

Guess & Check Codes for Deletionsand SynchronizationSerge Kas Hanna, Salim El Rouay-heb

On Unique Decoding from InsertionErrorsKayvon Mazooji

Fr1-7: Security 6 Chair: Oliver Kosut K6Characterizing Optimal Security andRound-Complexity for Secure OREvaluationAmisha Jhanji, Hemanta Maji,Raphael Meyer

Learning Adversary’s Actions forSecret CommunicationMehrdad Tahmasbi, Matthieu Bloch,Aylin Yener

On the Equivalency of Reliabilityand Security Metrics for WirelineNetworksMohammad mahdi Mojahedian,Amin Gohari, Mohammad RezaAref

A code-based blind signatureOlivier Blazy, Philippe Gaborit,Julien Schrek, Nicolas Sendrier

Fr1-8: Multiple Access Chair: Richard Wesel K7+8Asymptotic Analysis of Tone Reser-vation Method for the PAPR Reduc-tion of CDMA SystemsHolger Boche, Ezra Tampubolon

Spatial random multiple access withmultiple departureSerguei Foss, Andrey Turlikov,Maxim Grankin

Coded Random Access Design forConstrained OutageMohammadReza Ebrahimi, FarshadLahouti, Victoria Kostina

Fr1-9: Channel Identification Chair: Kenta Kasai K9On Optimal Error Exponents inNoiseless Channel IdentificationMarat Burnashev, Hirosuke Ya-mamoto

Channel Resolvability Theorems forGeneral Sources and ChannelsHideki Yagi

Hierarchical Identification with Pre-processingMinh Thanh Vu, Tobias Oechtering,Mikael Skoglund

Mismatched Identification via Chan-nelsAnelia Somekh-Baruch

29

June 25 - June 30, 2017, Aachen, Germany

Friday, June 30 11:30-12:5011:30 11:50 12:10 12:30Fr2-1: Rank Metric Codes Chair: Sven Puchinger EuropaOn Decoding Rank-Metric Codesover Large FieldsRon Roth

Universal secure rank-metric codingschemes with optimal communica-tion overheadsUmberto Martínez-Peñas

MRD Rank Metric ConvolutionalCodesDiego Napp, Raquel Pinto, JoachimRosenthal, Paolo Vettori

A decoding algorithm for TwistedGabidulin codesTovohery Randrianarisoa, JoachimRosenthal

Fr2-2: Iterative Decoding 2 Chair: Yuval Cassuto BrusselsAn Iterative Soft-decision DecodingAlgorithm for Reed-Solomon CodesHuang Chang Lee, Jyun-Han Wu,Yeong-Luh Ueng, Chung-HsuanWang

Decoding from Pooled Data: PhaseTransitions of Message PassingAhmed El Alaoui, Aaditya Ramdas,Florent Krzakala, Lenka Zdeborova,Michael Jordan

Topological Interference Manage-ment with Decoded Message Pass-ing: A Polyhedral ApproachXinping Yi, Giuseppe Caire

Fr2-3: Coded Caching 2 Chair: Petros Elia K2Decentralized Caching and CodedDelivery over Gaussian BroadcastChannelsMohammad Mohammadi Amiri,Deniz Gündüz

Low Subpacketization Schemes forCoded CachingLi Tang, Aditya Ramamoorthy

On Coded Caching in the Over-loaded MISO Broadcast ChannelEnrico Piovano, Hamdi Joudeh,Bruno Clerckx

Coded Caching with Linear Sub-packetization is Possible usingRuzsa-Szeméredi GraphsKarthikeyan Shanmugam, AntoniaTulino, Alexandros Dimakis

Fr2-4: Channel Capacity 4 Chair: Hideki Yagi K3The Arbitrarily Varying Channel Un-der Constraints with Causal SideInformation at the EncoderUzi Pereg, Yossef Steinberg

Storage Capacity as an Information-Theoretic Analogue of Vertex CoverArya Mazumdar, Andrew McGregor,Sofya Vorotnikova

Gaussian ISI Channels with Mis-matchWasim Huleihel, Salman Salama-tian, Neri Merhav, Muriel Médard

Characterization of Super-Additivityand Discontinuity Behavior of theCapacity of Arbitrarily Varying Chan-nels under List DecodingHolger Boche, Rafael Schaefer, H.Vincent Poor

Fr2-5: Communications 4 Chair: Remi Chou K4Optimal Covert Communicationsusing Pulse-Position ModulationMatthieu Bloch, Saikat Guha

Covert Communication with Non-causal Channel-State Information atthe TransmitterSi-Hyeon Lee, Ligong Wang, AshishKhisti, Gregory Wornell

Strong Coordination of Signals andActions over Noisy ChannelsGiulia Cervia, Laura Luzzi, Mael LeTreust, Matthieu Bloch

Strong Coordination over NoisyChannels: Is Separation Sufficient?Sarah Obead, Badri Vellambi, JoergKliewer

Fr2-6: Coding and Decoding Chair: Hessam Mahdavifar K5Universal Decoding Using a NoisyCodebookNeri Merhav

Variable-to-Fixed Length Homo-phonic Coding Suitable for Asym-metric Channel CodingJunya Honda, Hirosuke Yamamoto

Optimality of the recursive data ex-change protocolHimanshu Tyagi, Shun Watanabe

Explicit Constructions of Finite-Length WOM CodesYeow Meng Chee, Han Mao Kiah,Alexander Vardy, Eitan Yaakobi

Fr2-7: Privacy and Security Chair: Philippe Gaborit K6On Information-Theoretic Privacywith General Distortion Cost Func-tionsKousha Kalantari, Lalitha Sankar,Oliver Kosut

Impact of the Communication Chan-nel on Information Theoretical Pri-vacyMehmet Demir, Gunes Karabu-lut Kurt, Guido Dartmann, VolkerLücken, Gerd Ascheid

Constructive Interference BasedSecure PrecodingMuhammad Khandaker, ChristosMasouros, Kai Kit Wong

Secure and reliable connectivityin heterogeneous wireless sensornetworksRashad Eletreby, Osman Yağan

Fr2-8: Computation Chair: Anelia Somekh-Baruch K7+8Communication-Aware Computingfor Edge ProcessingSongze Li, Mohammad Ali Maddah-Ali, Salman Avestimehr

Encoded Distributed OptimizationCan Karakus, Yifan Sun, SuhasDiggavi

Fundamental Estimation Limitsin Autoregressive Processes withCompressive MeasurementsMilind Rao, Tara Javidi, Yonina El-dar, Andrea Goldsmith

Minimizing Latency for Secure Dis-tributed ComputingRawad Bitar, Parimal Parag, SalimEl Rouayheb

30

ISIT 2017

Friday, June 30 14:40-16:2014:40 15:00 15:20 15:40 16:00Fr3-1: Codes and Graphs Chair: Norbert Goertz EuropaOn sparse graph coding forcoherent and noncoherentdemodulationCharles-Ugo Piat-Durozoi,Charly Poulliat, NathalieThomas, Marie-LaureBoucheret, Guy Lesthievent

The Number of IndependentSets In Hexagonal GraphsZhun Deng, Jie Ding,Kathryn Heal, Vahid Tarokh

Density Evolution on aClass of Smeared RandomGraphsKabir Chandrasekher,Orhan Ocal, Kannan Ram-chandran

Connectivity of inhomoge-neous random key graphsintersecting inhomogeneousErdős-Rényi graphsRashad Eletreby, OsmanYağan

Fr3-2: LDPC Codes 3 Chair: Boris Kudryashov BrusselsMessage Alignment for Dis-crete LDPC Decoders withQuadrature Amplitude Mod-ulationJan Lewandowsky, Maximil-ian Stark, Gerhard Bauch

Rate-Loss Reduction of SC-LDPC Codes by OptimizingReliable Variable Nodes viaExpected Graph EvolutionHeeyoul Kwak, Jaewha Kim,Jong-Seon No

Compute-Forward MultipleAccess (CFMA) with NestedLDPC CodesErixhen Sula, Jingge Zhu,Adriano Pastore, SungHoon Lim, Michael Gastpar

Edge Spreading Design ofHigh Rate Array-Based SC-LDPC CodesDavid Mitchell, Eirik Rosnes

LDPC Code Design for Cor-related Sources using EXITChartsMohamad. Khas, HamidSaeedi, Reza Asvadi

Fr3-3: Caching 3 Chair: Aditya Ramamoorthy K2Fundamental Limits of Dis-tributed Caching in MultihopD2D Wireless NetworksMingyue Ji, Rong-RongChen, Giuseppe Caire, An-dreas Molisch

Fundamental Limits on La-tency in Transceiver Cache-Aided HetNetsJaber Kakar, SoheilGherekhloo, Aydin Sezgin

Cache-Aided Cooperationwith No CSITEleftherios Lampiris,Jingjing Zhang, Petros Elia

Fr3-4: Entropy 3 Chair: Peter Harremoes K3Arimoto-Renyi ConditionalEntropy and Bayesian Hy-pothesis TestingIgal Sason, Sergio Verdú

Rényi Entropy Rate of Hid-den Markov ProcessesChengyu Wu, ’Easton’ Li Xu,Guangyue Han

Sharp Bounds on Arimoto’sConditional Rényi EntropiesBetween Two Distinct Or-dersYuta Sakai, Ken-ichi Iwata

Minimax Rényi RedundancySemih Yagli, Yücel Altuğ,Sergio Verdú

Infinity-Rényi entropy powerinequalitiesPeng Xu, James Melbourne,Mokshay Madiman

Fr3-5: Machine Learning 2 Chair: Parimal Parag K4Noisy Inductive Matrix Com-pletion Under Sparse FactorModelsAkshay Soni, Troy Chevalier,Swayambhoo Jain

On the Problem of On-lineLearning with Log-LossYaniv Fogel, Meir Feder

Multiclass MinMax RankAggregationPan Li, Olgica Milenkovic

Adiabatic Persistent Con-trastive Divergence Learn-ingHyeryung Jang, HyungwonChoi, Yung Yi, Jinwoo Shin

Online NonparametricAnomaly Detection basedon Geometric Entropy Mini-mizationYasin Yilmaz

Fr3-6: Estimation 2 Chair: Laura Cottatellucci K5Spectral Initialization forNonconvex Estimation:High-Dimensional Limit andPhase TransitionsYue Lu, Gen Li

Jackknife estimation forMarkov processes with nomixing constraintsKevin Oshiro, ChanglongWu, Narayana Prasad San-thanam

Minimax Risk for MissingMass EstimationNikhilesh Rajaraman, An-drew Thangaraj, AnandaSuresh

Fr3-7: Information Theory and Statistics 2 Chair: Himanshu Tyagi K6Ensemble Estimation ofMutual InformationKevin Moon, Kumar Sricha-ran, Alfred Hero III

Minimum Rates of Approxi-mate Sufficient StatisticsMasahito Hayashi, VincentTan

Information-theoretic char-acterizations of Markov ran-dom fields and subfieldsRaymond W. Yeung, Ali Al-Bashabsheh, Chao Chen,Qi Chen, Pierre Moulin

Conditional Central LimitTheorems for GaussianProjectionsGalen Reeves

An Information TheoreticAnalysis of SequentialDecision-MakingMeik Dörpinghaus, ÉdgarRoldán, Izaak Neri, HeinrichMeyr, Frank Jülicher

Fr3-8: Index Coding 2 Chair: Guido Montorsi K7+8On the Capacity for Dis-tributed Index CodingYucheng Liu, ParastooSadeghi, Fatemeh Arbab-jolfaei, Young-Han Kim

Improved Bounds for Multi-Sender Index CodingMin Li, Lawrence Ong,Sarah Johnson

Uniprior Index CodingVijaya Kumar Mareedu,Prasad Krishnan

Rate 13 Index Coding: For-

bidden and Feasible Config-urationsLalitha Vadlamani, PrasadKrishnan

Fr3-9: Statistics 2 Chair: Raymond W. Yeung K9Divergence Scaling of Fixed-Length, Binary-Output, One-to-one Distribution MatchingPatrick Schulte, BernhardGeiger

Lower Bounds on the Min-imax Risk for the SourceLocalization ProblemPraveen Venkatesh, PulkitGrover

On the Optimality of SomeGroup Testing AlgorithmsMatthew Aldridge

Measurement DependentNoisy Search: The Gaus-sian CaseAnusha Lalitha, Nancy Ron-quillo, Tara Javidi

Scalable Multichannel JointSequential Change Detec-tion and IsolationSourabh Banerjee, Geor-gios Fellouris

31

June 25 - June 30, 2017, Aachen, Germany

Friday, June 30 16:40-18:0016:40 17:00 17:20 17:40Fr4-1: Coding Theory 4 Chair: Hans-Andrea Loeliger EuropaA New Approach for Constructingand Decoding Maximum Rank Dis-tance CodesHessam Mahdavifar

Individually-Secure Multi-SourceMulticastAlejandro Cohen, Asaf Cohen,Omer Gurewitz, Muriel Médard

Lattice coding for Rician fadingchannels from Hadamard rotationsAlex Karrila, Niko Väisänen, DavidKarpuk, Camilla Hollanti

Fr4-2: DNA and Coding Chair: Olgica Milenkovic BrusselsMutually Uncorrelated Codes forDNA StorageMaya Levy, Eitan Yaakobi

Noise and Uncertainty in String-Duplication SystemsSiddharth Jain, Farzad Farnoud(Hassanzadeh), Moshe Schwartz,Jehoshua Bruck

Rank Modulation Codes for DNAStorageNetanel Raviv, Moshe Schwartz,Eitan Yaakobi

Fundamental Limits of DNA StorageSystemsReinhard Heckel, Ilan Shomorony,Kannan Ramchandran, David Tse

Fr4-3: Error Exponents Chair: Meir Feder K2Distributed Identity Testing withZero-Rate CompressionWenwen Zhao, Lifeng Lai

Exponential source/channel dualitySergey Tridenski, Ram Zamir

Error Exponents for Sparse Commu-nicationLóránt Farkas, Tamás Kói, ImreCsiszár

Universal Random Access ErrorExponents for Codebooks with Dif-ferent Word-LengthsLóránt Farkas, Tamás Kói

Fr4-4: Bounds 4 Chair: Itzhak Tamo K3Bounds on the Rate and MinimumDistance of Codes with AvailabilityBalaji Srinivasan Babu, P Vijay Ku-mar

Improved existence bounds on IPPcodes using the Clique Lovász Lo-cal LemmaCástor Aranda, Marcel Fernández

Explicit bounds on the length ofoptimal X-codesYu Tsunoda, Yuichiro Fujiwara

A convolution inequality for entropyover Z2Varun Jog

Fr4-5: Shannon Theory and Applications Chair: Sergio Verdú K4Topological Structures on DMCspacesRajai Nasser

A Strong Data Processing Inequalityfor Thinning Poisson Processes andSome ApplicationsLigong Wang

Continuity of Channel Parametersand Operations under Various DMCTopologiesRajai Nasser

SCW Codes for Optimal CSI-FreeDetection in Diffusive MolecularCommunicationsVahid Jamali, Arman Ahmadzadeh,Nariman Farsad, Robert Schober

Fr4-6: Quantum IT 5 Chair: Masahito Hayashi K5Pretty good measures in quantuminformation theoryRaban Iten, Joseph Renes, DavidSutter

Linear Programming Bounds forEntanglement-Assisted QuantumCodesChing-Yi Lai, Alexei Ashikhmin

Estimating the Information Rate ofa Channel with Classical Input andOutput and a Quantum StateMichael Cao, Pascal Vontobel

Fundamental limits of quantum-secure covert optical sensingBoulat Bash, Christos Gagatsos,Animesh Datta, Saikat Guha

Fr4-7: Source Coding 5 Chair: Galen Reeves K6Source Coding with Distortion Pro-file ConstraintsPierre Moulin

Lower Bounds on Rate of Fixed-Length Source Codes underAverage- and ϵ-Fidelity ConstraintsPierre Moulin

Enhanced MDL with Application toAtypicalityElyas Sabeti, Anders Høst-Madsen

Distributed Coding of MultispectralImagesMaxim Goukhshtein, PetrosBoufounos, Toshiaki Koike-Akino,Stark Draper

32

ISIT 2017

Notes

33

June 25 - June 30, 2017, Aachen, Germany

Notes

34

ISIT 2017

Notes

35

June 25 - June 30, 2017, Aachen, Germany