default search action
ISIT 2016: Barcelona, Spain
- IEEE International Symposium on Information Theory, ISIT 2016, Barcelona, Spain, July 10-15, 2016. IEEE 2016, ISBN 978-1-5090-1806-2
Mo-AM-1-1: Lossless Source Coding
- Jorge F. Silva, Pablo Piantanida:
Almost lossless variable-length source coding on countably infinite alphabets. 1-5 - Weihua Hu, Hirosuke Yamamoto, Junya Honda:
Tight upper bounds on the redundancy of optimal binary AIFV codes. 6-10 - Hidetoshi Yokoo:
On the stationary distribution of Asymmetric Binary Systems. 11-15 - John C. Kieffer:
A survey of Bratteli information source theory. 16-20
Mo-AM-1-2: Change-Point Detection
- Husheng Li:
Data driven quickest change detection: An algorithmic complexity approach. 21-25 - George V. Moustakides, Venugopal V. Veeravalli:
Sequentially detecting transitory changes. 26-30 - Jie Chen, Wenyi Zhang, H. Vincent Poor:
Non-bayesian multiple change-point detection controlling false discovery rate. 31-35 - Sourabh Banerjee, Georgios Fellouris:
Decentralized sequential change detection with ordered CUSUMs. 36-40
Mo-AM-1-3: Polar Codes 1
- Song-Nam Hong, Dennis Hui, Ivana Maric:
Capacity-achieving rate-compatible polar codes. 41-45 - Bin Li, David Tse, Kai Chen, Hui Shen:
Capacity-achieving rateless polar codes. 46-50 - Talha Cihad Gülcü, Min Ye, Alexander Barg:
Construction of polar codes for arbitrary discrete memoryless channels. 51-55 - Maxim Raginsky:
Channel polarization and Blackwell measures. 56-60
Mo-AM-1-4: Distributed Storage 1
- Netanel Raviv, Natalia Silberstein, Tuvi Etzion:
Constructions of high-rate minimum storage regenerating codes over small fields. 61-65 - Hyuk Lee, Jungwoo Lee:
An outer bound on the storage-bandwidth tradeoff of exact-repair cooperative regenerating codes. 66-70 - Muralee Nikhil Krishnan, P. Vijay Kumar:
On MBR codes with replication. 71-75 - Arman Fazeli, Sreechakra Goparaju, Alexander Vardy:
Minimum storage regenerating codes for all parameters. 76-80
Mo-AM-1-5: Matrix Completion
- Yanjun Li, Kiryung Lee, Yoram Bresler:
Optimal sample complexity for stable matrix recovery. 81-85 - James Saunderson, Maryam Fazel, Babak Hassibi:
Simple algorithms and guarantees for low rank matrix completion over F2. 86-90 - Ramya Korlakai Vinayak, Babak Hassibi:
Similarity clustering in the presence of outliers: Exact recovery via convex program. 91-95 - Daniel L. Pimentel-Alarcón, Robert D. Nowak:
A converse to low-rank matrix completion. 96-100
Mo-AM-1-6: Sequences 1
- Tor Helleseth, Alexander Kholosha:
New ternary binomial bent functions. 101-104 - Min Kyu Song, Hong-Yeop Song, Dae San Kim, Jang Yong Lee:
Correlation properties of sequences from the 2-D array structure of Sidelnikov sequences of different lengths and their union. 105-109 - Sihem Mesnager:
On constructions of bent functions from involutions. 110-114 - Xinjiao Chen, Chunlei Li, Chunming Rong:
Perfect Gaussian integer sequences from cyclic difference sets. 115-119
Mo-AM-1-7: Index Coding 1
- Linqi Song, Christina Fragouli:
A polynomial-time algorithm for pliable index coding. 120-124 - Mahesh Babu Vaddi, B. Sundar Rajan:
Optimal vector linear index codes for some symmetric side information problems. 125-129 - Prasad Krishnan, V. Lalitha:
A class of index coding problems with rate 1/3. 130-134 - Kai Wan, Daniela Tuninetti, Pablo Piantanida:
On caching with more users than files. 135-139
Mo-AM-1-8: Multi-Terminal Source Coding 1
- Yaoqing Yang, Pulkit Grover, Soummya Kar:
Coding for lossy function computation: Analyzing sequential function computation with distortion accumulation. 140-144 - Jhelum Chakravorty, Aditya Mahajan:
Structural results for two-user interactive communication. 145-149 - Ebrahim MolavianJazi, Aylin Yener:
Two-way lossy compression via a relay with self source. 150-154 - Wenbo He, Bobak Nazer:
Integer-forcing source coding: Successive cancellation and source-channel duality. 155-159
Mo-AM-1-9: Broadcast Channels
- Shih-Chun Lin, I-Hsiang Wang:
Single-user CSIT can be quite useful for state-dependent broadcast channels. 160-164 - Ahmed Attia Abotabl, Aria Nosratinia:
Bit-additive superposition coding for the bandwidth limited broadcast channel. 165-169 - Silas L. Fong, Vincent Y. F. Tan:
A proof of the strong converse theorem for Gaussian broadcast channels via the Gaussian Poincaré inequality. 170-174 - Behzad Asadi, Lawrence Ong, Sarah J. Johnson:
A unified inner bound for the two-receiver memoryless broadcast channel with channel state and message side information. 175-179
Mo-AM-2-1: Approximate Message Passing
- Charles Jeon, Arian Maleki, Christoph Studer:
On the performance of mismatched data detection in large MIMO systems. 180-184 - Yash Deshpande, Emmanuel Abbe, Andrea Montanari:
Asymptotic mutual information for the binary stochastic block model. 185-189 - Alyson K. Fletcher, Mojtaba Sahraee-Ardakan, Sundeep Rangan, Philip Schniter:
Expectation consistent approximate inference: Generalizations and convergence. 190-194
Mo-AM-2-2: Constrained Coding 1
- Vitaly Skachek, Kees A. Schouhamer Immink:
Minimum pearson distance detection in the presence of unknown slowly varying offset. 195-199 - Yeow Meng Chee, Johan Chrisnata, Han Mao Kiah, San Ling, Thanh Thanh Nguyen, Van Khu Vu:
Rates of constant-composition codes that mitigate intercell interference. 200-204 - Yeow Meng Chee, Johan Chrisnata, Han Mao Kiah, San Ling, Thanh Thanh Nguyen, Van Khu Vu:
Efficient encoding/decoding of capacity-achieving constant-composition ICI-free codes. 205-209 - Chaitanya Kumar Matcha, Mohsen Bahrami, Shounak Roy, Shayan Garani Srinivasa, Bane Vasic:
Generalized belief propagation based TDMR detector and decoder. 210-214
Mo-AM-2-3: Polar Codes 2
- Henry D. Pfister, Rüdiger L. Urbanke:
Near-optimal finite-length scaling for polar codes over large alphabets. 215-219 - Christian Schürch:
A partial order for the synthesized channels of a polar code. 220-224 - Eren Sasoglu, Ido Tal:
Polar coding for processes with memory. 225-229 - Magali Bardet, Vlad Dragoi, Ayoub Otmani, Jean-Pierre Tillich:
Algebraic properties of polar codes from a new polynomial formalism. 230-234
Mo-AM-2-4: Distributed Storage 2
- Kaveh Mahdaviani, Ashish Khisti, Soheil Mohajer:
Bandwidth adaptive & error resilient regenerating codes with minimum repair bandwidth. 235-239 - Moslem Noori, Emina Soljanin, Masoud Ardakani:
On storage allocation for maximum service rate in distributed storage systems. 240-244 - Yuchong Hu, Patrick P. C. Lee, Xiaoyang Zhang:
Double Regenerating Codes for hierarchical data centers. 245-249 - Rami Cohen, Yuval Cassuto:
Placement and read algorithms for high throughput in coded network switches. 250-254
Mo-AM-2-5: Information Theory in Biology 1
- Abram Magner, Daisuke Kihara, Wojciech Szpankowski:
The Boltzmann sequence-structure channel. 255-259 - Noga Alon, Jehoshua Bruck, Farzad Farnoud, Siddharth Jain:
On the duplication distance of binary strings. 260-264 - Shirshendu Ganguly, Elchanan Mossel, Miklós Z. Rácz:
Sequence assembly from corrupted shotgun reads. 265-269 - Ohad Elishco, Farzad Farnoud, Moshe Schwartz, Jehoshua Bruck:
The capacity of some Pólya string models. 270-274
Mo-AM-2-6: Wireless Communications 1
- Mohamed Fadel, Aria Nosratinia:
Broadcast channel under unequal coherence intervals. 275-279 - Derya Malak, Mazin Al-Shalash, Jeffrey G. Andrews:
Optimizing the spatial content caching distribution for device-to-device communications. 280-284 - Ejder Bastug, Mehdi Bennis, Marios Kountouris, Mérouane Debbah:
Edge caching for coverage and capacity-aided heterogeneous networks. 285-289 - Changho Suh, David Tse, Jaewoong Cho:
To feedback or not to feedback. 290-294
Mo-AM-2-7: Feedback 1
- Jui Wu, Achilleas Anastasopoulos:
On the capacity of the chemical channel with feedback. 295-299 - Photios A. Stavrou, Charalambos D. Charalambous, Christos K. Kourtellaris:
Sequential Necessary and Sufficient Conditions for optimal channel input distributions of channels with memory and feedback. 300-304 - Rana Abbas, Mahyar Shirvanimoghaddam, Yonghui Li, Branka Vucetic:
Analysis on LT codes for unequal recovery time with complete and partial feedback. 305-309 - Oron Sabag, Haim H. Permuter, Henry D. Pfister:
A single-letter upper bound on the feedback capacity of unifilar finite-state channels. 310-314
Mo-AM-2-8: Multiple Antennas 1
- Seok-Hwan Park, Osvaldo Simeone, Shlomo Shamai:
Joint optimization of cloud and edge processing for fog radio access networks. 315-319 - An Liu, Vincent K. N. Lau:
Sum capacity of massive MIMO systems with quantized hybrid beamforming. 320-324 - Sergey Loyka:
The capacity of Gaussian MISO channels under total and per-antenna power constraints. 325-329 - Giuseppa Alfano, Carla-Fabiana Chiasserini, Alessandro Nordio:
SNR gap between MIMO linear receivers: Characterization and applications. 330-334
Mo-AM-2-9: Multiple Access Channels 1
- Per Austrin, Petteri Kaski, Mikko Koivisto, Jesper Nederlof:
Sharper upper bounds for unbalanced Uniquely Decodable Code Pairs. 335-339 - Parham Noorzad, Michelle Effros, Michael Langberg:
The unbounded benefit of encoder cooperation for the k-user MAC. 340-344 - Austin Taghavi, Avinash Vem, Jean-François Chamberland, Krishna R. Narayanan:
On the design of universal schemes for massive uncoordinated multiple access. 345-349 - Siu-Wai Ho, Chi Wan Sung:
Uncoordinated multiple access schemes for visible light communications and positioning. 350-354
Mo-PM-1-1: Point Process Channels
- Ligong Wang:
On the continuous-time Poisson channel with varying dark current known to the transmitter. 355-359 - Nirmal V. Shende, Aaron B. Wagner:
The stochastic-calculus approach to multi-receiver poisson channels. 360-364 - Guido Carlo Ferrante, Tony Q. S. Quek, Moe Z. Win:
An achievable rate region for superposed timing channels. 365-369 - Guido Carlo Ferrante, Tony Q. S. Quek, Moe Z. Win:
Timing capacity of queues with random arrival and modified service times. 370-374 - Ain Ul Aisha, Yingbin Liang, Lifeng Lai, Shlomo Shamai:
On the sum-rate capacity of non-symmetric Poisson multiple access channel. 375-379
Mo-PM-1-2: Constrained Coding 2
- Elie N. Mambou, Theo G. Swart:
Encoding and decoding of balanced q-ary sequences using a Gray code prefix. 380-384 - Jos H. Weber, Theo G. Swart, Kees A. Schouhamer Immink:
Simple systematic Pearson coding. 385-389 - Ryan Gabrys, Olgica Milenkovic:
Balanced permutation codes. 390-394 - Ohad Elishco, Tom Meyerovitch, Moshe Schwartz:
Encoding semiconstrained systems. 395-399 - Tadashi Wadayama, Taisuke Izumi:
Bounds on asymptotic rate of capacitive crosstalk avoidance codes for on-chip buses. 400-404
Mo-PM-1-3: Coded Caching
- Qianqian Yang, Deniz Gündüz:
Centralized coded caching for heterogeneous lossy requests. 405-409 - Mohammed Karmoose, Martina Cardone, Christina Fragouli:
Simplifying wireless social caching. 410-414 - Jad Hachem, Urs Niesen, Suhas N. Diggavi:
A layered caching architecture for the interference channel. 415-419 - Li Tang, Aditya Ramamoorthy:
Coded caching for networks with the resolvability property. 420-424 - Vaishakh Ravindrakumar, Parthasarathi Panda, Nikhil Karamchandani, Vinod M. Prabhakaran:
Fundamental limits of secretive coded caching. 425-429
Mo-PM-1-4: Distributed Storage 3
- Preetum Nakkiran, K. V. Rashmi, Kannan Ramchandran:
Optimal systematic distributed storage codes with fast encoding. 430-434 - Swanand Kadhe, Alex Sprintson:
Codes with unequal locality. 435-439 - Jie Hao, Shu-Tao Xia, Bin Chen:
Some results on optimal locally repairable codes. 440-444 - Anyu Wang, Zhifang Zhang, Dongdai Lin:
Two classes of (r, t)-locally repairable codes. 445-449 - Netanel Raviv, Eitan Yaakobi, Muriel Médard:
Coding for locality in reconstructing permutations. 450-454
Mo-PM-1-5: Energy Harvesting 1
- Silas L. Fong, Vincent Y. F. Tan, Jing Yang:
A non-asymptotic achievable rate for the AWGN energy-harvesting channel using save-and-transmit. 455-459 - Ayça Özçelikkale, Tomas McKelvey, Mats Viberg:
Performance bounds for remote estimation with an energy harvesting sensor. 460-464 - Konchady Gautam Shenoy, Vinod Sharma:
Finite blocklength achievable rates for energy harvesting AWGN channels with infinite buffer. 465-469 - Hajar Mahdavi-Doost, Narayan Prasad, Sampath Rangarajan:
Optimizing energy efficiency over energy-harvesting LTE cellular networks. 470-474 - Xianwen Wu, Jing Yang, Jingxian Wu:
Optimal energy management for energy harvesting transmitters under battery usage constraint. 475-479
Mo-PM-1-6: Sequences 2
- Lilya Budaghyan, Claude Carlet, Tor Helleseth, Nian Li:
On the (non-)existence of APN (n, n)-functions of algebraic degree n. 480-484 - Soukayna Qarboua, Julien Schrek, Caroline Fontaine:
New results about Tu-Deng's conjecture. 485-489 - Lucien Lapierre, Petr Lisonek:
On vectorial bent functions with Dillon-type exponents. 490-494 - Nir Weinberger, Ofer Shayevitz:
On the optimal boolean function for prediction under quadratic loss. 495-499 - Or Ordentlich, Ofer Shayevitz, Omri Weinstein:
An improved upper bound for the most informative boolean function conjecture. 500-504
Mo-PM-1-7: Secrecy
- Dan He, Yuan Luo, Ning Cai:
Strong secrecy capacity of the wiretap channel II with DMC main channel. 505-509 - Germán Bassi, Pablo Piantanida, Shlomo Shamai:
Secret key generation over noisy channels with common randomness. 510-514 - Shashank Vatedka, Navin Kashyap:
A lattice coding scheme for secret key generation from Gaussian Markov tree sources. 515-519 - Ibrahim Issa, Sudeep Kamath, Aaron B. Wagner:
Maximal leakage minimization for the Shannon cipher system. 520-524
Mo-PM-1-8: Lossy Compression 1
- Sung Hoon Lim, Chien-Yi Wang, Michael Gastpar:
Information theoretic caching: The multi-user case. 525-529 - Badri N. Vellambi, Jörg Kliewer, Matthieu R. Bloch:
Lossy compression with near-uniform encoder outputs. 530-534 - Sinem Unal, Aaron B. Wagner:
An LP lower bound for rate distortion with variable side information. 535-539 - Alon Kipnis, Stefano Rini, Andrea J. Goldsmith:
Multiterminal compress-and-estimate source coding. 540-544
Mo-PM-1-9: JKW Award Finalists 1 / Interference
- Wonjae Shin, Namyoon Lee, Jungwoo Lee, H. Vincent Poor:
Guiding blind transmitters for K-user MISO interference relay channels with Imperfect channel knowledge. 545-549 - Xinping Yi, Giuseppe Caire:
Topological interference management with decoded message passing. 550-554 - Heecheol Yang, Navid Naderializadeh, Amir Salman Avestimehr, Jungwoo Lee:
Topological interference management with reconfigurable antennas. 555-559 - Hua Sun, Syed Ali Jafar:
Blind interference alignment for private information retrieval. 560-564 - Cheuk Ting Li, Abbas El Gamal:
Distributed simulation of continuous random variables. 565-569
Mo-PM-2-1: Information Measures 1
- Chandra Nair, Nan Nan Wang:
Evaluating hypercontractivity parameters using information measures. 570-574 - Mahito Sugiyama, Hiroyuki Nakahara, Koji Tsuda:
Information decomposition on structured space. 575-579 - Dmitri S. Pavlichin, Tsachy Weissman:
Chained Kullback-Leibler divergences. 580-584 - Marco Tomamichel, Masahito Hayashi:
Operational interpretation of Rényi conditional mutual information via composite hypothesis testing against Markov distributions. 585-589
Mo-PM-2-2: Communications
- Ayse Ünsal, Raymond Knopp, Neri Merhav:
Lower bounds on joint modulation-estimation performance for the Gaussian MAC. 590-594 - Shweta Agrawal, Ran Gelles, Amit Sahai:
Adaptive protocols for interactive communication. 595-599 - Tetsunao Matsuta, Tomohiko Uyematsu:
Caching-aided multicast for partial information. 600-604 - Qun Zhang, Terence H. Chan:
Achievable rates of soliton communication systems. 605-609