default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDISIT 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 - Pavlos Kazakopoulos, Aris L. Moustakas:
On the soliton spectral efficiency in non-linear optical fibers. 610-614
Mo-PM-2-3: Coding for Insertion and Deletion Channels
- Frederic Sala, Ryan Gabrys, Clayton Schoeny, Kayvon Mazooji, Lara Dolecek:
Exact sequence reconstruction for insertion-correcting codes. 615-619 - Venkatesan Guruswami, Ray Li:
Efficiently decodable insertion/deletion codes for high-noise and high-rate regimes. 620-624 - Manabu Hagiwara:
On ordered syndromes for multi insertion/deletion error-correcting codes. 625-629 - Clayton Schoeny, Antonia Wachter-Zeh, Ryan Gabrys, Eitan Yaakobi:
Codes correcting a burst of deletions or insertions. 630-634 - Ryohei Goto, Kenta Kasai, Haruhiko Kaneko:
Coding of insertion-deletion-substitution channels without markers. 635-639
Mo-PM-2-4: Distributed Storage 4
- Alexander Zeh, Eitan Yaakobi:
Bounds and constructions of codes with multiple localities. 640-644 - Jie Hao, Shu-Tao Xia, Bin Chen:
Recursive bounds for locally repairable codes with multiple repair groups. 645-649 - Toni Ernvall, Thomas Westerbäck, Ragnar Freij-Hollanti, Camilla Hollanti:
A connection between locally repairable codes and exact regenerating codes. 650-654 - Balaji Srinivasan Babu, K. P. Prasanth, P. Vijay Kumar:
Binary codes with locality for multiple erasures having short block length. 655-659 - Sarit Buzaglo, Eitan Yaakobi, Yuval Cassuto, Paul H. Siegel:
Consecutive switch codes. 660-664
Mo-PM-2-5: Compressed Sensing 1
- Galen Reeves, Henry D. Pfister:
The replica-symmetric prediction for compressed sensing with Gaussian matrices is exact. 665-669 - Meng-Yang Chen, Francesco Renna, Miguel R. D. Rodrigues:
On the design of linear projections for compressive sensing with side information. 670-674 - Haolei Weng, Le Zheng, Arian Maleki, Xiaodong Wang:
Phase transition and noise sensitivity of ℓp-minimization for 0 ≤ p ≤ 1. 675-679 - Junan Zhu, Ahmad Beirami, Dror Baron:
Performance trade-offs in multi-processor approximate message passing. 680-684
Mo-PM-2-6: Entropy
- Sudeep Kamath, Sergio Verdú:
Estimation of entropy rate and Rényi entropy rate for Markov chains. 685-689 - Or Ordentlich:
Novel lower bounds on the entropy rate of binary hidden Markov processes. 690-694 - François Baccelli, Jae Oh Woo:
On the entropy and mutual information of point processes. 695-699 - Hirosuke Yamamoto, Qiqiang Liu:
Highly sensitive universal statistical test. 700-704 - Saikat Guha, Jeffrey H. Shapiro, Raúl García-Patrón Sánchez:
Thinning, photonic beamsplitting, and a general discrete Entropy power Inequality. 705-709
Mo-PM-2-7: Interference in Wireless Networks 1
- Yan Zhu, Cong Shen:
On layered erasure interference channels without CSI at transmitters. 710-714 - Joyson Sebastian, Can Karakus, Suhas N. Diggavi:
Approximately achieving the feedback interference channel capacity with point-to-point codes. 715-719 - Yair Noam, Naama Kimelfeld, Benjamin M. Zaidel:
On the two-user MISO interference channel with single user decoding and partial CSIT. 720-724
Mo-PM-2-8: Lossy Compression 2
- Farhad Shirani Chaharsooghi, Mohsen Heidari, S. Sandeep Pradhan:
Quasi Linear Codes: Application to point-to-point and multi-terminal source coding. 730-734 - Tobias Koch, Gonzalo Vazquez-Vilar:
A general rate-distortion converse bound for entropy-constrained scalar quantization. 735-739 - Alon Kipnis, Yonina C. Eldar, Andrea J. Goldsmith:
Information rates of sampled Wiener processes. 740-744 - Shigeaki Kuzuoka:
On the smooth Rényi entropy and variable-length source coding allowing errors. 745-749 - Jiantao Jiao, Yanjun Han, Tsachy Weissman:
Minimax estimation of the L1 distance. 750-754
Mo-PM-2-9: JKW Award Finalists 2
- Cynthia Rush, Ramji Venkataramanan:
Finite-sample analysis of Approximate Message Passing. 755-759 - David Sutter, Marco Tomamichel, Aram W. Harrow:
Strengthened monotonicity of relative entropy via pinched Petz recovery map. 760-764 - Nir Weinberger, Neri Merhav:
A large deviations approach to secure lossy compression. 765-769
Tu-AM-1-1: Belief Propagation
- Arise Kuriya, Toshiyuki Tanaka:
Effects of the approximations from BP to AMP for small-sized problems. 770-774 - Hussein Saad, Ahmed Attia Abotabl, Aria Nosratinia:
EXIT analysis for belief propagation in degree-correlated stochastic block models. 775-779 - Alaa Saade, Marc Lelarge, Florent Krzakala, Lenka Zdeborová:
Clustering from sparse pairwise measurements. 780-784 - Farzin Haddadpour, Mahdi Jafari Siavoshani, Morteza Noshad:
Low-complexity stochastic Generalized Belief Propagation. 785-789
Tu-AM-1-2: Cryptography and Security 1
- Ueli Maurer, João Ribeiro:
New perspectives on weak Oblivious Transfer. 790-794 - Marco Baldi, Paolo Santini, Franco Chiaraluce:
Soft McEliece: MDPC code-based McEliece cryptosystems with very compact keys through real-valued intentional errors. 795-799 - Simona Samardjiska, Danilo Gligoroski:
An encryption scheme based on Random Split of St-Gen codes. 800-804 - Olivier Rioul, Annelie Heuser, Sylvain Guilley, Jean-Luc Danger:
Inter-class vs. mutual information as side-channel distinguishers. 805-809
Tu-AM-1-3: Polar Codes 3
- Christopher G. Blake, Frank R. Kschischang:
Energy complexity of polar codes. 810-814 - Seyyed Ali Hashemi, Carlo Condo, Warren J. Gross:
Simplified Successive-Cancellation List decoding of polar codes. 815-819 - Rajai Nasser:
Erasure schemes using generalized polar codes: Zero-undetected-error capacity and performance trade-offs. 820-824
Tu-AM-1-4: Distributed Storage 5
- Chao Tian:
Symmetry, demand types and outer bounds in caching systems. 825-829 - Chao Tian, Jun Chen:
Caching and delivery via interference elimination. 830-834 - Asma Ghorbel, Mari Kobayashi, Sheng Yang:
Content delivery in erasure broadcast channels with cache and feedback. 835-839
Tu-AM-1-5: Clustering
- Emmanuel Abbe, Colin Sandon:
Crossing the KS threshold in the stochastic block model with information theory. 840-844 - K. Pavan Srinath, Ramji Venkataramanan:
Cluster-seeking shrinkage estimators. 845-849 - Wenqi Wang, Shuchin Aeron, Vaneet Aggarwal:
On deterministic conditions for subspace clustering under missing data. 850-854 - Fabio D'Andreagiovanni, Giuseppe Caire:
An unconventional clustering problem: User Service Profile Optimization. 855-859
Tu-AM-1-6: Wireless Communications 2
- Yonghee Han, Jungwoo Lee:
Two-stage compressed sensing for millimeter wave channel estimation. 860-864 - Flavio Zabini, Andrea Conti:
Ginibre sampling and signal reconstruction. 865-869 - Yuanming Shi, Jun Zhang, Khaled Ben Letaief:
Statistical group sparse beamforming for green Cloud-RAN via large system analysis. 870-874 - Haider Ali Jasim Alshamary, Weiyu Xu:
Efficient optimal joint channel estimation and data detection for massive MIMO systems. 875-879
Tu-AM-1-7: Channel Uncertainty and CSI
- Bikash Kumar Dey, Sidharth Jaggi, Michael Langberg, Anand D. Sarwate:
A bit of delay is sufficient and stochastic encoding is necessary to overcome online adversarial erasures. 880-884 - Stefano Rini, Shlomo Shamai:
On the capacity of the dirty paper channel with fast fading and discrete channel states. 885-889 - Rui Xu, Jun Chen, Tsachy Weissman, Jian-Kang Zhang:
When is noisy state information at the encoder as useless as no information or as good as noise-free state? 890-894 - Maël Le Treust, Matthieu R. Bloch:
Empirical coordination, state masking and state amplification: Core of the decoder's knowledge. 895-899
Tu-AM-1-8: Channel Capacity 1
- Saeid Haghighatshoar, Peter Jung, Giuseppe Caire:
Capacity and degree-of-freedom of OFDM channels with amplitude constraint. 900-904 - Siddharth Barman, Omar Fawzi:
Algorithmic aspects of optimal channel coding. 905-909 - Antonio Campello, Cong Ling, Jean-Claude Belfiore:
Algebraic lattice codes achieve the capacity of the compound block-fading channel. 910-914 - Zitan Chen, Sidharth Jaggi, Michael Langberg:
The capacity of online (causal) q-ary error-erasure channels. 915-919
Tu-AM-1-9: Reed-Solomon Codes
- Margreta Kuijper, Martin Bossert:
On (partial) unit memory codes based on Reed-Solomon codes for streaming. 920-924 - Jun Zhang, Daqing Wan:
On deep holes of projective Reed-Solomon codes. 925-929 - Irene Marquez Corbella, Jean-Pierre Tillich:
Using Reed-Solomon codes in the (U | U + V ) construction and an application to cryptography. 930-934 - Wael Halbawi, Zihan Liu, Babak Hassibi:
Balanced Reed-Solomon codes. 935-939
Tu-AM-2-1: Constrained Coding 3
- Evyatar Hemo, Yuval Cassuto:
d-imbalance WOM codes for reduced inter-cell interference in multi-level NVMs. 940-944 - Michal Horovitz, Eitan Yaakobi:
On the capacity of non-binary write-once memory. 945-949 - Yuval Cassuto, Shahar Kvatinsky, Eitan Yaakobi:
Write sneak-path constraints avoiding disturbs in memristor crossbar arrays. 950-954 - Pengfei Huang, Paul H. Siegel, Eitan Yaakobi:
Performance of flash memories with different binary labelings: A multi-user perspective. 955-959
Tu-AM-2-2: Statistical Inference 1
- Akshay Krishnamurthy:
Minimax structured normal means inference. 960-964 - Aaditya Ramdas, David Isenberg, Aarti Singh, Larry A. Wasserman:
Minimax lower bounds for linear independence testing. 965-969 - Binglin Li, Shuangqing Wei, Yue Wang, Jian Yuan:
Chernoff information of bottleneck Gaussian trees. 970-974 - Michael Kohler, Adam Krzyzak:
The rates of convergence of neural network estimates of hierarchical interaction regression models. 975-977
Tu-AM-2-3: Polar Codes 4
- Ling Liu, Cong Ling:
Polar codes and polar lattices for independent fading channels. 978-982 - Remi A. Chou, Aylin Yener:
Polar coding for the multiple access wiretap channel via rate-splitting and cooperative jamming. 983-987 - Jincheng Dai, Kai Niu, Zhongwei Si, Jiaru Lin:
Polar coded non-orthogonal multiple access. 988-992 - Jin Sima, Wei Chen:
Polar codes for broadcast channels with receiver message side information and noncausal state available at the encoder. 993-997
Tu-AM-2-4: Distributed Storage 6
- Yi-Sheng Su:
Design of membership matrices for (r, t)-availability in distributed storage. 998-1002 - Ankit Singh Rawat, Onur Ozan Koyluoglu, Sriram Vishwanath:
Centralized repair of multiple node failures. 1003-1007 - Sihuang Hu, Itzhak Tamo, Alexander Barg:
Combinatorial and LP bounds for LRC codes. 1008-1012 - Siddhartha Brahma, Hugues Mercier:
Reliability-bandwidth tradeoffs for distributed storage allocations. 1013-1017
Tu-AM-2-5: Information Theory in Biology 2
- Joseph Hui, Ilan Shomorony, Kannan Ramchandran, Thomas A. Courtade:
Overlap-based genome assembly from variable-length reads. 1018-1022 - Nariman Farsad, Yonathan Murin, Andrew W. Eckford, Andrea J. Goldsmith:
On the capacity of diffusion-based molecular timing channels. 1023-1027 - Siddharth Jain, Farzad Farnoud, Moshe Schwartz, Jehoshua Bruck:
Duplication-correcting codes for data storage in the DNA of living organisms. 1028-1032 - Yen-Chi Lee, Chiun-Chuan Chen, Ping-Cheng Yeh, Chia-Han Lee:
Distribution of first arrival position in molecular communication. 1033-1037
Tu-AM-2-6: Inequalities 1
- Salman Beigi, Chandra Nair:
Equivalent characterization of reverse Brascamp-Lieb-type inequalities using information measures. 1038-1042 - Jingbo Liu, Thomas A. Courtade, Paul W. Cuff, Sergio Verdú:
Smoothing Brascamp-Lieb inequalities and strong converses for common randomness generation. 1043-1047 - Jingbo Liu, Thomas A. Courtade, Paul W. Cuff, Sergio Verdú:
Brascamp-Lieb inequality and its reverse: An information theoretic view. 1048-1052 - Ashok Vardhan Makkuva, Yihong Wu:
On additive-combinatorial affine inequalities for Shannon entropy and differential entropy. 1053-1057
Tu-AM-2-7: Multiple Antennas 2
- Nir Shlezinger, Ron Dabora:
The capacity of discrete-time Gaussian MIMO channels with periodic characteristics. 1058-1062 - Elad Domanovitz, Uri Erez:
Universal outage behavior of randomly precoded integer forcing Over MIMO channels. 1063-1067 - Austin Collins, Yury Polyanskiy:
Dispersion of the coherent MIMO block-fading channel. 1068-1072 - Mario Díaz:
On the symmetries and the capacity achieving input covariance matrices of multiantenna channels. 1073-1077
Tu-AM-2-8: Multi-Terminal Source Coding 2
- Kittipong Kittichokechai, Giuseppe Caire:
Privacy-constrained remote source coding. 1078-1082 - Georg Pichler, Pablo Piantanida, Gerald Matz:
Distributed information-theoretic biclustering. 1083-1087 - Solmaz Torabi, Jie Ren, John MacLaren Walsh:
Practical interactive scheme for extremum computation in distributed networks. 1088-1092 - Neri Merhav:
Universal decoding for source-channel coding with side information. 1093-1097
Tu-AM-2-9: BCH Codes / Quasi-Cyclic Codes
- Yingquan Wu:
Generalized integrated interleaving BCH codes. 1098-1102 - Ron M. Roth, Alexander Zeh:
Long cyclic codes over GF(4) and GF(8) better than BCH codes in the high-rate region. 1103-1107 - Ron M. Roth, Alexander Zeh:
On spectral design methods for quasi-cyclic codes. 1108-1112 - Alexander Zeh, San Ling:
Spectral analysis of quasi-cyclic product codes. 1113-1117
Tu-PM-1-1: Information Measures 2
- Yuheng Bu, Shaofeng Zou, Yingbin Liang, Venugopal V. Veeravalli:
Estimation of KL divergence between large-alphabet distributions. 1118-1122 - M. Ashok Kumar, Igal Sason:
On projections of the Rényi divergence on generalized convex sets. 1123-1127 - Jiange Li, Matthieu Fradelizi, Mokshay M. Madiman:
Information concentration for convex measures. 1128-1132 - Kevin R. Moon, Kumar Sricharan, Kristjan H. Greenewald, Alfred O. Hero III:
Improving convergence of divergence functional ensemble estimators. 1133-1137 - Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro:
Approximating probability distributions with short vectors, via information theoretic distance measures. 1138-1142
Tu-PM-1-2: Learning 1
- Kangwook Lee, Maximilian Lam, Ramtin Pedarsani, Dimitris S. Papailiopoulos, Kannan Ramchandran:
Speeding up distributed machine learning using codes. 1143-1147 - Zahra Shakeri, Waheed Uz Zaman Bajwa, Anand D. Sarwate:
Minimax lower bounds for Kronecker-structured dictionary learning. 1148-1152 - Nihar B. Shah, Sivaraman Balakrishnan, Martin J. Wainwright:
Feeling the bern: Adaptive estimators for Bernoulli probabilities of pairwise comparisons. 1153-1157 - Jalal Etesami, Negar Kiyavash:
Interventional dependency graphs: An approach for discovering influence structure. 1158-1162 - Philipp Grohs, Thomas Wiatowski, Helmut Bölcskei:
Deep convolutional neural networks on cartoon functions. 1163-1167
Tu-PM-1-3: Superposition Codes / Group Testing 1
- Yoshinari Takeishi, Jun'ichi Takeuchi:
An improved upper bound on block error probability of least squares superposition codes with unbiased Bernoulli dictionary. 1168-1172 - Jean Barbier, Mohamad Dia, Nicolas Macris:
Proof of threshold saturation for spatially coupled sparse superposition codes. 1173-1177 - Arkadii G. D'yachkov, Ilya V. Vorobyev, N. A. Polyanskii, Vladislav Yu. Shchukin:
On multistage learning a hidden hypergraph. 1178-1182 - Arkady G. D'yachkov, Ilya V. Vorobyev, N. A. Polyanskii, Vladislav Yu. Shchukin:
On a hypergraph approach to multistage group testing problems. 1183-1191
Tu-PM-1-4: Distributed Storage 7
- Hui Zhang, Vitaly Skachek:
Bounds for batch codes with restricted query size. 1192-1196 - Alexander Vardy, Eitan Yaakobi:
Constructions of batch codes with near-optimal redundancy. 1197-1201 - Min Ye, Alexander Barg:
Explicit constructions of MDS array codes and RS codes with optimal repair bandwidth. 1202-1206 - Lluis Pamies-Juarez, Cyril Guyot, Robert Mateescu:
Spider Codes: Practical erasure codes for distributed storage systems. 1207-1211 - Mehran Elyasi, Soheil Mohajer:
New exact-repair codes for distributed storage systems using matrix determinant. 1212-1216
Tu-PM-1-5: Data Compression
- Abram Magner, Krzysztof Turowski, Wojciech Szpankowski:
Lossless compression of binary trees with correlated vertex names. 1217-1221 - Hee Sun Kim, Zsolt Talata:
Context Set Weighting method. 1222-1226 - Nematollah Iri, Oliver Kosut:
A new Type Size code for universal one-to-one compression of parametric sources. 1227-1231 - Matthew G. Reyes, David L. Neuhoff:
Cutset width and spacing for Reduced Cutset Coding of Markov random fields. 1232-1236 - Kristo Visk, Ago-Erik Riet:
Generalisation of Kraft inequality for source coding into permutations. 1237-1241
Tu-PM-1-6: Heterogeneous Networks
- Thomas Stahlbuhk, Brooke Shrader, Eytan H. Modiano:
Throughput maximization in uncooperative spectrum sharing networks. 1242-1246 - Trung-Anh Do, Sang-Woon Jeon, Won-Yong Shin:
Caching in mobile HetNets: A throughput-delay trade-off perspective. 1247-1251 - Nof Abuzainab, Walid Saad, H. Vincent Poor:
Cognitive hierarchy theory for heterogeneous uplink multiple access in the Internet of Things. 1252-1256 - Animesh Kumar:
Bandlimited field estimation from samples recorded by a location-unaware mobile sensor. 1257-1261 - Michal Yemini, Anelia Somekh-Baruch, Reuven Cohen, Amir Leshem:
Simultaneous connectivity in heterogeneous cognitive radio networks. 1262-1266
Tu-PM-1-7: Feedback 2
- Sergey Loyka, Charalambos D. Charalambous:
Feedback does not increase the capacity of compound channels with additive noise. 1267-1271 - Annina Bracher, Amos Lapidoth:
The zero-error capacity of the Gelfand-Pinsker channel with a feedback link. 1272-1276 - Shraga I. Bross, Amos Lapidoth:
Conveying data and State with feedback. 1277-1281 - Marat V. Burnashev, Hirosuke Yamamoto:
On optimal transmission strategies for channels with noiseless feedback. 1282-1286 - Christos K. Kourtellaris, Charalambos D. Charalambous:
Information structures of capacity achieving distribution for channels with memory and feedback. 1287-1291
Tu-PM-1-8: DoF in Wireless Networks
- David Stotz, Syed Ali Jafar, Helmut Bölcskei, Shlomo Shamai:
Canonical conditions for K/2 degrees of freedom. 1292-1296 - Arash Gholami Davoodi, Syed Ali Jafar:
GDoF of the MISO BC: Bridging the gap between finite precision CSIT and perfect CSIT. 1297-1301 - Tian Ding, Xiaojun Yuan, Soung Chang Liew:
Degrees of freedom of MIMO Y channel with multiple relays. 1302-1306 - Arash Gholami Davoodi, Syed Ali Jafar:
Generalized DoF of the symmetric K-user interference channel under finite precision CSIT. 1307-1311 - Shih-Yi Yeh, I-Hsiang Wang:
Degrees of freedom of the bursty MIMO X channel without feedback. 1312-1316
Tu-PM-1-9: Combinatorial Coding Theory
- Roland D. Barrolleta, Mercè Villanueva:
PD-sets for Z4-linear codes: Hadamard and Kerdock codes. 1317-1321 - Divesh Aggarwal, Jop Briët:
Revisiting the Sanders-Bogolyubov-Ruzsa theorem in Fpn and its application to non-malleable codes. 1322-1326 - Yang Yang, Zhengchun Zhou, Xiaohu Tang:
Two classes of zero difference balanced functions and their optimal constant composition codes. 1327-1330 - Daniel F. Cullina, Marco Dalai, Yury Polyanskiy:
Rate-distance tradeoff for codes above graph capacity. 1331-1335 - Tuvi Etzion, Marcelo Firer:
Metrics based on finite directed graphs. 1336-1340
Tu-PM-2-1: Network Structures
- Javad Heydari, Ali Tajer, H. Vincent Poor:
Quickest detection of Markov networks. 1341-1345 - Keehwan Park, Jean Honorio:
Information-theoretic lower bounds for recovery of diffusion network structures. 1346-1350 - Son Hoang Dau, Olgica Milenkovic:
Inference of latent network features via co-intersection representations of graphs. 1351-1355
Tu-PM-2-2: Cryptography and Security 2
- Qian Guo, Thomas Johansson:
A p-ary MDPC scheme. 1356-1360 - Sundara Rajan S, Shijin Rajakrishnan, Andrew Thangaraj, Vinod M. Prabhakaran:
Lower bounds and optimal protocols for three-party secure computation. 1361-1365 - Julia Chaulet, Nicolas Sendrier:
Worst case QC-MDPC decoder for McEliece cryptosystem. 1366-1370 - AmirEmad Ghassami, Daniel F. Cullina, Negar Kiyavash:
Message partitioning and limited auxiliary randomness: Alternatives to Honey Encryption. 1371-1375
Tu-PM-2-3: Group Testing 2
- Moein Falahatgar, Ashkan Jafarpour, Alon Orlitsky, Venkatadheeraj Pichapati, Ananda Theertha Suresh:
Estimating the number of defectives with group testing. 1376-1380 - Matthew Aldridge, Oliver Johnson, Jonathan Scarlett:
Improved group testing rates with constant column weight designs. 1381-1385 - I-Hsiang Wang, Shao-Lun Huang, Kuan-Yun Lee, Kwang-Cheng Chen:
Data extraction via histogram and arithmetic mean queries: Fundamental limits and algorithms. 1386-1390 - Alejandro Cohen, Asaf Cohen, Omer Gurewitz:
Secure Group Testing. 1391-1395
Tu-PM-2-4: Distributed Storage 8
- Rawad Bitar, Salim El Rouayheb:
Staircase codes for secret sharing with optimal communication and read overheads. 1396-1400 - Wentao Huang, Jehoshua Bruck:
Secure RAID schemes for distributed storage. 1401-1405 - Fangwei Ye, Kenneth W. Shum, Raymond W. Yeung:
The rate region of secure exact-repair regenerating codes for 5 nodes. 1406-1410 - Razan Tajeddine, Salim El Rouayheb:
Private information retrieval from MDS coded data in distributed storage systems. 1411-1415
Tu-PM-2-5: Compressed Sensing 2
- Reinhard Heckel:
Super-resolution MIMO radar. 1416-1420 - Hongwei Wang, Hang Yu, Michael Hoy, Justin Dauwels, Heping Wang:
Variational Bayesian dynamic compressive sensing. 1421-1425 - Jun Zhang, Urbashi Mitra, Kuan-Wen Huang, Nicolò Michelusi:
Support recovery from noisy random measurements via weighted ℓ1 minimization. 1426-1430 - Sanghamitra Dutta, Pulkit Grover:
Adaptivity provably helps: Information-theoretic limits on l0 cost of non-adaptive sensing. 1431-1435
Tu-PM-2-6: Scheduling
- Georgios S. Paschos, Mathieu Leconte, Apostolos Destounis:
Routing with blinkers: Online throughput maximization without queue length information. 1436-1440 - Bin Tang, Xiaoliang Wang, Cam-Tu Nguyen, Sanglu Lu:
Constructing sub-exponentially large optical priority queues with switches and fiber delay lines. 1441-1445 - Qing He, Di Yuan, Anthony Ephremides:
A general optimality condition of link scheduling for emptying a wireless network. 1446-1450 - Juan Liu, Yuyi Mao, Jun Zhang, Khaled Ben Letaief:
Delay-optimal computation task scheduling for mobile-edge computing systems. 1451-1455
Tu-PM-2-7: Interference in Wireless Networks 2
- Borna Kananian, Mohammad Ali Maddah-Ali, Seyed Pooya Shariatpanahi, Babak Hossein Khalaj:
Collaboration alignment in distributed interference management in uplink cellular systems. 1456-1460 - Aly El Gamal:
Cell associations that maximize the average uplink-downlink degrees of freedom. 1461-1465 - Paul de Kerret, David Gesbert:
Network MIMO: Transmitters with no CSI can still be very useful. 1466-1470 - Sebastian Stern, Robert F. H. Fischer:
Advanced factorization strategies for lattice-reduction-aided preequalization. 1471-1475 - Pritam Mukherjee, Sennur Ulukus:
Real interference alignment for vector channels. 1476-1480
Tu-PM-2-8: Multiple Access Channels 2
- Anatoly Khina, Yuval Kochman, Uri Erez:
The dirty MIMO multiple-access channel. 1481-1485 - Sara Shahi, Daniela Tuninetti, Natasha Devroye:
On the capacity of strong asynchronous multiple access channels with a large number of users. 1486-1490 - Wasim Huleihel, Yossef Steinberg:
Multiple access channel with unreliable cribbing. 1491-1495 - Yunhao Sun, Ruchen Duan, Yingbin Liang, Ashish Khisti, Shlomo Shamai:
Helper-assisted state cancelation for multiple access channels. 1496-1500
Tu-PM-2-9: Lattice Codes
- Xiaolu Hou, Frédérique E. Oggier:
On LCD codes and lattices. 1501-1505 - Nuwan S. Ferdinand, Matthew S. Nokleby, Behnaam Aazhang:
Voronoi constellations for high-dimensional lattice codes. 1506-1510 - Wael Alghamdi, Walid Abediseid, Mohamed-Slim Alouini:
On the construction of capacity-achieving lattice Gaussian codes. 1511-1515 - Maiara F. Bollauf, Ram Zamir:
Uniformity properties of Construction C. 1516-1520
We-AM-1-1: Error Exponents 1
- Mani Bastani Parizi, Emre Telatar, Neri Merhav:
Exact random coding secrecy exponents for the wiretap channel. 1521-1525 - Shengyu Zhu, Biao Chen:
Distributed detection over connected networks via one-bit quantizer. 1526-1530 - Yutaka Jitsumatsu, Yasutada Oohama:
Computing the optimal exponent of correct decoding for discrete memoryless sources. 1531-1535 - Masahito Hayashi, Vincent Y. F. Tan:
Remaining uncertainties and exponents under Rényi information measures. 1536-1540
We-AM-1-2: Statistical Inference 2
- Pierre Moulin:
Asymptotically achievable error probabilities for multiple hypothesis testing. 1541-1545 - Shang Li, Xiaoou Li, Xiaodong Wang, Jingchen Liu:
Optimal sequential test with finite horizon and constrained sensor selection. 1546-1550 - Céline Aubel, Helmut Bölcskei:
Deterministic performance analysis of subspace methods for cisoid parameter estimation. 1551-1555 - Siheng Chen, Rohan Varma, Aarti Singh, Jelena Kovacevic:
A statistical perspective of sampling scores for linear regression. 1556-1560
We-AM-1-3: LDPC Codes 1
- Srdan Brkic, Predrag Ivanis, Bane Vasic:
Guaranteed error correction of faulty bit-flipping decoders under data-dependent gate failures. 1561-1565 - Predrag Ivanis, Bane Vasic, David Declercq:
Performance evaluation of faulty iterative decoders using absorbing Markov chains. 1566-1570 - Hiroki Mori, Tadashi Wadayama:
Performance analysis of fault erasure belief propagation decoder based on density evolution. 1571-1575 - Linjia Chang, Avhishek Chatterjee, Lav R. Varshney:
LDPC decoders with missing connections. 1576-1580
We-AM-1-4: Distributed Storage 9 / Deletion Channel
- Alexander Zeh, Antonia Wachter-Zeh:
Improved erasure list decoding locally repairable codes using alphabet-dependent list recovery. 1581-1585 - Antti Pöllänen, Thomas Westerbäck, Ragnar Freij-Hollanti, Camilla Hollanti:
Bounds on the maximal minimum distance of linear locally repairable codes. 1586-1590 - Guangda Hu, Sergey Yekhanin:
New constructions of SD and MR codes over small finite fields. 1591-1595 - Ryan Gabrys, Eitan Yaakobi:
Sequence reconstruction over the deletion channel. 1596-1600
We-AM-1-5: Wireless Communications 3
- Jeonghun Park, Jeffrey G. Andrews, Robert W. Heath Jr., Namyoon Lee:
A lower bound on the optimum feedback rate for downlink multi-antenna cellular networks. 1601-1605 - Liang Liu, Pratik Patil, Wei Yu:
An uplink-downlink duality for cloud radio access network. 1606-1610 - Serkan Ak, Hazer Inaltekin, H. Vincent Poor:
Gaussian approximation for the downlink interference in heterogeneous cellular networks. 1611-1615 - Serkan Ak, Hazer Inaltekin, H. Vincent Poor:
Downlink outage performance of heterogeneous cellular networks. 1616-1620
We-AM-1-6: Game Theory
- Payam Delgosha, Amin Aminzadeh Gohari, Mohammad Akbarpour:
High probability guarantees in repeated games: Theory and applications in information theory. 1621-1625 - Emrah Akyol, Cedric Langbort, Tamer Basar:
On the role of side information in strategic communication. 1626-1630 - Serkan Saritas, Serdar Yüksel, Sinan Gezici:
Dynamic signaling games under Nash and Stackelberg equilibria. 1631-1635 - Arnob Ghosh, Saswati Sarkar, Randall A. Berry:
Secondary spectrum market: To acquire or not to acquire side information? 1636-1640
We-AM-1-7: Information Measures 3
- Yuta Sakai, Ken-ichi Iwata:
Relations between conditional Shannon entropy and expectation of ℓα-norm. 1641-1645 - Alex Dytso, Ronit Bustin, Daniela Tuninetti, Natasha Devroye, H. Vincent Poor, Shlomo Shamai:
On the minimum mean p-th error in Gaussian noise channels and its applications. 1646-1650 - Lukasz Debowski:
Consistency of the plug-in estimator of the entropy rate for ergodic processes. 1651-1655 - Hiroshi Nagaoka:
A characterization of statistical manifolds on which the relative entropy is a Bregman divergence. 1656-1659
We-AM-1-8: Relay Channels
- Youlong Wu:
Achievable rate regions for cooperative relay broadcast channels with rate-limited feedback. 1660-1664 - Shirin Saeedi Bidokhti, Gerhard Kramer:
Capacity of two-relay diamond networks with rate-limited links to the relays and a binary adder multiple access channel. 1665-1669 - Jonathan Ponniah, Liang-Liang Xie:
An achievable rate region for the two-way multiple relay channel. 1670-1674 - Xiugang Wu, Ayfer Özgür:
Improving on the cut-set bound for general primitive relay channels. 1675-1679
We-AM-1-9: Quantum Capacity and Quantum Channels
- Holger Boche, Gisbert Janssen, Stephan Kaltenstadler:
Entanglement assisted classical capacity of compound quantum channels. 1680-1684 - Shawn X. Cui, Zheng-Feng Ji, Nengkun Yu, Bei Zeng:
Quantum capacities for entanglement networks. 1685-1689 - Xin Wang, Runyao Duan:
A semidefinite programming upper bound of quantum capacity. 1690-1694 - Li Gao, Marius Junge, Nicholas LaRacuente:
Operator algebra approach to quantum capacities. 1695-1699
We-AM-2-1: Error Exponents 2
- Hye Won Chung, Lizhong Zheng, Brian M. Sadler, Alfred O. Hero III:
Unequal error protection coding approaches to the noisy 20 questions problem. 1700-1704 - Gil Katz, Pablo Piantanida, Mérouane Debbah:
Collaborative distributed hypothesis testing with general hypotheses. 1705-1709 - Anusha Lalitha, Tara Javidi:
Reliability of sequential hypothesis testing can be achieved by an almost-fixed-length test. 1710-1714 - Marco Dalai, Yury Polyanskiy:
Bounds on the reliability of a typewriter channel. 1715-1719
We-AM-2-2: Statistical Inference 3
- Alvaro Martín, Gadiel Seroussi:
Asymptotically tight bounds on the depth of estimated context trees. 1720-1724 - Joe Suzuki:
Structure learning and universal coding when missing values exist. 1725-1729 - Hang Yu, Junwei Huang, Justin Dauwels:
Latent tree ensemble of pairwise copulas for spatial extremes analysis. 1730-1734 - Christopher J. Quinn, Ali Pinar, Jing Gao, Lu Su:
Sparse approximations of directed information graphs. 1735-1739
We-AM-2-3: LDPC Codes 2 / RM Codes
- Fanny Jardel, Joseph Jean Boutros, Mireille Sarkiss:
Stopping sets for MDS-based product codes. 1740-1744 - Yu Tsunoda, Yuichiro Fujiwara:
Probabilistic bounds on the trapping redundancy of linear codes. 1745-1749 - Santhosh Kumar, A. Robert Calderbank, Henry D. Pfister:
Reed-Muller codes achieve capacity on the quantum erasure channel. 1750-1754 - Shrinivas Kudekar, Santhosh Kumar, Marco Mondelli, Henry D. Pfister, Rüdiger L. Urbanke:
Comparing the bit-MAP and block-MAP decoding thresholds of reed-muller codes on BMS channels. 1755-1759 - Alexandre Soro, Jérôme Lacan, Vincent Roca, Valentin Savin, Mathieu Cunche:
Enhanced recursive Reed-Muller erasure decoding. 1760-1763
We-AM-2-4: Network Coding 1
- Woong Kim, Michael Langberg, Michelle Effros:
A characterization of the capacity region for network coding with dependent sources. 1764-1768 - Ming Fai Wong, Michelle Effros, Michael Langberg:
On tightness of an entropic region outer bound for network coding and the edge removal property. 1769-1773 - Xunrui Yin, Zongpeng Li, Xin Wang:
A reduction approach to the multiple-unicast conjecture in network coding. 1774-1778 - Oliver Kosut, Jörg Kliewer:
On the relationship between edge removal and strong converses. 1779-1783 - Parham Noorzad, Michelle Effros, Michael Langberg:
Can negligible cooperation increase network reliability? 1784-1788
We-AM-2-5: Information Theory in Biology 3
- David Doty, Andrew Winslow:
Design of geometric molecular bonds. 1789-1793 - Pulkit Grover:
Fundamental limits on source-localization accuracy of EEG-based neural sensing. 1794-1798 - Ilan Shomorony, Govinda M. Kamath, Fei Xia, Thomas A. Courtade, David N. C. Tse:
Partial DNA assembly: A rate-distortion perspective. 1799-1803 - Peter J. Thomas, Andrew W. Eckford:
Shannon capacity of signal transduction for multiple independent receptors. 1804-1808
We-AM-2-6: Caching and Computation
- Julien Lavauzelle, Françoise Levy-dit-Vehel:
New proofs of retrievability using locally decodable codes. 1809-1813 - Songze Li, Mohammad Ali Maddah-Ali, Amir Salman Avestimehr:
Fundamental tradeoff between computation and communication in distributed computing. 1814-1818 - Shirin Saeedi Bidokhti, Michèle A. Wigger, Roy Timo:
Erasure broadcast networks with receiver caching. 1819-1823 - Mohsen Heidari, S. Sandeep Pradhan:
How to compute modulo prime-power sums. 1824-1828 - Yonathan Murin, Yonatan Kaspi, Ron Dabora, Deniz Gündüz:
Energy-distortion tradeoff for the gaussian broadcast channel with feedback. 1829-1833 - Lei Yu, Houqiang Li, Weiping Li:
Distortion bounds for source broadcast over degraded channel. 1834-1838 - Erman Koken, Ertem Tuncel:
On the energy-distortion tradeoff for the Gaussian broadcast problem. 1839-1843 - Erman Koken, Ertem Tuncel:
Joint source-channel coding for broadcasting correlated sources. 1844-1848
We-AM-2-8: Relay and Two Way Channels
- Leila Ghabeli, Milan S. Derpich:
The capacity gap calculation for multi-pair bidirectional Gaussian relay networks based on successive compute-and-forward strategy. 1849-1853 - Lin Song, Fady Alajaji, Tamás Linder:
Adaptation is useless for two discrete additive-noise two-way channels. 1854-1858 - David E. Simmons, Justin P. Coon, Naqueeb Ahmad Warsi:
Capacity and power scaling laws for finite antenna amplify-and-forward relay networks. 1859-1863 - Arash Behboodi, Anas Chaaban, Rudolf Mathar, Mohamed-Slim Alouini:
On full duplex Gaussian relay channels with self-interference. 1864-1868
We-AM-2-9: Channel Capacity 2
- Yonglong Li, Aleksandar Kavcic, Guangyue Han:
On the capacity of multilevel NAND flash memory channels. 1869-1873
We-AM-2-8: Relay and Two Way Channels
- Malcolm Egan, Mauro L. de Freitas, Laurent Clavier, Alban Goupil, Gareth W. Peters, Nourddine Azzaoui:
Achievable rates for additive isotropic α-stable noise channels. 1874-1878
We-AM-2-9: Channel Capacity 2
- Ahmad ElMoslimany, Tolga M. Duman:
On the capacity of fading channels with amplitude-limited inputs. 1879-1883 - Mainak Chowdhury, Andrea Goldsmith:
Capacity of block Rayleigh fading channels without CSI. 1884-1888
Th-AM-1-1: Community Detection
- Akshay Gadde, Eyal En Gad, Salman Avestimehr, Antonio Ortega:
Active learning for community detection in stochastic block models. 1889-1893 - Bruce E. Hajek, Yihong Wu, Jiaming Xu:
Information limits for recovering a hidden community. 1894-1898 - Narae Ryu, Sae-Young Chung:
Community detection with colored edges. 1899-1903 - Jonathan Scarlett, Volkan Cevher:
Partial recovery bounds for the sparse stochastic block model. 1904-1908
Th-AM-1-2: Code Construction and Analysis
- Shahrouz Sharifi, Mehdi Dabirnia, Ahmet Korhan Tanc, Tolga M. Duman:
Short block length code design for interference channels. 1909-1913 - Mahyar Shirvanimoghaddam, Sarah J. Johnson:
Approaching the capacity of AWGN channels using multi-layer raptor codes and superposition modulation. 1914-1918 - Weiqiang Yang, Ying Li, Xiaopu Yu, Yue Sun:
Two-way spinal codes. 1919-1923 - Zheng Wang, Cong Ling:
Further results on independent Metropolis-Hastings-Klein sampling. 1924-1928
Th-AM-1-3: LDPC Codes 3
- Kechao Huang, Xiao Ma, Baoming Bai:
Systematic block Markov superposition transmission of repetition codes. 1929-1933 - Yaoqing Yang, Pulkit Grover, Soummya Kar:
Computing linear transforms with unreliable components. 1934-1938 - Eirik Rosnes, Michael Helmling:
Constructing valid convex hull inequalities for single parity-check codes over prime fields. 1939-1943 - Shunsuke Horii, Toshiyasu Matsushima, Shigeichi Hirasawa:
Linear programming decoding of binary linear codes for symbol-pair read channels. 1944-1948
Th-AM-1-4: Network Coding 2
- Tuvi Etzion, Antonia Wachter-Zeh:
Vector network coding based on subspace codes outperforms scalar linear network coding. 1949-1953 - Jonas Hansen, Jan Østergaard, Johnny Kudahl, John H. Madsen:
On the construction of jointly superregular lower triangular Toeplitz matrices. 1954-1958 - Umberto Martínez-Peñas:
Generalized rank weights of reducible codes, optimal cases and related properties. 1959-1963 - Joseph Connelly, Kenneth Zeger:
A class of non-linearly solvable networks. 1964-1968
Th-AM-1-5: Energy Harvesting 2
- Anshoo Tandon, Mehul Motani, Lav R. Varshney:
Subblock energy-constrained codes for simultaneous energy and information transfer. 1969-1973 - Selma Belhadj Amor, Samir Medina Perlaza, Ioannis Krikidis, H. Vincent Poor:
Feedback enhances simultaneous energy and information transmission in multiple access channels. 1974-1978 - Dor Shaviv, Ayfer Özgür, Haim H. Permuter:
Capacity of remotely powered communication. 1979-1983 - Abdulrahman Baknina, Sennur Ulukus:
Online scheduling for energy harvesting broadcast channels with finite battery. 1984-1988
Th-AM-1-6: Estimation
- Shahab Asoodeh, Fady Alajaji, Tamás Linder:
Privacy-aware MMSE estimation. 1989-1993 - Jian Ding, Yuval Peres, Gireeja Ranade:
A tiger by the tail: When multiplicative noise stymies control. 1994-1998 - Graeme Baker, Serdar Yüksel:
Continuity and robustness to incorrect priors in estimation and control. 1999-2003 - Moritz Wiese, Karl Henrik Johansson, Tobias J. Oechtering, Panos Papadimitratos, Henrik Sandberg, Mikael Skoglund:
Uncertain wiretap channels and secure estimation. 2004-2008
Th-AM-1-7: Source-Channel Coding over MAC
- Basak Guler, Deniz Gündüz, Aylin Yener:
On lossy transmission of correlated sources over a multiple access channel. 2009-2013 - Arun Padakandla:
Communicating correlated sources over a MAC in the absence of a Gács-Körner common part. 2014-2018 - Mohsen Heidari, Farhad Shirani Chaharsooghi, S. Sandeep Pradhan:
New sufficient conditions for Multiple-Access Channel with correlated sources. 2019-2023 - Amos Lapidoth, Michèle A. Wigger:
A necessary condition for the transmissibility of correlated sources over a MAC. 2024-2028
Th-AM-1-8: Caching in Wireless Networks
- Ravi Tandon, Osvaldo Simeone:
Cloud-aided wireless networks with edge caching: Fundamental latency trade-offs in fog Radio Access Networks. 2029-2033 - Fan Xu, Kangqi Liu, Meixia Tao:
Cooperative Tx/Rx caching in interference channels: A storage-latency tradeoff study. 2034-2038 - Xinping Yi, Giuseppe Caire:
Topological coded caching. 2039-2043 - Navid Naderializadeh, Mohammad Ali Maddah-Ali, Amir Salman Avestimehr:
Fundamental limits of cache-aided interference management. 2044-2048
Th-AM-1-9: Classical-Quantum Channels
- Holger Boche, Ning Cai, Janis Noetzel:
Classical-quantum channels with causal and non-causal channel state information at the sender. 2049-2053 - Naqueeb Ahmad Warsi, Justin P. Coon:
Coding for classical-quantum channels with rate limited side information at the encoder: An information-spectrum approach. 2054-2058 - Holger Boche, Minglai Cai, Christian Deppe, Janis Noetzel:
Classical-quantum arbitrarily varying wiretap channel: Common randomness assisted code and continuity. 2059-2063 - Azadeh Sheikholeslami, Boulat A. Bash, Don Towsley, Dennis Goeckel, Saikat Guha:
Covert communication over classical-quantum channels. 2064-2068
Th-AM-2-1: Lossy Compression and Rate-Distortion
- Kousha Kalantari, Lalitha Sankar, Anand D. Sarwate:
Optimal differential privacy mechanisms under Hamming distortion for structured source classes. 2069-2073 - Marina Haikin, Ram Zamir:
Analog coding of a source with erasures. 2074-2078 - Farideh Ebrahim Rezagah, Shirin Jalali, Elza Erkip, H. Vincent Poor:
Rate-distortion dimension of stochastic processes. 2079-2083 - Ahmad Golmohammadi, David G. M. Mitchell, Jörg Kliewer, Daniel J. Costello Jr.:
Windowed encoding of spatially coupled LDGM codes for lossy source compression. 2084-2088
Th-AM-2-2: Learning 2
- Tho Ngoc Le, Vijay G. Subramanian, Randall A. Berry:
Are imperfect reviews helpful in social learning? 2089-2093 - Shashank Vatedka, Pascal O. Vontobel:
Pattern maximum likelihood estimation of finite-state discrete-time Markov chains. 2094-2098 - Matthew S. Nokleby, Ahmad Beirami, A. Robert Calderbank:
Rate-distortion bounds on Bayes risk in supervised learning. 2099-2103 - Guilherme França, José Bento:
An explicit rate bound for over-relaxed ADMM. 2104-2108
Th-AM-2-3: LDPC Codes 4
- Markus Stinner, Luca Barletta, Pablo M. Olmos:
Finite-length scaling based on Belief Propagation for spatially coupled LDPC codes. 2109-2113 - Christian Häger, Henry D. Pfister, Alexandre Graell i Amat, Fredrik Brannstrom:
Deterministic and ensemble-based spatially-coupled product codes. 2114-2118 - Rafah El-Khatib, Nicolas Macris:
The velocity of the decoding wave for spatially coupled codes on BMS channels. 2119-2123 - Dmitri V. Truhachev, Alireza Karami, Lei M. Zhang, Frank R. Kschischang:
Decoding analysis accounting for mis-corrections for spatially-coupled split-component codes. 2124-2128 - Junyi Du, Jinhong Yuan, Liang Zhou, Xuan He:
A progressive edge growth algorithm for bit mapping design of LDPC coded BICM schemes. 2129-2133
Th-AM-2-4: Network Coding 3
- Gaurav Kumar Agarwal, Martina Cardone, Christina Fragouli:
Coding across unicast sessions can increase the secure message capacity. 2134-2138 - Peida Tian, Sidharth Jaggi, Mayank Bakshi, Oliver Kosut:
Arbitrarily varying networks: Capacity-achieving computationally efficient codes. 2139-2143 - Jaemin Han, Chih-Chun Wang:
Linear network coding capacity region of the smart repeater with broadcast erasure channels. 2144-2148 - Henry P. Romero, Mahesh Kumar Varanasi:
Superposition coding in the combination network. 2149-2153 - Fatemeh Arbabjolfaei, Young-Han Kim:
Approximate capacity of index coding for some classes of graphs. 2154-2158
Th-AM-2-5: Applications of Random Matrix Theory
- Walid Hachem, Aris L. Moustakas, Leonid A. Pastur:
Time and frequency selective Ricean MIMO capacity: An ergodic operator approach. 2159-2163 - Apostolos Karadimitrakis, Aris L. Moustakas, Hartmut Hafermann, Axel Müller:
Optical fiber MIMO channel model and its analysis. 2164-2168 - Toshiyuki Tanaka:
Limiting eigenvalue distributions of block random matrices with one-dimensional coupling structure. 2169-2173 - Khalil Elkhalil, Abla Kammoun, Tareq Y. Al-Naffouri, Mohamed-Slim Alouini:
Exact closed-form expression for the inverse moments of one-sided correlated Gram matrices. 2174-2178
Th-AM-2-6: Wireless Communications 4
- Erdem Koyuncu, Christian Remling, Xiaoyi Leo Liu, Hamid Jafarkhani:
Outage-optimized distributed quantizers for multicast beamforming. 2179-2183 - Ezio Biglieri, I-Wei Lai:
The impact of independence assumptions on wireless communication analysis. 2184-2188 - Yanru Tang, Faeze Heydaryan, Jie Luo:
On utility optimization in distributed multiple access over a multi-packet reception channel. 2189-2193 - Vasuki Narasimha Swamy, Gireeja Ranade, Anant Sahai:
Robustness of cooperative communication schemes to channel models. 2194-2198
Th-AM-2-7: Interference Channels
- Salman Beigi, Sida Liu, Chandra Nair, Mehdi Yazdanpanah:
Some results on the scalar Gaussian interference channel. 2199-2203 - Ali Haghi, Amir K. Khandani:
The maximum Han-Kobayashi sum-rate for Gaussian interference channels. 2204-2208 - Yury Polyanskiy, Yihong Wu:
Converse bounds for interference channels via coupling and proof of Costa's conjecture. 2209-2213 - Farhad Shirani Chaharsooghi, S. Sandeep Pradhan:
Trade-off between communication and cooperation in the Interference Channel. 2214-2218
Th-AM-2-8: Covert Communications
- Mayank Bakshi, Vinod M. Prabhakaran:
Plausible deniability over broadcast channels. 2219-2223 - Mehrdad Tahmasbi, Matthieu R. Bloch:
Second-order asymptotics of covert communications over noisy channels. 2224-2228 - Keerthi Suria Kumar Arumugam, Matthieu R. Bloch:
Keyless covert communication over Multiple-Access Channels. 2229-2233 - Qiaosheng Eric Zhang, Mayank Bakshi, Sidharth Jaggi:
Computationally efficient deniable communication. 2234-2238
Th-AM-2-9: Quantum Information Theory
- Manoj Gopalkrishnan, Abhishek Deshpande, Varshith Kandula, Praveen Sriram:
A Bayesian view of single-qubit clocks, and an energy versus accuracy tradeoff. 2239-2243 - Xin Wang, Runyao Duan:
On the quantum no-signalling assisted zero-error classical simulation cost of non-commutative bipartite graphs. 2244-2248 - Anna Jencová:
Comparison of quantum channels and statistical experiments. 2249-2253 - Benno Salwey, Stefan Wolf:
Stronger attacks on causality-based key agreement. 2254-2258 - Runyao Duan, Cheng Guo, Chi-Kwong Li, Yinan Li:
Parallel distinguishability of quantum operations. 2259-2263
Th-PM-1-1: Quantum Codes 1
- Tyler Jackson, Markus Grassl, Bei Zeng:
Codeword stabilized quantum codes for asymmetric channels. 2264-2268 - Tyler Jackson, Markus Grassl, Bei Zeng:
Concatenated codes for amplitude damping. 2269-2273 - Alexei E. Ashikhmin, Ching-Yi Lai, Todd A. Brun:
Correction of data and syndrome errors by stabilizer codes. 2274-2278 - Sangjun Lee, Andreas Klappenecker:
Generalized fault-tolerant quantum computation over nice rings. 2279-2283
Th-PM-1-2: Inequalities 2
- Peng Xu, James Melbourne, Mokshay M. Madiman:
Reverse entropy power inequalities for s-concave densities. 2284-2288 - Eshed Ram, Igal Sason:
On Rényi entropy power inequalities. 2289-2293 - Thomas A. Courtade:
Strengthening the entropy power inequality. 2294-2298 - Jun Chen, Hao Ye, Chao Tian, Tie Liu, Zhiqing Xiao:
Cyclically symmetric entropy inequalities. 2299-2303 - Jihad Fahs, Ibrahim C. Abou-Faycal:
Generalized fisher information and upper bounds on the differential entropy of independent sums. 2304-2308
Th-PM-1-3: Data Exchange Problems
- Kai Cai, Guangyue Han:
Coding advantage in communications among peers. 2309-2313 - Ni Ding, Chung Chan, Qiaoqiao Zhou, Rodney A. Kennedy, Parastoo Sadeghi:
Fairness in communication for omniscience. 2314-2318 - Hooshang Ghasemi, Aditya Ramamoorthy:
Further results on lower bounds for coded caching. 2319-2323 - Anoosheh Heidarzadeh, Muxi Yan, Alex Sprintson:
Cooperative data exchange with priority classes. 2324-2328 - Himanshu Tyagi, Shun Watanabe:
Universal multiparty data exchange. 2329-2333
Th-PM-1-4: Network Coding 4
- Zhijie Ren, Jasper Goseling, Jos H. Weber, Michael Gastpar:
On the energy benefit of compute-and-forward for multiple unicasts. 2334-2338 - Gabriele Spini, Gilles Zémor:
Universally Secure Network Coding with feedback. 2339-2343 - Jinming Wen, Xiao-Wen Chang:
A linearithmic time algorithm for a shortest vector problem in compute-and-forward design. 2344-2348 - Hoover H. F. Yin, Shenghao Yang, Qiaoqiao Zhou, Lily M. L. Yung:
Adaptive recoding for BATS codes. 2349-2353 - Ardhendu Tripathy, Aditya Ramamoorthy:
On computation rates for arithmetic sum. 2354-2358
Th-PM-1-5: Compressed Sensing 3
- Namyoon Lee, Song-Nam Hong:
Coded compressive sensing: A compute-and-recover approach. 2359-2363 - Jinming Wen, Zhengchun Zhou, Jian Wang, Xiaohu Tang, Qun Mo:
A sharp condition for exact support recovery of sparse signals with orthogonal matching pursuit. 2364-2368 - Shirin Jalali, H. Vincent Poor:
Universal compressed sensing. 2369-2373 - Kyung-Su Kim, Sae-Young Chung:
Two-stage orthogonal Subspace Matching Pursuit for joint sparse recovery. 2374-2378 - Ju Sun, Qing Qu, John Wright:
A geometric analysis of phase retrieval. 2379-2383
Th-PM-1-6: Information Theory in Control
- Jui Wu, Achilleas Anastasopoulos:
Zero-rate achievability of posterior matching schemes for channels with memory. 2384-2388 - Christopher Rose:
State estimation, wireless tropes, demons and uncertainty. 2389-2393 - Serdar Yüksel:
Stationarity and ergodicity of stochastic non-linear systems controlled over communication channels. 2394-2398 - Takashi Tanaka, Karl Henrik Johansson, Tobias J. Oechtering, Henrik Sandberg, Mikael Skoglund:
Rate of prefix-free codes in LQG control systems. 2399-2403 - Anatoly Khina, Wael Halbawi, Babak Hassibi:
(Almost) practical tree codes. 2404-2408
Th-PM-1-7: Finite Blocklength Topics
- Lin Zhou, Vincent Y. F. Tan, Mehul Motani:
Second-order coding region for the discrete lossy Gray-Wyner source coding problem. 2409-2413 - Lin Zhou, Vincent Y. F. Tan, Mehul Motani:
Second-order coding region for the discrete successive refinement source coding problem. 2414-2418 - Lan V. Truong, Silas L. Fong, Vincent Y. F. Tan:
On second-order asymptotics of AWGN channels with feedback under the expected power constraint. 2419-2423 - Lars Palzer, Roy Timo:
Fixed-length compression for letter-based fidelity measures in the finite blocklength regime. 2424-2428 - Yucel Altug, H. Vincent Poor, Sergio Verdú:
On channel dispersion per unit cost. 2429-2433
Th-PM-1-8: Physical Layer Security
- Parisa Babaheidarian, Somayeh Salimi, Panos Papadimitratos:
Security in the Gaussian interference channel: Weak and moderately weak interference regimes. 2434-2438 - Remi A. Chou, Aylin Yener:
Multiuser authentication with anonymity constraints over noisy channels. 2439-2443 - Karim A. Banawan, Sennur Ulukus:
Secrecy in broadcast channel with combating helpers and interference channel with selfish users. 2444-2448 - Joseph Kampeas, Asaf Cohen, Omer Gurewitz:
On secrecy rates and outage in multi-user multi-eavesdroppers MISO systems. 2449-2453 - Meryem Benammar, Abdellatif Zaidi:
Secure lossy helper and Gray-Wyner problems. 2454-2458
Th-PM-1-9: Wireless Sensor Networks
- Osman Yagan:
Connectivity in inhomogeneous random key graphs. 2459-2463 - Rashad Eletreby, Osman Yagan:
Minimum node degree in inhomogeneous random key graphs with unreliable links. 2464-2468 - Alessandro Biason, Urbashi Mitra, Michele Zorzi:
Improved active sensing performance in wireless sensor networks via channel state information. 2469-2473 - Po-Ning Chen, Yunghsiang S. Han, Hsuan-Yin Lin, Pramod K. Varshney:
Optimal Byzantine attack for distributed inference with M-ary quantized data. 2474-2478 - Craig Wilson, Venugopal V. Veeravalli:
MMSE estimation in a sensor network in the presence of an adversary. 2479-2483
Fr-AM-1-1: Quantum Codes 2
- Masahiro Takeoka, Kaushik P. Seshadreesan, Mark M. Wilde:
Unconstrained distillation capacities of a pure-loss bosonic broadcast channel. 2484-2488 - Walter O. Krawec:
Asymptotic analysis of a three state quantum cryptographic protocol. 2489-2493 - Marius Junge, Renato Renner, David Sutter, Mark M. Wilde, Andreas J. Winter:
Universal recoverability in quantum information. 2494-2498 - Felipe Gomes Lacerda, Joseph M. Renes, Volkher B. Scholz:
Coherent state constellations for Bosonic Gaussian channels. 2499-2503
Fr-AM-1-2: Secret Keys and Secret Sharing
- Manuj Mukherjee, Chung Chan, Navin Kashyap, Qiaoqiao Zhou:
Bounds on the communication rate needed to achieve SK capacity in the hypergraphical source model. 2504-2508 - Mahdi Cheraghchi:
Nearly optimal robust secret sharing. 2509-2513 - Chung Chan, Ali Al-Bashabsheh, Qiaoqiao Zhou:
Incremental and decremental secret key agreement. 2514-2518 - Yongge Wang:
Quantum resistant random linear code based public key encryption scheme RLCE. 2519-2523
Fr-AM-1-3: LDPC Codes 5
- Yoones Hashemi, Amir H. Banihashemi:
Minimal characterization and provably efficient exhaustive search algorithm for elementary trapping sets of variable-regular LDPC codes. 2524-2528 - Ilya Dumer, Alexey A. Kovalev, Leonid P. Pryadko:
Distance verification for LDPC codes. 2529-2533 - Asit Kumar Pradhan, Andrew Thangaraj:
Near-capacity protograph doubly-generalized LDPC codes with block thresholds. 2534-2538 - Homayoon Hatami, David G. M. Mitchell, Daniel J. Costello Jr., Thomas E. Fuja:
Performance bounds for quantized LDPC decoders based on absorbing sets. 2539-2543
Fr-AM-1-4: Gabidulin Codes
- Anna-Lena Horlemann-Trautmann, Kyle Marshall, Joachim Rosenthal:
Considerations for rank-based cryptosystems. 2544-2548 - Sven Müelich, Sven Puchinger, David Mödinger, Martin Bossert:
An alternative decoding method for Gabidulin codes in characteristic zero. 2549-2553 - Sven Puchinger, Antonia Wachter-Zeh:
Sub-quadratic decoding of Gabidulin codes. 2554-2558 - Gwezheneg Robert:
A quadratic Welch-Berlekamp algorithm to decode generalized Gabidulin codes, and some variants. 2559-2563
Fr-AM-1-5: Age of Information
- Clement Kam, Sastry Kompella, Gam D. Nguyen, Jeffrey E. Wieselthier, Anthony Ephremides:
Age of information with a packet deadline. 2564-2568 - Ahmed M. Bedewy, Yin Sun, Ness B. Shroff:
Optimizing data freshness, throughput, and delay in multi-server information-update systems. 2569-2573 - Elie Najm, Rajai Nasser:
Age of information: The gamma awakening. 2574-2578 - Kun Chen, Longbo Huang:
Age-of-information in the presence of error. 2579-2583
Fr-AM-1-6: Wireless Communications 5
- Grace Villacrés, Tobias Koch:
Wireless networks of bounded capacity. 2584-2588 - Martina Cardone, Christina Fragouli, Daniela Tuninetti:
On network simplification for Gaussian Half-Duplex diamond networks. 2589-2593 - Yahya H. Ezzeldin, Ayan Sengupta, Christina Fragouli:
Wireless network simplification: Beyond diamond networks. 2594-2598 - Yi Li, Mustafa Cenk Gursoy, Senem Velipasalar:
Throughput of two-hop wireless channels with queueing constraints and finite blocklength codes. 2599-2603 - Sihuang Hu, Ofer Shayevitz:
The ρ-capacity of a graph. 2604-2608
Yi Li, M. Cenk Gursoy, Senem V elipasalar Fr-AM-1-7: Special Topics in Shannon Theory 1
- Imre Csiszár, Frantisek Matús:
Convergence of generalized entropy minimizers in sequences of convex problems. 2609-2613 - Jun Chen, Amir Salimi, Tie Liu, Chao Tian:
Orbit-entropy cones and extremal pairwise orbit-entropy inequalities. 2614-2618 - Eric Graves, Tan F. Wong:
Information stabilization of images over discrete memoryless channels. 2619-2623
Fr-AM-1-8: Interference in Wireless Networks 3
- Alireza Vahid, A. Robert Calderbank:
When does spatial correlation add value to delayed channel state information? 2624-2628 - Chunhua Geng, Syed Ali Jafar:
On the optimality of zero-forcing and treating interference as noise for K-user MIMO interference channels. 2629-2633 - Serj Haddad, Olivier Lévêque:
On the impact of sparsity on the broadcast capacity of wireless networks. 2634-2638 - Sunghyun Kim, Soheil Mohajer, Changho Suh:
Role of a relay in bursty networks with correlated transmissions. 2639-2643
Fr-AM-1-9: DNA-based Storage
- Ryan Gabrys, Eitan Yaakobi, Olgica Milenkovic:
Codes in the damerau distance for DNA storage. 2644-2648 - S. M. Hossein Tabatabaei Yazdi, Han Mao Kiah, Olgica Milenkovic:
Weakly mutually uncorrelated codes. 2649-2653 - Zuling Chang, Johan Chrisnata, Martianus Frederic Ezerman, Han Mao Kiah:
On the number of DNA sequence profiles for practical values of read lengths. 2654-2658
Fr-AM-2-1: Random Coding Bounds
- Neri Merhav:
The generalized stochastic likelihood decoder: Random coding and expurgated bounds. 2659-2663 - Jonathan Scarlett, Vincent Y. F. Tan, Giuseppe Durisi:
The dispersion of nearest-neighbor decoding for additive non-Gaussian channels. 2664-2668 - Wei Yang, Austin Collins, Giuseppe Durisi, Yury Polyanskiy, H. Vincent Poor:
A beta-beta achievability bound with applications. 2669-2673 - Kasper Fløe Trillingsgaard, Wei Yang, Giuseppe Durisi, Petar Popovski:
Variable-length coding with stop-feedback for the common-message broadcast channel. 2674-2678
Fr-AM-2-2: Distributions and Hypothesis Testing
- Anit Kumar Sahu, Soummya Kar:
Distributed recursive composite hypothesis testing: Imperfect communication. 2679-2683 - Yuting Wei, Martin J. Wainwright:
Sharp minimax bounds for testing discrete monotone distributions. 2684-2688 - Moein Falahatgar, Alon Orlitsky, Venkatadheeraj Pichapati, Ananda Theertha Suresh:
Learning Markov distributions: Does estimation trump compression? 2689-2693 - Adriano Pastore, Michael Gastpar:
Locally differentially-private distribution estimation. 2694-2698 - Theodoros Tsiligkaridis:
Asynchronous decentralized algorithms for the noisy 20 questions problem. 2699-2703
Fr-AM-2-3: LDPC Codes 6
- Irina E. Bocharova, Boris D. Kudryashov, Vitaly Skachek, Yauhen Yakimenka:
Low complexity algorithm approaching the ML decoding of binary LDPC codes. 2704-2708 - Ahmed H. Hareedy, Chinmayi Lanka, Clayton Schoeny, Lara Dolecek:
The weight consistency matrix framework for general non-binary LDPC code optimization: Applications in flash memories. 2709-2713 - Hassan Khodaiemehr, Mohammad-Reza Sadeghi, Daniel Panario:
Construction of full-diversity 1-level LDPC lattices for block-fading channels. 2714-2718 - Hiroshi Abe, Kenta Kasai:
Spatially-coupled codes approach symmetric information rate of finite-state Markov fading channels. 2719-2723
Fr-AM-2-4: Network Coding 5
- Nikhil Karamchandani, Suhas N. Diggavi, Giuseppe Caire, Shlomo Shamai:
Rate and delay for coded caching with carrier aggregation. 2724-2728 - Wenjie Li, Francesca Bassi, Michel Kieffer:
Sparse random linear network coding for data compression in WSNs. 2729-2733 - Yaoqing Yang, Soummya Kar, Pulkit Grover:
Energy efficient distributed coding for data collection in a noisy sparse network. 2734-2738
Fr-AM-2-5: Energy Harvesting 3
- Abdulrahman Baknina, Sennur Ulukus:
Online policies for multiple access channel with common energy harvesting source. 2739-2743 - Huseyin A. Inan, Dor Shaviv, Ayfer Özgür:
Capacity of the energy harvesting Gaussian MAC. 2744-2748 - Zhengwei Ni, Mehul Motani:
Optimization of time-switching energy harvesting receivers over multiple transmission blocks. 2749-2753 - Roberto Valentini, Marco Levorato:
Optimal aging-aware channel access control for wireless networks with energy harvesting. 2754-2758
Fr-AM-2-6: Wireless Communications 6
- Subhajit Majhi, Patrick Mitran:
On the capacity of a class of dual-band interference channels. 2759-2763 - Ryan Keating, Dongning Guo:
Multiuser two-way ranging. 2764-2768 - Gozde Ozcan, Mustafa Ozmen, Mustafa Cenk Gursoy:
QoS-driven energy-efficient power control with Markov arrivals and finite-alphabet inputs. 2769-2773 - Ahmed Hindy, Aria Nosratinia:
Lattice strategies for the ergodic fading dirty paper channel. 2774-2778
Fr-AM-2-7: Special Topics in Shannon Theory 2
- Martin Mittelbach, Eduard A. Jorswieck:
Cascade channels with infinite memory. 2779-2783 - Lele Wang, Sihuang Hu, Ofer Shayevitz:
Quickest sequence phase detection. 2784-2788 - Giovanni Alberti, Helmut Bölcskei, Camillo De Lellis, Günther Koliander, Erwin Riegler:
Lossless linear analog compression. 2789-2793 - Jiantao Jiao, Kartik Venkat, Tsachy Weissman:
Mutual information, relative entropy and estimation error in semi-martingale channels. 2794-2798
Fr-AM-2-8: Wiretap Channels 1
- Ziv Goldfeld, Paul Cuff, Haim H. Permuter:
Semantic-security capacity for wiretap channels of type II. 2799-2803 - Mohamed S. Nafea, Aylin Yener:
A new wiretap channel model and its strong secrecy capacity. 2804-2808 - Igor Bjelakovic, Jafar Mohammadi, Slawomir Stanczak:
Strong secrecy and stealth for broadcast channels with confidential messages. 2809-2813 - Karim A. Banawan, Sennur Ulukus:
Achievable secrecy rates in the multiple access wiretap channel with deviating users. 2814-2818 - Si-Hyeon Lee, Wanyao Zhao, Ashish Khisti:
Secure degrees of freedom of the Gaussian diamond-wiretap channel. 2819-2823
Fr-AM-2-9: Permutations in Coding Theory / Index Coding 2
- Yeow Meng Chee, Han Mao Kiah, San Ling, Tuan Thanh Nguyen, Van Khu Vu, Xiande Zhang:
String concatenation construction for Chebyshev permutation channel codes. 2824-2828 - Yonatan Yehezkeally, Moshe Schwartz:
Limited-magnitude error-correcting Gray codes for rank modulation. 2829-2833 - Lawrence Ong, Badri N. Vellambi, Phee Lep Yeoh, Jörg Kliewer, Jinhong Yuan:
Secure index coding: Existence and construction. 2834-2838 - Lakshmi Prasad Natarajan, Yi Hong, Emanuele Viterbo:
New error correcting codes for informed receivers. 2839-2843
Fr-PM-1-1: Quantum Information and Communication
- Mario Berta, Omar Fawzi, Marco Tomamichel:
Exploiting variational formulas for quantum relative entropy. 2844-2848 - Felix Leditzky, Mark M. Wilde, Nilanjana Datta:
Strong converse theorems using Rényi entropies. 2849-2853 - Gonzalo Vazquez-Vilar:
Multiple quantum hypothesis testing expressions and classical-quantum channel converse bounds. 2854-2857 - Andreas J. Winter:
"Pretty strong" converse for the private capacity of degraded quantum wiretap channels. 2858-2862
Fr-PM-1-2: Group Testing 3
- Shashanka Ubaru, Arya Mazumdar, Alexander Barg:
Group testing schemes from low-weight codewords of BCH codes. 2863-2867 - Jonathan Scarlett, Volkan Cevher:
Converse bounds for noisy group testing with arbitrary measurement matrices. 2868-2872 - Kangwook Lee, Ramtin Pedarsani, Kannan Ramchandran:
SAFFRON: A fast, efficient, and robust framework for group testing based on sparse-graph codes. 2873-2877 - Holger Boche, Ullrich J. Mönich, Ezra Tampubolon:
Strong divergence of the Shannon sampling series for an infinite dimensional signal space. 2878-2882
Fr-PM-1-3: LDPC Codes 7
- Ting Liu, Chao-Kai Wen, Shi Jin, Xiaohu You:
Generalized turbo signal recovery for nonlinear measurements and orthogonal sensing matrices. 2883-2887 - Jan Lewandowsky, Maximilian Stark, Gerhard Bauch:
Information Bottleneck Graphs for receiver design. 2888-2892 - David Matas, Meritxell Lamarca:
Asymptotic MAP upper bounds for LDPC codes. 2893-2897
Fr-PM-1-4: Delays in Networks
- Rafid Mahmood, Ahmed Badr, Ashish Khisti:
Low delay network streaming under burst losses. 2898-2902 - Chih-Chun Wang:
Delay-constrained capacity for broadcast erasure channels: A linear-coding-based study. 2903-2907 - Minghua Chen, Ye Tian, Chih-Chun Wang:
On coding capacity of delay-constrained network information flow: An algebraic approach. 2908-2912
Fr-PM-1-5: Complexity and Cryptography 1
- Divesh Aggarwal, Kaave Hosseini, Shachar Lovett:
Affine-malleable extractors, spectrum doubling, and application to privacy amplification. 2913-2917 - Jingbo Liu, Paul W. Cuff, Sergio Verdú:
Key generation with limited interaction. 2918-2922 - Sung-Il Pae:
Binarizations in random number generation. 2923-2927 - Olivier Rioul, Patrick Solé, Sylvain Guilley, Jean-Luc Danger:
On the entropy of Physically Unclonable Functions. 2928-2932
Fr-PM-1-6: Wireless Communications 7
- Bin Qian, Wai Ho Mow:
An extended Tanner graph approach to decoding LDPC codes over decode-and-forward relay channels. 2933-2937 - Doha Hamza, Jeff S. Shamma:
A blind matching algorithm for cognitive radio networks. 2938-2942 - Xiaobin Wu, Thomas E. Fuja, Thomas G. Pratt:
Channel coding for wireless communication via electromagnetic polarization. 2943-2947 - Kareem M. Attiah, Karim G. Seddik, Ramy H. Gohary, Halim Yanikomeroglu:
A systematic design approach for non-coherent Grassmannian constellations. 2948-2952
Fr-PM-1-7: Lossy Compression 3
- Yanina Shkel, Sergio Verdú:
A single-shot approach to lossy source coding under logarithmic loss. 2953-2957 - Ryo Nomura, Hideki Yagi:
Variable-length lossy source coding allowing some probability of union of overflow and excess distortion. 2958-2962 - Paul Cuff:
Soft covering with high probability. 2963-2967 - Vinay Praneeth Boda, Prakash Narayan:
Independent and memoryless sampling rate distortion. 2968-2972
Fr-PM-1-8: Wiretap Channels 2
- Zohaib Hassan Awan, Abdellatif Zaidi, Aydin Sezgin:
On SDoF of multi-receiver wiretap channel with alternating CSIT. 2973-2977 - Rick Fritschek, Gerhard Wunder:
Towards a constant-gap sum-capacity result for the Gaussian wiretap channel with a helper. 2978-2982 - Mohamed S. Nafea, Aylin Yener:
The multiple access wiretap channel II with a noisy main channel. 2983-2987 - Sina Rezaei Aghdam, Tolga M. Duman:
Low complexity precoding for MIMOME wiretap channels based on cut-off rate. 2988-2992
Fr-PM-1-9: MIMO and Space-Time Coding
- Laura Luzzi, Roope Vehkalahti, Alexander Gorodnik:
Towards a complete DMT classification of division algebra codes. 2993-2997 - Michal Kaliszan, Giuseppe Caire, Slawomir Stanczak:
On the throughput rate of wireless multipoint multicasting. 2998-3002 - Smarajit Das:
On the decoding delay of rate-1/2 complex orthogonal designs. 3003-3007
Fr-PM-2-3: LDPC Codes 8
- Liyuan Song, Qin Huang, Zulin Wang:
Set min-sum decoding algorithm for non-binary LDPC codes. 3008-3012 - Naoaki Kokubun, Hironori Uchikawa:
Integrated parallel interleaved concatenation for lowering error floors of LDPC codes. 3013-3017 - Takayuki Nozaki:
Cutsize distributions of balanced hypergraph bipartitions for random hypergraphs. 3018-3022 - Xijin Mu, Baoming Bai, Rui Zhang:
Multiplicative repetition based superposition transmission of nonbinary codes. 3023-3027
Fr-PM-2-4: Graphical Methods / Weight Distribution
- Jennifer Tang, Da Wang, Yury Polyanskiy, Gregory W. Wornell:
Defect tolerance: Fundamental limits and examples. 3028-3032 - Bernhard C. Geiger, Christoph Hofer-Temmel:
Graph-based lossless Markov lumpings. 3033-3037 - Christoph Pacher, Philipp Grabenweger, Dimitris E. Simos:
Weight distribution of the syndrome of linear codes and connections to combinatorial designs. 3038-3042
Fr-PM-2-5: Complexity and Cryptography 2
- Elena Egorova, Marcel Fernandez, Grigory A. Kabatiansky, Moon Ho Lee:
Signature codes for the A-channel and collusion-secure multimedia fingerprinting codes. 3043-3047 - Julian Loss, Ueli Maurer, Daniel Tschudi:
Hierarchy of three-party consistency specifications. 3048-3052 - Deepesh Data:
Secure computation of randomized functions. 3053-3057 - Gregor Seiler, Ueli Maurer:
On the impossibility of information-theoretic composable coin toss extension. 3058-3061
Fr-PM-2-7: Source and Channel Coding
- Morteza Varasteh, Osvaldo Simeone, Deniz Gündüz:
Joint source-channel coding with one-bit ADC front end. 3062-3066 - Arya Mazumdar, Yury Polyanskiy, Ankit Singh Rawat, Hajir Roozbehani:
Distance preserving maps and combinatorial joint source-channel coding for large alphabets. 3067-3071 - Si-Hyeon Lee, Vincent Y. F. Tan, Ashish Khisti:
Streaming data transmission in the moderate deviations and central limit regimes. 3072-3076
Fr-PM-2-8: Wiretap Channels 3
- Rafael F. Schaefer, Holger Boche, H. Vincent Poor:
Super-activation as a unique feature of arbitrarily varying wiretap channels. 3077-3081 - Laura Luzzi, Cong Ling, Roope Vehkalahti:
Almost universal codes for fading wiretap channels. 3082-3086 - Wei Yang, Rafael F. Schaefer, H. Vincent Poor:
Finite-blocklength bounds for wiretap channels. 3087-3091
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-03-22 22:29 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
