default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDISIT 2014: Honolulu, HI, USA
- 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29 - July 4, 2014. IEEE 2014, ISBN 978-1-4799-5186-4
- Anders Høst-Madsen, Aleksandar Kavcic, Venugopal V. Veeravalli:
Welcome. 1
Lossy Source Coding
- Amir Ingber, Tsachy Weissman:
Compression for similarity identification: Fundamental limits. 1-5 - Farzad Farnoud, Moshe Schwartz
, Jehoshua Bruck:
Bounds for permutation rate-distortion. 6-10 - Da Wang, Arya Mazumdar, Gregory W. Wornell:
Lossy compression of permutations. 11-15 - Roy Timo, Alex J. Grant, Badri N. Vellambi:
Streaming with autoregressive-hamming distortion for ultra short-delay communications. 16-20
Wiretap Channel
- Jun Muramatsu:
General formula for secrecy capacity of wiretap channel with noncausal state. 21-25 - Yanling Chen, Onur Ozan Koyluoglu, Aydin Sezgin:
On the achievable individual-secrecy rate region for broadcast channels with receiver side information. 26-30 - Zohaib Hassan Awan, Abdellatif Zaidi, Aydin Sezgin:
Achievable secure degrees of freedom of MISO broadcast channel With alternating CSIT. 31-35 - Sina Lashgari, Amir Salman Avestimehr:
Blind wiretap channel with delayed CSIT. 36-40
Caching for Wireless
- Avik Sengupta, Ravi Tandon, T. Charles Clancy:
Decentralized caching with secure delivery. 41-45 - An Liu, Vincent K. N. Lau:
Cache-induced opportunistic MIMO cooperation: A new paradigm for future wireless content access networks. 46-50 - Pol Blasco, Deniz Gündüz:
Multi-armed bandit optimization of cache content in wireless infostation networks. 51-55 - Jad Hachem, Nikhil Karamchandani, Suhas N. Diggavi:
Multi-level coded caching. 56-60
Ad Hoc Networks
- Cheol Jeong, Won-Yong Shin:
Ad hoc networking with rate-limited infrastructure: Generalized capacity scaling. 61-65 - I-Wei Lai, Chia-Han Lee, Kwang-Cheng Chen, Ezio Biglieri:
Performance of path-time codes for end-to-end transmission in ad hoc multihop networks. 66-70 - Song-Nam Hong, Giuseppe Caire:
Demystifying the scaling laws of dense wireless networks: No linear scaling in practice. 71-75 - Felipe Gómez-Cuba, Sundeep Rangan, Elza Erkip:
Scaling laws for Infrastructure Single and multihop wireless networks in wideband regimes. 76-80
Network Information Theory 1
- Jin Sima, Wei Chen:
Joint network and Gelfand-Pinsker coding for 3-receiver Gaussian broadcast channels with receiver message side information. 81-85 - Ruchen Duan, Yingbin Liang, Ashish Khisti, Shlomo Shamai:
State-dependent parallel Gaussian channels with a common helper in high power regime. 86-90 - Ronit Bustin, H. Vincent Poor, Shlomo Shamai:
The effect of maximal rate codes on the interfering message rate. 91-95 - Ahmed Attia Abotabl, Aria Nosratinia:
Multi-level coding and multi-stage decoding in MAC, broadcast, and relay channel. 96-100
Fundamentals of Network Coding
- Randall Dougherty, Eric Freiling, Kenneth Zeger:
Characteristic-dependent linear rank inequalities and network coding applications. 101-105 - Wentao Huang, Tracey Ho, Michael Langberg, Jörg Kliewer:
Reverse edge cut-set bounds for secure network coding. 106-110 - Chun Meng, Athina Markopoulou:
On routing-optimal networks for multiple unicasts. 111-115 - Péter Babarczi, János Tapolcai, Lajos Rónyai, Muriel Médard:
Resilient flow decomposition of unicast connections with network coding. 116-120
Polar Coding
- Liang Zhang, Zhaoyang Zhang, Xianbin Wang, Qilian Yu, Yan Chen:
On the puncturing patterns for punctured polar codes. 121-125 - David Burshtein, Dina Goldin:
On the scaling of the blocklength in some polar coding schemes. 126-130 - Marco Mondelli, Seyed Hamed Hassani, Rüdiger L. Urbanke:
From polar to Reed-Muller codes: A technique to improve the finite-length performance. 131-135 - Mine Alsan:
A novel partial order for the information sets of polar codes over B-DMCs. 136-140
Classical-Quantum Channels
- Marco Tomamichel, Vincent Yan Fu Tan:
Second order refinements for the classical capacity of quantum channels with separable input states. 141-145 - Holger Boche, Minglai Cai, Christian Deppe:
Classical-quantum arbitrarily varying wiretap channel - A capacity formula with Ahlswede Dichotomy - Resources. 146-150 - Marco Dalai, Andreas J. Winter:
Constant compositions in the sphere packing bound for classical-quantum channels. 151-155 - Holger Boche, Janis Nötzel:
Cooperation for the classical-quantum multiple access channel. 156-160 - Gowtham Ramani Kumar, Cheuk Ting Li, Abbas El Gamal:
Exact common information. 161-165 - Nigel Burke, John Enns:
Coincidence of 1- and 2-dimensional entropies. 166-170 - Govind Ramnarayan, Gireeja Ranade, Anant Sahai:
Side-information in control and estimation. 171-175 - Georg Böcherer, Rana Ali Amjad:
Informational divergence and entropy rate on rooted trees with probabilities. 176-180
Quantization
- Or Ordentlich, Uri Erez:
Integer-Forcing source coding. 181-185 - Tobias Koch:
On the dither-quantized Gaussian channel at low SNR. 186-190 - Ken-ichi Iwata, Shin-ya Ozawa:
Quantizer design for outputs of binary-input discrete memoryless channels using SMAWK algorithm. 191-195 - Da Wang, Yury Polyanskiy, Gregory W. Wornell:
Scalar quantization with noisy partitions and its application to Flash ADC design. 196-200
MIMO Wiretap Channel
- Sergey Loyka, Charalambos D. Charalambous:
Rank-deficient solutions for optimal signaling over secure MIMO channels. 201-205 - Anatoly Khina, Yuval Kochman, Ashish Khisti:
Decomposing the MIMO wiretap channel. 206-210 - Ravi Tandon, Pablo Piantanida, Shlomo Shamai:
On multi-user MISO wiretap channels with delayed CSIT. 211-215 - Pritam Mukherjee, Ravi Tandon, Sennur Ulukus:
MISO broadcast channels with confidential messages and alternating CSIT. 216-220
Approximate Message Passage
- Saeid Haghighatshoar:
Multi terminal probabilistic compressed sensing. 221-225 - Yoshiyuki Kabashima, Mikko Vehkaperä:
Signal recovery using expectation consistent approximation for linear observations. 226-230 - Xiaochen Zhao, Wei Dai:
Power allocation in compressed sensing of non-uniformly sparse signals. 231-235 - Sundeep Rangan, Philip Schniter, Alyson K. Fletcher:
On the convergence of approximate message passing with arbitrary matrices. 236-240
Wireless Networks
- Jinfeng Du, Muriel Médard, Ming Xiao, Mikael Skoglund:
Scalable upper bounding models for wireless networks. 241-245 - Jun Zhao:
Minimum node degree and k-connectivity in wireless networks with unreliable links. 246-250 - Harpreet S. Dhillon, Giuseppe Caire:
Information theoretic upper bound on the capacity of wireless backhaul networks. 251-255 - Huazi Zhang, Yufan Huang, Zhaoyang Zhang, Huaiyu Dai:
Mobile conductance in sparse networks and mobility-connectivity tradeoff. 256-260
Network Information Theory 2
- Alex Dytso, Natasha Devroye, Daniela Tuninetti:
On Gaussian interference channels with mixed gaussian and discrete inputs. 261-265 - Ebrahim MolavianJazi, J. Nicholas Laneman:
On the second-order cost of TDMA for Gaussian multiple access. 266-270 - Ilan Shomorony, Amir Salman Avestimehr:
A generalized cut-set bound for deterministic multi-flow networks and its applications. 271-275 - Reza Khosravi-Farsani:
The sum-rate capacity of general degraded interference networks with arbitrary topologies. 276-280
Index Coding 1
- Mehrdad Tahmasbi, Amirbehshad Shahrasbi, Amin Gohari:
Critical graphs in index coding. 281-285 - Fatemeh Arbabjolfaei, Young-Han Kim:
Local time sharing for index coding. 286-290 - Karthikeyan Shanmugam, Alexandros G. Dimakis, Michael Langberg:
Graph theory versus minimum rank for index coding. 291-295 - Karthikeyan Shanmugam, Alexandros G. Dimakis:
Bounding multiple unicasts through index coding and Locally Repairable Codes. 296-300
Polar Coding - Theory and Practice
- Mine Alsan, Emre Telatar:
A simple proof of polarization and polarization for non-stationary channels. 301-305 - Marco Mondelli, Seyed Hamed Hassani, Rüdiger L. Urbanke, Igal Sason:
Achieving Marton's region for broadcast channels using polar codes. 306-310 - Lele Wang, Eren Sasoglu:
Polar coding for interference networks. 311-315 - Aria Ghasemian Sahebi, S. Sandeep Pradhan:
Polar codes for some multi-terminal communications problems. 316-320
Quantum Sensing and Measurements
- Mankei Tsang:
Mismatched quantum filtering and entropic information. 321-325 - Masahiro Takeoka, Saikat Guha, Mark M. Wilde:
Squashed entanglement and the two-way assisted capacities of a quantum channel. 326-330 - Mario Berta, Joseph M. Renes, Mark M. Wilde:
Identifying the information gain of a quantum measurement. 331-335 - Hari Krovi, Saikat Guha, Zachary Dutton, Marcus P. da Silva:
Optimal measurements for symmetric quantum states with applications to optical quantum communication. 336-340
Renyi Entropy and f-divergence
- Terence H. Chan, Alex J. Grant:
Bounds for constrained entropy maximisation. 341-345 - Christoph Bunte, Amos Lapidoth:
Codes for tasks and Rényi entropy rate. 346-350 - Jiantao Jiao, Thomas A. Courtade, Albert No, Kartik Venkat, Tsachy Weissman:
Information divergences and the curious case of the binary alphabet. 351-355 - Kevin R. Moon, Alfred O. Hero III:
Ensemble estimation of multivariate f-divergence. 356-360
Degrees of Freedom
- Anas Chaaban, Henning Maier, Aydin Sezgin:
The degrees-of-freedom of multi-way device-to-device communications is limited by 2. 361-365 - David T. H. Kao, Amir Salman Avestimehr:
Linear degrees of freedom of the MIMO X-channel with delayed CSIT. 366-370 - Daniel Zahavi, Ron Dabora:
On the generalized degrees-of-freedom of the phase fading Z-interference channel with a relay. 371-375 - Ahmed Wagdy, Amr El-Keyi, Tamer Khattab, Mohammed Nafie:
A degrees of freedom-optimal scheme for SISO X channel with synergistic alternating CSIT. 376-380 - Massimo Franceschetti:
On Landau's eigenvalue theorem and its applications. 381-385
Topics in Secrecy 1
- Kittipong Kittichokechai, Tobias J. Oechtering, Mikael Skoglund:
Lossy source coding with reconstruction privacy. 386-390 - Jianwei Xie, Sennur Ulukus:
Inseparability of the multiple access wiretap channel. 391-395 - Shaofeng Zou, Yingbin Liang, Lifeng Lai, Shlomo Shamai:
Layered secure broadcasting over MIMO channels and application in secret sharing. 396-400 - Mitsugu Iwamoto, Junji Shikata:
Secret sharing schemes based on min-entropies. 401-405 - Sanket Satpathy, Paul Cuff:
Secure coordination with a two-sided helper. 406-410
Coding and Communication Theory
- Uzi Pereg, Ido Tal:
Channel upgradation for non-binary input alphabets and MACs. 411-415 - Cheuk Ting Li, Abbas El Gamal:
An efficient feedback coding scheme with low error probability for discrete memoryless channels. 416-420 - Victor Y. Krachkovsky, Razmik Karabed, Shaohua Yang, Bruce A. Wilson:
On modulation coding for channels with cost constraints. 421-425 - Kasra Vakilinia, Tsung-Yi Chen, Sudarsan Vasista Srinivasan Ranganathan, Adam R. Williamson, Dariush Divsalar, Richard D. Wesel:
Short-blocklength non-binary LDPC codes with feedback-dependent incremental transmissions. 426-430 - Georg Bocherer:
Probabilistic signal shaping for bit-metric decoding. 431-435 - Karim G. Seddik:
On the stability of random multiple access with feedback exploitation and queue priority. 436-440 - Ying Cui, Edmund M. Yeh, Stephen V. Hanly:
Energy-efficient data transmission over multiple-access channels with QoS constraints. 441-445 - Stephen V. Hanly, Philip A. Whiting:
Stable scheduling in Heterogeneous Networks. 446-450 - Ying Cui, Edmund M. Yeh:
Delay optimal control and its connection to the dynamic backpressure algorithm. 451-455 - Anoosheh Heidarzadeh, Amir H. Banihashemi:
How much can knowledge of delay model help chunked coding over networks with perfect feedback? 456-460
Network Information Theory 3
- Jonathan Scarlett, Vincent Y. F. Tan:
Second-order asymptotics for the gaussian MAC with degraded message sets. 461-465 - Kia Khezeli, Jun Chen:
An improved outer bound on the admissible source region for broadcast channels with correlated sources. 466-470 - David Stotz, Helmut Bölcskei:
Explicit and almost sure conditions for K/2 degrees of freedom. 471-475 - Maksym A. Girnyk, Mikko Vehkaperä, Lars K. Rasmussen:
Asymptotic properties of dual-hop AF relay MIMO communication systems. 476-480 - Nir Weinberger, Neri Merhav:
Large deviations analysis of variable-rate Slepian-Wolf coding. 481-485
Index Coding 2
- Vijayvaradharaj T. Muralidharan, B. Sundar Rajan:
Linear index coding and representable discrete polymatroids. 486-490 - Lawrence Ong:
Linear Codes are Optimal for Index-Coding Instances with Five or Fewer Receivers. 491-495 - Jungho So, Sangwoon Kwak, Youngchul Sung:
Some new results on index coding when the number of data is less than the number of receivers. 496-500 - Sangwoon Kwak, Jungho So, Youngchul Sung:
An extended least difference greedy clique-cover algorithm for index coding. 501-505
Applications of Spatially Coupled Codes
- Takuya Okazaki, Kenta Kasai:
Spatially-coupled MacKay-Neal codes with no bit nodes of degree two achieve the capacity of BEC. 506-510 - Keke Liu, Mostafa El-Khamy, Jungwon Lee, Inyup Kang, Arvind Yedla:
Non-binary algebraic spatially-coupled quasi-cyclic LDPC codes. 511-515 - Santhosh Kumar, Avinash Vem, Krishna R. Narayanan, Henry D. Pfister:
Spatially-coupled codes for side-information problems. 516-520 - Kosuke Sakata, Kenta Kasai, Kohichi Sakaniwa:
Spatially-coupled precoded rateless codes with bounded degree achieve the capacity of BEC under BP decoding. 521-525
Quantum Protocols
- Amin Baumeler, Stefan Wolf:
Perfect signaling among three parties violating predefined causal order. 526-530 - Kosuke Ito, Wataru Kumagai, Masahito Hayashi:
Asymptotic reversibility of LOCC conversions. 531-535 - Christoph Hirche, Ciara Morgan:
Efficient achievability for quantum protocols using decoupling theorems. 536-540 - Holger Boche, Janis Nötzel:
Positivity, discontinuity, finite resources, nonzero error for arbitrarily varying quantum channels. 541-545 - Alexei E. Ashikhmin, Ching-Yi Lai, Todd A. Brun:
Robust quantum error syndrome extraction by classical coding. 546-550
Hypothesis Testing
- Anusha Lalitha, Anand D. Sarwate, Tara Javidi:
Social learning and distributed hypothesis testing. 551-555 - Yen-Wei Huang, Pierre Moulin:
Strong large deviations for composite hypothesis testing. 556-560 - David Mary, André Ferrari:
A non-asymptotic standardization of binomial counts in Higher Criticism. 561-565 - Ezio Biglieri, László Györfi:
Some remarks on robust binary hypothesis testing. 566-570 - Long Le, Douglas L. Jones:
Optimal simultaneous detection and signal and noise power estimation. 571-575
Multiterminal Source Coding 1
- Farhad Shirani Chaharsooghi, S. Sandeep Pradhan:
An achievable rate-distortion region for the multiple descriptions problem. 576-580 - Yasutada Oohama:
One helper source coding problem for a class of correlated sources with memory. 581-585 - Adel Zahedi, Jan Østergaard, Søren Holdt Jensen, Patrick A. Naylor, Soren Bech:
Distributed remote vector gaussian source coding with covariance distortion constraints. 586-590 - Pablo Piantanida, Leonardo Rey Vega, Alfred O. Hero III:
A proof of the Generalized Markov Lemma with countable infinite sources. 591-595
Secrecy Measures
- Curt Schieler, Paul Cuff:
The Henchman problem: Measuring secrecy by the minimum distortion in a list. 596-600 - Jie Hou, Gerhard Kramer:
Effective secrecy: Reliability, confusion and stealth. 601-605 - Boulat A. Bash, Dennis Goeckel, Don Towsley:
LPD communication when the warden does not know when. 606-610 - Swanand Kadhe, Sidharth Jaggi, Mayank Bakshi, Alex Sprintson:
Reliable, deniable, and hidable communication over multipath networks. 611-615
MIMO Channels
- Lu Wei, Zhong Zheng, Jukka Corander, Giorgio Taricco:
Outage capacity of OSTBCs over pico-cellular MIMO channels. 616-620 - Antonia M. Tulino, Giuseppe Caire, Shlomo Shamai:
Broadcast approach for the sparse-input random-sampled MIMO Gaussian channel. 621-625 - Jialin He, Dinesh Rajan:
Transmission strategies for MIMO channels with processing and transmit power constraints. 626-630 - Tao Cui, Qian Wang, Yindi Jing, Xinwei Yu:
SVD-based estimation for reduced-rank MIMO channel. 631-635
Relay Networks
- Sung Hoon Lim, Kwang Taik Kim, Young-Han Kim:
Distributed decode-forward for multicast. 636-640 - Siddhartha Brahma, Christina Fragouli:
Structure of optimal schedules in diamond networks. 641-645 - Ivan Wang Hei Ho, Soung Chang Liew, Lu Lu:
Feasibility study of physical-layer network coding in 802.11p VANETs. 646-650 - Wael Halbawi, Tracey Ho, Hongyi Yao, Iwan M. Duursma:
Distributed reed-solomon codes for simple multiple access networks. 651-655
Interference
- Ritesh Kolte, Ayfer Özgür, Haim H. Permuter:
The capacity region of a class of deterministic state-dependent Z-interference channels. 656-660 - Evan Everett, Ashutosh Sabharwal:
A signal-space analysis of spatial self-interference isolation for full-duplex wireless. 661-665 - Alireza Vahid, Mohammad Ali Maddah-Ali, Amir Salman Avestimehr:
Binary Fading Interference Channel with No CSIT. 666-670 - Shaunak Mishra, I-Hsiang Wang, Suhas N. Diggavi:
Harnessing bursty interference in multicarrier systems with feedback. 671-675
Locally Repairable Codes
- Sreechakra Goparaju, A. Robert Calderbank:
Binary cyclic codes that are locally repairable. 676-680 - Ankit Singh Rawat, Dimitris S. Papailiopoulos, Alexandros G. Dimakis, Sriram Vishwanath:
Locality and availability in distributed storage. 681-685 - Itzhak Tamo, Alexander Barg:
A family of optimal locally recoverable codes. 686-690 - Itzhak Tamo, Alexander Barg:
Bounds on locally recoverable codes with multiple recovering sets. 691-695
Pseudocodewords, Trapping Sets and Instantons
- Xishuo Liu, Stark C. Draper:
Instanton search algorithm for the ADMM penalized decoder. 696-700 - Vida Ravanmehr, David Declercq, Bane Vasic:
Check-hybrid GLDPC codes: Systematic elimination of trapping sets by super checks. 701-705 - Jean-Christophe Sibel, Sylvain Reynal, David Declercq:
An application of generalized belief propagation: splitting trapping sets in LDPC codes. 706-710 - Sudarsan Vasista Srinivasan Ranganathan, Dariush Divsalar, Kasra Vakilinia, Richard D. Wesel:
Design of high-rate irregular non-binary LDPC codes using algorithmic stopping-set cancellation. 711-715
Quantum Shannon Theory
- Manish K. Gupta, Mark M. Wilde:
Strong converse for entanglement-assisted capacity. 716-720 - Holger Boche, Gisbert Janssen:
Resource cost results for entanglement distillation and state merging under source uncertainties. 721-725 - Bhaskar Roy Bardhan, Raúl García-Patrón, Mark M. Wilde, Andreas J. Winter:
Strong converse for the capacity of quantum Gaussian channels. 726-730 - Marco Tomamichel, Mario Berta, Masahito Hayashi:
A duality relation connecting different quantum generalizations of the conditional Rényi entropy. 731-735
Sequential Detection
- James Falt, Steven D. Blostein:
A Bayesian approach to two-sided quickest change detection. 736-740 - Taposh Banerjee, Venugopal V. Veeravalli:
Data-efficient quickest change detection with unknown post-change distribution. 741-745 - Wenyi Zhang, George V. Moustakides, H. Vincent Poor:
Opportunistic detection rules. 746-750 - Daphney-Stavroula Zois, Urbashi Mitra:
A Weiss-Weinstein lower bound based sensing strategy for active state tracking. 751-755
Multiterminal Source Coding 2
- Farshad Naghibi, Somayeh Salimi, Mikael Skoglund:
The CEO problem with secrecy constraints. 756-760 - Avraham Reani, Neri Merhav:
Universal quantization for separate encodings and joint decoding of correlated sources. 761-765 - Yinfei Xu, Qiao Wang:
Vector Gaussian two-terminal CEO problem under sum distortion. 766-770 - Leonardo Rey Vega, Pablo Piantanida, Alfred O. Hero III:
On the three-terminal interactive lossy source coding problem. 771-775
Network Security
- Thomas A. Courtade, Thomas R. Halford:
Coded cooperative data exchange for a secret key. 776-780 - László Czap, Vinod M. Prabhakaran, Suhas N. Diggavi, Christina Fragouli:
Triangle network secrecy. 781-785 - Fan Cheng:
Optimality of routing on the wiretap network with simple network topology. 786-790 - Mahtab Mirmohseni, Panagiotis Papadimitratos:
Active adversaries from an information-theoretic perspective: Data modification attacks. 791-795
Energy Harvesting 1
- Omur Ozel, Kaya Tutuncuoglu, Sennur Ulukus, Aylin Yener:
Capacity of the discrete memoryless energy harvesting channel with side information. 796-800 - Yishun Dong, Ayfer Özgür:
Approximate capacity of energy harvesting communication with finite battery. 801-805 - Varun S. Jog, Venkat Anantharam:
An energy harvesting AWGN channel with a finite battery. 806-810 - Jing Yang:
Achievable rate for energy harvesting channel with finite blocklength. 811-815 - James Yifei Yang, Bruce E. Hajek:
A hybrid algorithm for content placement in distributed video on demand systems. 816-820 - Ankit Singh Rawat, Emina Soljanin:
Dynamic control of video quality for AVS. 821-825 - Mehrnaz Tavan, Roy D. Yates, Waheed U. Bajwa:
Information in tweets: Analysis of a bufferless timing channel model. 826-830 - Aseem Sharma, Krishna P. Jagannathan, Lav R. Varshney:
Information overload and human priority queuing. 831-835
Interference Channels 1
- Shaileshh Bojja Venkatakrishnan, Pramod Viswanath, Sreeram Kannan:
Degrees of Freedom for multiple-multicast traffic. 836-840 - Hua Sun, Syed Ali Jafar:
On the optimality of treating interference as noise for parallel deterministic interference networks. 841-845 - Xinping Yi, David Gesbert:
Topological interference management with transmitter cooperation. 846-850 - Ali Haghi, Amir K. Khandani:
The separability and ergodic sum-rate of parallel Gaussian interference channels. 851-855
Emerging Problems in Network Coding and Distributed Storage
- Nihar B. Shah, K. V. Rashmi, Kannan Ramchandran:
One extra bit of download ensures perfectly private information retrieval. 856-860 - Nihar B. Shah, Kangwook Lee, Kannan Ramchandran:
The MDS queue: Analysing the latency performance of erasure codes. 861-865 - Chih-Chun Wang, Minghua Chen:
Sending perishable information: Coding improves delay-constrained throughput even for single unicast. 866-870 - Zhiying Wang, Viveck R. Cadambe:
Multi-version coding in distributed storage. 871-875
Analysis of Spatially Coupled Codes
- Kechao Huang, David G. M. Mitchell, Lai Wei, Xiao Ma, Daniel J. Costello Jr.:
Performance comparison of non-binary LDPC block and spatially coupled codes. 876-880 - Lai Wei, Toshiaki Koike-Akino, David G. M. Mitchell, Thomas E. Fuja, Daniel J. Costello Jr.:
Threshold analysis of non-binary spatially-coupled LDPC codes with windowed decoding. 881-885 - David G. M. Mitchell, Lara Dolecek, Daniel J. Costello Jr.:
Absorbing set characterization of array-based spatially coupled LDPC codes. 886-890 - Markus Stinner, Pablo M. Olmos:
Analyzing finite-length protograph-based spatially coupled LDPC codes. 891-895
Quantum Error Control Codes 1
- Jihao Fan, Hanwu Chen:
Constructions of pure asymmetric quantum alternant codes based on subclasses of Alternant codes. 896-900 - Hye Won Chung, Saikat Guha, Lizhong Zheng:
Superadditivity of quantum channel coding rate with finite blocklength quantum measurements. 901-905 - Markus Grassl, Zhaohui Wei, Zhang-Qi Yin, Bei Zeng:
Quantum error-correcting codes for amplitude damping. 906-910 - Ching-Yi Lai, Min-Hsiu Hsieh:
The MacWilliams identity for quantum convolutional codes. 911-915
Information Theoretic Approaches to Prediction
- Michal Moshkovitz, Naftali Tishby:
Control your information for better predictions. 916-920 - Mert Pilanci, Martin J. Wainwright:
Randomized sketches of convex programs with sharp guarantees. 921-925 - Guangyao Zhou, Stuart Geman, Joachim M. Buhmann:
Sparse feature selection by information theory. 926-930 - Youssef Mroueh, Lorenzo Rosasco:
On efficiency and low sample complexity in phase retrieval. 931-935
Multiterminal Source Coding 3
- Tetsunao Matsuta, Tomohiko Uyematsu:
Rate-distortion functions for source coding when side information with unknown delay may be present. 936-940 - Yeow-Khiang Chia:
On multiterminal source coding with list decoding constraints. 941-945 - Jiantao Jiao, Thomas A. Courtade, Kartik Venkat, Tsachy Weissman:
Justification of logarithmic loss via the benefit of side information. 946-950 - Sinem Unal, Aaron B. Wagner:
Vector Gaussian rate-distortion with variable side information. 951-955
Coding Schemes for Secrecy
- Himanshu Tyagi, Alexander Vardy:
Explicit capacity-achieving coding scheme for the Gaussian wiretap channel. 956-960 - Yanfei Yan, Ling Liu, Cong Ling:
Polar lattices for strong secrecy over the mod-Λ Gaussian wiretap channel. 961-965 - Jérôme Ducoat, Frédérique E. Oggier:
An analysis of small dimensional fading wiretap lattice codes. 966-970 - Fuchun Lin, Cong Ling, Jean-Claude Belfiore:
Secrecy gain, flatness factor, and secrecy-goodness of even unimodular lattices. 971-975
Energy Harvesting 2
- Kaya Tutuncuoglu, Omur Ozel, Aylin Yener, Sennur Ulukus:
Improved capacity bounds for the binary energy harvesting channel. 976-980 - Sreejith Sreekumar, Sibi Raj B. Pillai, Bikash Kumar Dey:
Energy efficient random multiple access with strict delay constraints. 981-985 - Berk Gurakan, Sennur Ulukus:
Energy harvesting diamond channel with energy cooperation. 986-990 - Ali Mohammad Fouladgar, Osvaldo Simeone, Elza Erkip:
Constrained codes for joint energy and information transfer with receiver energy utilization requirements. 991-995
Cellular Networks
- Xinchen Zhang, Martin Haenggi:
Cellular network coverage with inter-cell interference coordination and intra-cell diversity. 996-1000 - Jangho Yoon, Won-Yong Shin, Sang-Woon Jeon:
Elastic routing in wireless networks with directional antennas. 1001-1005 - Nan Liu, Wei Kang:
A new achievability scheme for downlink multicell processing with finite backhaul capacity. 1006-1010 - Mohammad Hassan Lotfi, George Kesidis, Saswati Sarkar:
Market-based power allocation for a differentially priced FDMA system. 1011-1015
Interference Channels 2
- Mohammad Ali Khojastepour, Mohammad Farajzadeh-Tehrani:
Characterizing per node degrees of freedom in an interference network. 1016-1020 - Samir Medina Perlaza, Ravi Tandon, H. Vincent Poor:
Symmetric decentralized interference channels with noisy feedback. 1021-1025 - Abdellatif Zaidi:
Achievable regions for interference channels with generalized and intermittent feedback. 1026-1030 - Sida Liu, Chandra Nair, Lingxiao Xia:
Interference channels with very weak interference. 1031-1035
Distributed Storage - Repair and Generation 1
- Sreechakra Goparaju, Salim El Rouayheb, A. Robert Calderbank:
New codes and inner bounds for exact repair in distributed storage systems. 1036-1040 - Henk D. L. Hollmann:
On the minimum storage overhead of distributed storage codes with a given repair locality. 1041-1045 - Kenneth W. Shum, Hanxu Hou, Minghua Chen, Huanle Xu, Hui Li:
Regenerating codes over a binary cyclic code. 1046-1050
Interdisciplinary Coding Theory
- Arti D. Yardi, Animesh Kumar, Saravanan Vijayakumaran:
Channel-code detection by a third-party receiver via the likelihood ratio test. 1051-1055 - Lili Su, Olgica Milenkovic:
Synchronizing rankings via interactive communication. 1056-1060 - Yi-Kai Wang, Yitong Yin, Sheng Zhong:
Approximate capacities of two-dimensional codes by spatial mixing. 1061-1065 - Kenji Yasunaga:
Correction of samplable additive errors. 1066-1070
Quantum Error Control Codes 2
- Nicolas Delfosse, Jean-Pierre Tillich:
A decoding algorithm for CSS codes using the X/Z correlations. 1071-1075 - Pradeep Kiran Sarvepalli:
Quantum codes and symplectic matroids. 1076-1080 - Andrew James Ferris, David Poulin:
Branching MERA codes: A natural extension of classical and quantum polar codes. 1081-1085 - Ilya Dumer, Alexey A. Kovalev, Leonid P. Pryadko:
Numerical techniques for finding the distances of quantum codes. 1086-1090
Markov Models and Estimation
- Masahito Hayashi, Shun Watanabe:
Information geometry approach to parameter estimation in Markov chains. 1091-1095 - Vatsal Sharan, Rakesh Kumar Bansal:
Large deviation property of waiting times for Markov and mixing processes. 1096-1100 - Tho Ngoc Le, Vijay G. Subramanian, Randall A. Berry:
The value of noise for informational cascades. 1101-1105 - Lukas Bruderer, Hans-Andrea Loeliger, Nour Zalmai:
Local statistical models from deterministic state space models, likelihood filtering, and local typicality. 1106-1110
Interdisciplinary Information Theory
- Dror A. Vinkler, Haim H. Permuter, Neri Merhav:
Analogy between gambling and measurement-based work extraction. 1111-1115 - Christoph Bunte, Amos Lapidoth, Alex Samorodnitsky:
A proof of the Ahlswede-Cai-Zhang conjecture. 1116-1120 - Artyom Sharov, Ron M. Roth:
New upper bounds for grain-correcting and grain-detecting codes. 1121-1125 - Michael Walter, Joseph M. Renes:
A Heisenberg limit for quantum region estimation. 1126-1130 - Jun Zhao, Osman Yagan, Virgil D. Gligor:
On topological properties of wireless sensor networks under the q-composite key predistribution scheme with on/off channels. 1131-1135
Secret-Key Capacity
- Masahito Hayashi, Himanshu Tyagi, Shun Watanabe:
Secret key agreement: General capacity and second-order asymptotics. 1136-1140 - Huishuai Zhang, Lifeng Lai, Yingbin Liang, Hua Wang:
Secret key-private key generation over three terminals: Capacity region. 1141-1145 - Jingbo Liu, Paul W. Cuff, Sergio Verdú:
Key capacity with limited one-way communication for product sources. 1146-1150 - Manuj Mukherjee, Navin Kashyap:
On the communication complexity of secret key generation in the multiterminal source model. 1151-1155 - Manuj Mukherjee, Navin Kashyap, Yogesh Sankarasubramaniam:
Achieving SK capacity in the source model: When must all terminals talk? 1156-1160
Resource Allocation and Energy Harvesting
- He Chen, Yunxiang Jiang, Yonghui Li, Yuanye Ma, Branka Vucetic:
A game-theoretical model for wireless information and power transfer in relay interference channels. 1161-1165 - Zhe Wang, Vaneet Aggarwal, Xiaodong Wang:
Optimal energy-bandwidth allocation for energy harvesting interference networks. 1166-1170 - Omer Melih Gul, Elif Uysal-Biyikoglu:
Achieving nearly 100% throughput without feedback in energy harvesting wireless networks. 1171-1175 - Baran Tan Bacinoglu, Elif Uysal-Biyikoglu:
Finite horizon online lazy scheduling with energy harvesting transmitters over fading channels. 1176-1180 - Meysam Shahrbaf Motlagh, Masoud Badiei Khuzani, Patrick Mitran:
On lossy source-channel transmission in Energy Harvesting communication systems. 1181-1185
Cooperative Communications
- Abdellatif Zaidi, Shlomo Shamai:
Asymmetric cooperative multiple access channels with delayed CSI. 1186-1190 - Tasuku Soma:
Multicasting in linear deterministic relay network by matrix completion. 1191-1195 - Shirin Saeedi Bidokhti, Gerhard Kramer:
Capacity bounds for a class of diamond networks. 1196-1200 - Ritesh Kolte, Urs Niesen, Piyush Gupta:
Energy-efficient communication over the unsynchronized Gaussian diamond network. 1201-1205 - Shuhang Wu, Shuangqing Wei, Yue Wang, Ramachandran Vaidyanathan, Jian Yuan:
Achievable partition information rate over noisy multi-access Boolean channel. 1206-1210
Interference Alignment
- Cheuk Ting Li, Ayfer Özgür:
Channel diversity needed for vector interference alignment. 1211-1215 - Abhinav Ganesan, B. Sundar Rajan:
Interference alignment with diversity for the 2 × 2 X-Network with three antennas. 1216-1220 - Abinesh Ramakrishnan, Sundar Rajan Krishnamurthy, Syed Ali Jafar, Yaming Yu:
Degrees of freedom of interference channel with rank-deficient transfer matrix. 1221-1225 - Gokul Sridharan, Wei Yu:
Unstructured linear beamforming design for interference alignment in MIMO cellular networks. 1226-1230 - Emmanuel Abbe, Noga Alon, Afonso S. Bandeira:
Linear Boolean classification, coding and "the critical problem". 1231-1235 - Antonia Wachter-Zeh:
List decoding of crisscross error patterns. 1236-1240 - Hirosuke Yamamoto, Masashi Ueda:
Identification codes to identify multiple objects. 1241-1245 - Ling Cheng, Theo G. Swart, Hendrik C. Ferreira, Khaled A. S. Abdel-Ghaffar:
Codes for correcting three or more adjacent deletions or insertions. 1246-1250 - Emmanuel Abbe, Afonso S. Bandeira, Annina Bracher, Amit Singer:
Linear inverse problems on Erdős-Rényi graphs: Information-theoretic limits and efficient recovery. 1251-1255 - Arman Fazeli, Alexander Vardy, Eitan Yaakobi:
Generalized sphere packing bound: Basic principles. 1256-1260 - Arman Fazeli, Alexander Vardy, Eitan Yaakobi:
Generalized sphere packing bound: Applications. 1261-1265
Generalized Sphere Packing Bound: Applications
- Daniel F. Cullina, Negar Kiyavash:
Generalized sphere-packing upper bounds on the size of codes for combinatorial channels. 1266-1270 - Jun Yang, Fady Alajaji, Glen Takahara:
New bounds on the probability of a finite union of events. 1271-1275 - Marco Dalai:
An Elias bound on the Bhattacharyya distance of codes for channels with a zero-error capacity. 1276-1280
Problems in Bioinformatics and Neuroscience
- Andrew W. Eckford, Chan-Byoung Chae:
Scaling laws for molecular communication. 1281-1285 - Eren Sasoglu, David Tse:
DNA assembly from paired reads as 2-D jigsaw puzzles. 1286-1290 - Nima Soltani, Andrea J. Goldsmith:
Directed information between connected leaky integrate-and-fire neurons. 1291-1295 - Jayadev Acharya, Hirakendu Das, Olgica Milenkovic, Alon Orlitsky, Shengjun Pan:
Quadratic-backtracking algorithm for string reconstruction from substring compositions. 1296-1300 - Farzad Farnoud, Moshe Schwartz, Jehoshua Bruck:
The capacity of string-duplication systems. 1301-1305
Sampling and Sensing
- Peng Zhang, Sumei Sun, Cong Ling:
Variable-density sampling on the dual lattice. 1306-1310 - Cem Aksoylar, Venkatesh Saligrama:
Information-theoretic bounds for adaptive sparse recovery. 1311-1315 - Kei Sano, Ryosuke Matsushita, Toshiyuki Tanaka:
To average or not to average: Trade-off in compressed sensing with noisy measurements. 1316-1320 - Christos Boutsidis, Malik Magdon-Ismail:
Faster SVD-truncated regularized least-squares. 1321-1325 - Amichai Painsky, Saharon Rosset, Meir Feder:
Generalized binary independent component analysis. 1326-1330
Distributed Lossless Source Coding
- Oron Sabag, Haim H. Permuter, Asaf Cohen:
Lossless coding of correlated sources with actions in acyclic directed networks. 1331-1335 - Tomohiko Uyematsu, Tetsunao Matsuta:
Revisiting the Slepian-Wolf coding problem for general sources: A direct approach. 1336-1340 - Ziv Goldfeld, Haim H. Permuter, Gerhard Kramer:
The Ahlswede-Körner coordination problem with one-sided encoder cooperation. 1341-1345 - Eric Graves, Tan F. Wong:
Equating the achievable exponent region to the achievable entropy region by partitioning the source. 1346-1350
Reed-Solomon Codes for Secrecy
- Hiroki Koga, Shuntaro Honjo:
A secret sharing scheme based on a systematic Reed-Solomon code and analysis of its security for a general class of sources. 1351-1355 - Ping Hu, Chi Wan Sung, Siu-Wai Ho, Terence H. Chan:
Three-level storage and nested MDS codes for perfect secrecy in multiple clouds. 1356-1360 - Baofeng Wu, Qingfang Jin, Zhuojun Liu, Dongdai Lin:
Constructing Boolean functions with potentially optimal algebraic immunity based on additive decompositions of finite fields (extended abstract). 1361-1365 - Muxi Yan, Alex Sprintson, Igor Zelenko:
Weakly secure data exchange with Generalized Reed Solomon codes. 1366-1370
Scheduling and Power Control
- Matthew Johnston, Eytan H. Modiano, Yury Polyanskiy:
Opportunistic scheduling with limited channel state information: A rate distortion approach. 1371-1375 - Apostolos Destounis, Mohamad Assaad, Mérouane Debbah, Bessem Sayadi:
Traffic-aware training and scheduling for the 2-user MISO broadcast channel. 1376-1380 - Gozde Ozcan, Mustafa Cenk Gursoy:
QoS-driven power control for fading channels with arbitrary input distributions. 1381-1385 - Arash Saber Tehrani, Giuseppe Caire:
ZigZag neighbor discovery in wireless networks. 1386-1390
Cognitive Radios
- Abdulrahman Alabbasi, Zouheir Rezki, Basem Shihada:
Energy efficiency and SINR maximization beamformers for cognitive radio utilizing sensing information. 1391-1395 - Seyed Ali Hesammohseni, Kamyar Moshksar, Amir K. Khandani:
A combined underlay and interweave strategy for cognitive radios. 1396-1400 - Mahmoud Ashour, M. Majid Butt, Amr Mohamed:
On the power efficiency for cognitive radio networks with multiple relays. 1401-1405 - Anthony Fanous, Anthony Ephremides:
Enhanced access schemes based on channel statistics for cognitive wireless networks. 1406-1410
Interference Channel with Cooperation
- Quan Geng, Tie Liu:
Symmetric two-user Gaussian interference channel with common message with very low interference. 1411-1415 - Reza Khosravi-Farsani, Reza Ebrahimpour:
Capacity theorems for the Cognitive Radio Channel with confidential messages. 1416-1420 - Germán Bassi, Pablo Piantanida, Sheng Yang:
Constant-gap results and cooperative strategies for a class of Interference Relay Channels. 1421-1425 - Martina Cardone, Daniela Tuninetti, Raymond Knopp, Umer Salim:
New outer bounds for the interference channel with unilateral source cooperation. 1426-1430
Algebraic Coding Theory 1
- Scott Kayser, Paul H. Siegel:
Constructions for constant-weight ICI-free codes. 1431-1435 - Yeow Meng Chee, Fei Gao, Han Mao Kiah, Alan Chi Hung Ling, Hui Zhang, Xiande Zhang:
Decompositions of edge-colored digraphs: A new technique in the construction of constant-weight codes and related families. 1436-1440 - Yeow Meng Chee, Han Mao Kiah, Punarbasu Purkayastha, Patrick Solé:
Product construction of affine codes. 1441-1445 - Alain Couvreur, Irene Marquez Corbella, Ruud Pellikaan:
A polynomial time attack against algebraic geometry code based public key cryptosystems. 1446-1450 - Seyed Hamed Hassani, Rüdiger L. Urbanke:
Universal polar codes. 1451-1455 - Eren Sasoglu, Lele Wang:
Universal polarization. 1456-1460 - David Sutter, Joseph M. Renes:
Universal polar codes for more capable and less noisy channels and sources. 1461-1465 - Erdal Arikan:
A note on polarization martingales. 1466-1468
Quantum Communication and Security
- Marco Tomamichel, Jesús Martínez-Mateo, Christoph Pacher, David Elkouss:
Fundamental finite key limits for information reconciliation in quantum key distribution. 1469-1473 - Mario Berta, Omar Fawzi, Volkher B. Scholz, Oleg Szehr:
Variations on classical and quantum extractors. 1474-1478 - Helen Ebbe, Stefan Wolf:
Trading permutation invariance for communication in multi-party non-locality distillation. 1479-1483 - Alberto Montina, Stefan Wolf:
Lower bounds on the communication complexity of two-party (quantum) processes. 1484-1488
Estimation and Statistical Physics
- Zheng Wang, Cong Ling, Guillaume Hanrot:
Markov chain Monte Carlo algorithms for lattice Gaussian sampling. 1489-1493 - Jean Barbier, Florent Krzakala:
Replica analysis and approximate message passing decoder for superposition codes. 1494-1498 - Florent Krzakala, Andre Manoel, Eric W. Tramel, Lenka Zdeborová:
Variational free energies for compressed sensing. 1499-1503 - Ali Al-Bashabsheh, Yongyi Mao:
On stochastic estimation of the partition function. 1504-1508
Joint Source-Channel Coding
- Erman Koken, Ertem Tuncel:
On robustness of hybrid digital analog source-channel coding with bandwidth mismatch. 1509-1513 - Irina E. Bocharova, Albert Guillen i Fabregas, Boris D. Kudryashov, Alfonso Martinez, Adrià Tauste Campo, Gonzalo Vazquez-Vilar:
Source-channel coding with multiple classes. 1514-1518 - Uri Mendlovic, Meir Feder:
Source broadcasting to the masses: Separation has a bounded loss. 1519-1523 - Se Yong Park, Tara Javidi, Andrea J. Goldsmith:
Optimal strategies for dynamic joint source-channel coding with feedback. 1524-1528
Cryptography and Secrecy
- Özgür Dagdelen, Marc Fischlin:
Intercepting tokens in cryptographic protocols: The empire strikes back in the clone wars. 1529-1533 - Qichun Wang, Chik How Tan:
Cryptographic boolean functions with a large number of variables. 1534-1538 - Manoj Mishra, Bikash Kumar Dey, Vinod M. Prabhakaran, Suhas N. Diggavi:
The oblivious transfer capacity of the wiretapped binary erasure channel. 1539-1543 - Yuval Ishai, Hemanta K. Maji, Amit Sahai, Jürg Wullschleger:
Single-use ot combiners with near-optimal resilience. 1544-1548
Modulation and Demodulation
- Amir K. Khandani:
Media-based modulation: Converting static Rayleigh fading to AWGN. 1549-1553 - Hassan Ghozlan, Gerhard Kramer:
Phase modulation for discrete-time wiener phase noise channels with oversampling at high SNR. 1554-1557 - Cenk Sahin, Lingjia Liu, Erik S. Perrins:
Early decoding for transmission over finite transport blocks. 1558-1562 - Ryota Yoshizawa, Hideki Ochiai:
A novel trellis-based PAPR reduction technique for OFDM signals. 1563-1567
Wireless Network Protocols
- Yijin Zhang, Yuan-Hsun Lo, Feng Shu, Wing Shing Wong:
Protocol sequences for multiple-packet reception: Throughput invariance and user irrepressibility. 1568-1572 - Navid Naderializadeh, Amir Salman Avestimehr:
ITLinQ: A new approach for spectrum sharing in device-to-device communication systems. 1573-1577 - Dusan Jakovetic, Dragana Bajovic, Dejan Vukobratovic, Vladimir S. Crnojevic:
Slotted Aloha for networked base stations with spatial and temporal diversity. 1578-1582 - Maice Costa, Marian Codreanu, Anthony Ephremides:
Age of information with packet management. 1583-1587
Interference Management for Cellular
- Hyun Jong Yang, Won-Yong Shin, Bang Chul Jung, Changho Suh, Arogyaswami Paulraj:
Opportunistic downlink interference alignment. 1588-1592 - Sang-Woon Jeon, Changho Suh:
Degrees of freedom of uplink-downlink multiantenna cellular networks. 1593-1597 - Vasileios Ntranos, Mohammad Ali Maddah-Ali, Giuseppe Caire:
Cellular interference alignment. 1598-1602 - Narayan Prasad, Mustafa Y. Arslan, Sampath Rangarajan:
Enhanced interference management in heterogeneous cellular networks. 1603-1607
Calculus
- Pascal O. Vontobel:
Counting balanced sequencesw/o forbidden patterns via the betheapproximation and loop calculus. 1608-1612 - Thomas Mittelholzer, Roy D. Cideciyan:
Enumerative modulation codes based on sliding-window substitutions. 1613-1617 - Mehrdad Khatami, Vida Ravanmehr, Bane Vasic:
GBP-based detection and symmetric information rate for rectangular-grain TDMR model. 1618-1622 - Rafael Dowsley, Felipe Lacerda, Anderson C. A. Nascimento:
Oblivious transfer in the bounded storage model with errors. 1623-1627
Applications of Polar Coding Techniques
- Qi Shi, Lin Song, Chao Tian, Jun Chen, Sorina Dumitrescu:
Polar codes for multiple descriptions. 1628-1632 - Qing Li, Anxiao Andrew Jiang:
Coding for noisy write-efficient memories. 1633-1637 - Eyal En Gad, Yue Li, Jörg Kliewer, Michael Langberg, Anxiao Jiang, Jehoshua Bruck:
Polar coding for noisy write-once memories. 1638-1642 - Naveen Goela:
Polarized random variables: Maximal correlations and common information. 1643-1647
Sequences
- Tae-Kyo Lee, Kyeongcheol Yang:
The induced correlations of Zadoff-Chu sequences. 1648-1652 - Chang-Min Cho, Ji-Youp Kim, Jong-Seon No:
Cross-correlation distribution between two decimated sequences by 2 and (pm+1)2 over 2. 1653-1657 - Jos H. Weber, Carl H. Heymann, Hendrik C. Ferreira, Khaled A. S. Abdel-Ghaffar:
Optimized markers for balancing runlength-limited sequences in optical recording. 1658-1662 - Min Zeng, Yuan Luo, Guang Gong:
New binary sequences with good correlation based on high-order difference and interleaving techniques. 1663-1666
Density and Model Estimation
- Andrew R. Barron, Teemu Roos, Kazuho Watanabe:
Bayesian properties of normalized maximum likelihood and its fast computation. 1667-1671 - Jossy Sayir:
The role model estimator revisited. 1672-1676 - Tina Felber, Michael Kohler, Adam Krzyzak:
Density estimation using real and artificial data. 1677-1681 - Jayadev Acharya, Ashkan Jafarpour, Alon Orlitsky, Ananda Theertha Suresh:
Sorting with adversarial comparators and application to density estimation. 1682-1686
Source-Channel Coding with Finite Blocklength
- Vincent Yan Fu Tan, Shun Watanabe, Masahito Hayashi:
Moderate deviations for joint source-channel coding of systems with Markovian memory. 1687-1691 - Yanina Shkel, Vincent Y. F. Tan, Stark C. Draper:
On mismatched unequal message protection for finite block length joint source-channel coding. 1692-1696 - Nir Elkayam, Meir Feder:
Information spectrum approach to the source channel separation theorem. 1697-1701 - Farhad Shirani Chaharsooghi, S. Sandeep Pradhan:
Finite block-length gains in distributed source coding. 1702-1706
Biometrics & Cryptography
- Grégory Demay, Peter Gazi, Ueli Maurer, Björn Tackmann:
Optimality of non-adaptive strategies: The case of parallel games. 1707-1711 - Paul Stankovski, Lennart Brynielsson, Martin Hell:
The efficiency of optimal sampling in the random S-box model. 1712-1716 - Jean-Charles Faugère, Ayoub Otmani, Ludovic Perret, Frédéric de Portzamparc, Jean-Pierre Tillich:
Structural weakness of compact variants of the McEliece cryptosystem. 1717-1721 - Wei Kang, Daming Cao, Nan Liu:
Authentication with side information. 1722-1726 - Diana Maamari, Natasha Devroye, Daniela Tuninetti:
The capacity of the ergodic miso channel with per-antenna power constraint and an application to the fading cognitive interference channel. 1727-1731 - Oded Fischler, Uri Erez:
Performance of precoded integer-forcing for parallel Gaussian channels. 1732-1736 - Selma Belhadj Amor, Yossef Steinberg, Michèle A. Wigger:
MAC-BC duality with linear-feedback schemes. 1737-1741 - Yohan Lejosne, Dirk T. M. Slock, Yi Yuan-Wu:
Net degrees of freedom of decomposition schemes for the MIMO IC with delayed CSIT. 1742-1746
Topics in Wireless Communications
- Nicolò Michelusi, Urbashi Mitra:
A cross-layer framework for joint control and distributed sensing in agile wireless networks. 1747-1751 - Anjin Guo, Yi Zhong, Martin Haenggi, Wenyi Zhang:
Success probabilities in Gauss-Poisson networks with and without cooperation. 1752-1756 - John Tadrous, Hesham El Gamal, Atilla Eryilmaz:
Can carriers make more profit while users save money? 1757-1761 - Yanru Tang, Tiegang Zhao, Jie Luo:
Medium access control game with an enhanced physical-link layer interface. 1762-1766
Interference Channels 3
- Hua Sun, Syed Ali Jafar:
Topological interference management with multiple antennas. 1767-1771 - Soheil Gherekhloo, Anas Chaaban, Aydin Sezgin:
Resolving entanglements in topological interference management with alternating connectivity. 1772-1776 - Chunhua Geng, Hua Sun, Syed Ali Jafar:
On the optimality of treating interference as noise: General message sets. 1777-1781 - Morgan Barbier:
Re-encoding reformulation and application to Welch-Berlekamp algorithm. 1782-1786 - Son Hoang Dau, Wentu Song, Chau Yuen:
On the existence of MDS codes over small fields with constrained generator matrices. 1787-1791 - Mario Blaum, James S. Plank, Moshe Schwartz, Eitan Yaakobi:
Partial MDS (PMDS) and Sector-Disk (SD) codes that tolerate the erasure of two random sectors. 1792-1796 - Yi Lyu, Li Chen:
A new progressive algebraic soft decoding algorithm for reed-solomon codes. 1797-1801
Topics in Coding and Communications
- Daniel Pedro Bezerra Chaves, Cecilio Pimentel:
On the follower set graph of shifts of finite type. 1802-1806 - Eduardo Sany Laber, Wilfredo Bardales Roncalla, Ferdinando Cicalese:
On lower bounds for the Maximum Consecutive Subsums Problem and the (min, +)-convolution. 1807-1811 - Francesco Caltagirone, Lenka Zdeborová, Florent Krzakala:
On convergence of approximate message passing. 1812-1816 - Christopher Rose, I. Saira Mian:
Signaling with identical tokens: Upper bounds with energy constraints. 1817-1821
Sequences & Functions over Finite Fields
- Honggang Hu, Shuai Shao, Guang Gong, Tor Helleseth:
On the proof of Lin's conjecture. 1822-1826 - Lilya Budaghyan, Alexander Kholosha, Claude Carlet, Tor Helleseth:
Niho bent functions from quadratic o-monomials. 1827-1831 - Baofeng Wu:
New classes of quadratic bent functions in polynomial forms. 1832-1836 - Meicheng Liu, Dongdai Lin:
Almost perfect algebraic immune functions with good nonlinearity. 1837-1841
Approximation Algorithms and Signal Processing
- Chinmay Hegde, Piotr Indyk, Ludwig Schmidt:
A fast approximation algorithm for tree-sparse recovery. 1842-1846 - Jaeseok Lee, Suhyuk Kwon, Byonghyo Shim:
A greedy search algorithm with tree pruning for sparse signal recovery. 1847-1851 - Sameer Pawar, Kannan Ramchandran:
A robust R-FFAST framework for computing a k-sparse n-length DFT in O(k log n) sample complexity using sparse-graph codes. 1852-1856 - Xiao Li, Joseph Kurata Bradley, Sameer Pawar, Kannan Ramchandran:
The SPRIGHT algorithm for robust sparse Hadamard Transforms. 1857-1861
Lossless Universal Source Coding
- Nikhil Krishnan, Dror Baron, Mehmet Kivanç Mihçak:
A parallel two-pass MDL context tree algorithm for universal source coding. 1862-1866 - Jayadev Acharya, Ashkan Jafarpour, Alon Orlitsky, Ananda Theertha Suresh:
Efficient compression of monotone and m-modal distributions. 1867-1871 - Jayadev Acharya, Ashkan Jafarpour, Alon Orlitsky, Ananda Theertha Suresh:
Poissonization and universal compression of envelope classes. 1872-1876 - Narayana Prasad Santhanam, Venkat Anantharam, Aleksandar Kavcic, Wojciech Szpankowski:
Data-driven weak universal redundancy. 1877-1881
Finite Blocklength Capacity
- Shun Watanabe, Masahito Hayashi:
Strong converse and second-order asymptotics of channel resolvability. 1882-1886 - Vincent Y. F. Tan, Pierre Moulin:
Second-order capacities of erasure and list decoding. 1887-1891 - Jonathan Scarlett, Alfonso Martinez, Albert Guillen i Fabregas:
The saddlepoint approximation: Unified random coding asymptotics for fixed and varying rates. 1892-1896 - Yucel Altug, Aaron B. Wagner:
The third-order term in the normal approximation for singular channels. 1897-1901 - Ti-wen Tang, Hsiao-Ting Tien, Hsiao-feng Francis Lu:
Coding schemes with constant sphere-decoding complexity and high DMT performance for MIMO multiple access channels with low-rate feedback. 1902-1906
MIMO Multiple Access Channels With Low-Rate Feedback
- Mohammad Tarek Hussien, Karim G. Seddik, Ramy H. Gohary, Mohammad Shaqfeh, Hussein M. Alnuweiri, Halim Yanikomeroglu:
Multi-resolution broadcasting over the Grassmann and stiefel manifolds. 1907-1911 - Jhanak Parajuli, Giuseppe Abreu:
A space-time Tx scheme for two-cell MISO-BC with delayed CSIT. 1912-1916 - Grégory Berhuy, Nadya Markin, B. A. Sethuraman:
Fast lattice decodability of space-time block codes. 1917-1921
Relaying Schemes
- Siddhartha Brahma, Christina Fragouli:
A simple relaying strategy for diamond networks. 1922-1926 - Siddhartha Brahma, Ayan Sengupta, Christina Fragouli:
Efficient subnetwork selection in relay networks. 1927-1931 - David T. H. Kao, Mohammad Ali Maddah-Ali, Amir Salman Avestimehr:
Align-and-forward relaying for two-hop erasure broadcast channels. 1932-1936 - Chang-Ick Song, Cong Ling:
Achievable diversity-rate tradeoff of MIMO AF relaying systems with MMSE transceivers. 1937-1941
Discrete Memoryless Broadcast Channels 1
- Annina Bracher, Amos Lapidoth:
Identification via the broadcast channel. 1942-1946 - Yossef Steinberg:
Channels with cooperation links that may be absent. 1947-1951 - Hyeji Kim, Abbas El Gamal:
Capacity region of the broadcast channel with two deterministic channel state components. 1952-1956 - Hon Fah Chong, Ying-Chang Liang:
The capacity region of a new class of K-receiver degraded compound broadcast channels. 1957-1961
Topics in Distributed Storage
- N. Prakash, V. Lalitha, P. Vijay Kumar:
Codes with locality for two erasures. 1962-1966 - Son Hoang Dau, Wentu Song, Chau Yuen:
On block security of regenerating codes at the MBR point for distributed storage systems. 1967-1971 - Anyu Wang, Zhifang Zhang:
Repair locality from a combinatorial perspective. 1972-1976 - Arya Mazumdar:
On a duality between recoverable distributed storage and index coding. 1977-1981
Applications of Codes on Graphs in Communications
- Tarik Benaddi, Charly Poulliat, Marie-Laure Boucheret, Benjamin Gadat, Guy Lesthievent:
Design of unstructured and protograph-based LDPC coded continuous phase modulation. 1982-1986 - John B. Anderson, Mehdi Zeinali:
Analysis of best high rate convolutional codes for faster than Nyquist turbo equalization. 1987-1991 - Shahrouz Sharifi, Ahmet Korhan Tanc, Tolga M. Duman:
On LDPC codes for Gaussian interference channels. 1992-1996 - Javier Cespedes, Pablo M. Olmos, Matilde Sánchez Fernández, Fernando Pérez-Cruz:
Improved performance of LDPC-coded MIMO systems with EP-based soft-decisions. 1997-2001
Nonlinear Compressed Sensing
- Akshay Soni, Jarvis D. Haupt:
Estimation error guarantees for Poisson denoising with sparse and structured dictionary models. 2002-2006 - Sheng Cai, Mayank Bakshi, Sidharth Jaggi, Minghua Chen:
SUPER: Sparse signals with unknown phases efficiently recovered. 2007-2011 - Yuxin Chen, Andrea J. Goldsmith:
Information recovery from pairwise measurements. 2012-2016 - Yuxin Chen, Yuejie Chi, Andrea J. Goldsmith:
Robust and universal covariance estimation from quadratic measurements via convex programming. 2017-2021
Graphical Models and Inference
- Jacob Søgaard, Søren Forchhammer:
Maximizing entropy of pickard random fields for 2×2 binary constraints. 2022-2026 - Hajir Roozbehani, Yury Polyanskiy:
Algebraic methods of classifying directed graphical models. 2027-2031 - Hang Yu, Liaofan Zhang, Justin Dauwels:
Spatio-temporal graphical models for extreme events. 2032-2036 - Gautam Dasarathy, Robert D. Nowak, Sébastien Roch:
New sample complexity bounds for phylogenetic inference from multiple loci. 2037-2041
Source Coding
- Eva C. Song, Paul Cuff, H. Vincent Poor:
The likelihood encoder for lossy source compression. 2042-2046 - Wataru Kumagai, Masahito Hayashi:
Random number conversion via restricted storage. 2047-2051 - Emrah Akyol, Urbashi Mitra, Ertem Tuncel, Kenneth Rose:
On scalable coding in the presence of decoder side information. 2052-2056 - Emrah Akyol, Urbashi Mitra, Ertem Tuncel, Kenneth Rose:
Source coding in the presence of exploration-exploitation tradeoff. 2057-2061
Finite Blocklength & Fading Channels
- Kasper F. Trillingsgaard, Petar Popovski:
Block-fading channels with delayed CSIT at finite blocklength. 2062-2066 - Wei Yang, Giuseppe Caire, Giuseppe Durisi, Yury Polyanskiy:
Finite-blocklength channel coding rate under a long-term power constraint. 2067-2071 - Wei Yang, Giuseppe Durisi, Tobias Koch, Yury Polyanskiy:
Dispersion of quasi-static MIMO fading channels via Stokes' theorem. 2072-2076 - Vincent Yan Fu Tan, Marco Tomamichel:
The third-order term in the normal approximation for the AWGN channel. 2077-2081
Coding For Flash Memories
- Yeow Meng Chee, Han Mao Kiah, Punarbasu Purkayastha:
Rewritable coset coding for flash memories. 2082-2086 - Yue Li, Anxiao Andrew Jiang, Jehoshua Bruck:
Error correction and partial information rewriting for flash memories. 2087-2091 - Evyatar Hemo, Yuval Cassuto:
Codes for high performance write and read processes in multi-level NVMs. 2092-2096 - Rami Cohen, Yuval Cassuto:
LDPC codes for partial-erasure channels in multi-level memories. 2097-2101
Relay Channels
- Xianglan Jin, Young-Han Kim:
Approximate capacity of the MIMO relay channel. 2102-2106 - Chenwei Wang:
Beyond one-way communication: Degrees of freedom of the 4-user relay MIMO Y channel. 2107-2111 - Yu-Chih Huang, Krishna R. Narayanan:
Multistage compute-and-forward with multilevel lattice codes based on product constructions. 2112-2116 - Amin Sakzad, Emanuele Viterbo, Joseph Jean Boutros, Yi Hong:
Phase precoded compute-and-forward with partial feedback. 2117-2121
Discrete Memoryless Broadcast Channels 2
- Amir Salimi, Tie Liu, Shuguang Cui:
Polyhedral description of the symmetrical latency capacity region of broadcast channels. 2122-2126 - Youlong Wu, Michèle A. Wigger:
Coding schemes for discrete memoryless broadcast channels with rate-limited feedback. 2127-2131 - Kia Khezeli, Jun Chen:
A source-channel separation theorem with application to the source broadcast problem. 2132-2136 - SaiDhiraj Amuru, Ravi Tandon, Shlomo Shamai:
On the degrees-of-freedom of the 3-user MISO broadcast channel with hybrid CSIT. 2137-2141
Topics in Network Coding 1
- Nikhil Karamchandani, Urs Niesen, Mohammad Ali Maddah-Ali, Suhas N. Diggavi:
Hierarchical coded caching. 2142-2146 - Sudeep U. Kamath, David N. C. Tse, Chih-Chun Wang:
Two-unicast is hard. 2147-2151 - Ming Fai Wong, Michael Langberg, Michelle Effros:
Linear capacity equivalence between multiple multicast and multiple unicast. 2152-2156 - Qifu Sun, Xunrui Yin, Zongpeng Li, Keping Long:
Multicast network coding and field sizes. 2157-2161
Rateless Code Design
- Iqbal Hussain, Ingmar Land, Terence H. Chan, Ming Xiao, Lars K. Rasmussen:
A new design framework for LT codes over noisy channels. 2162-2166 - Mahyar Shirvanimoghaddam, Yonghui Li, Branka Vucetic:
Multiple access analog fountain codes. 2167-2171 - Yao Li, Louis Tan, Ashish Khisti, Emina Soljanin:
Successive segmentation-based coding for broadcasting over erasure channels. 2172-2176 - Min Zhu, Yucheng Qu, Kai Zhang, Baoming Bai, Xiao Ma:
An improved ensemble of variable-rate LDPC codes with precoding. 2177-2181
Dimensionality Reduction
- Anastasios Kyrillidis, Michail Vlachos, Anastasios Zouzias:
Approximate matrix multiplication with application to linear embeddings. 2182-2186 - Jinchun Zhan, Namrata Vaswani, Chenlu Qiu:
Performance guarantees for ReProCS - Correlated low-rank matrix entries case. 2187-2191 - Jinchun Zhan, Namrata Vaswani:
Robust PCA with partial subspace knowledge. 2192-2196 - Yash Deshpande, Andrea Montanari:
Information-theoretically optimal sparse PCA. 2197-2201
Information-Estimation Relationships
- Guangyue Han, Jian Song:
Extensions of the I-MMSE relation. 2202-2206 - Camilo G. Taborda, Fernando Pérez-Cruz, Dongning Guo:
New information-estimation results for poisson, binomial and negative binomial models. 2207-2211 - Jiantao Jiao, Kartik Venkat, Tsachy Weissman:
Relations between information and estimation in scalar Lévy channels. 2212-2216 - Ivan Nourdin, Giovanni Peccati, Yvik Swan:
Integration by parts and representation of information functionals. 2217-2221
Distributed Information Processing
- Mohsen Sardari, Ahmad Beirami, Faramarz Fekri:
Mismatched side information in wireless network compression via overhearing helpers. 2222-2226 - Aolin Xu, Maxim Raginsky:
A new information-theoretic lower bound for distributed function computation. 2227-2231 - Johannes Rauh, Nils Bertschinger, Eckehard Olbrich, Jürgen Jost:
Reconsidering unique information: Towards a multivariate information decomposition. 2232-2236
Jamming, Collusion, Privacy
- Jalal Etesami, Negar Kiyavash:
A novel collusion attack on finite alphabet digital fingerprinting systems. 2237-2241 - Amitalok J. Budkuley, Bikash Kumar Dey, Vinod M. Prabhakaran:
Writing on a dirty paper in the presence of jamming. 2242-2246 - Amitalok J. Budkuley, Bikash Kumar Dey, Vinod M. Prabhakaran:
Correlated jamming in a Joint Source Channel Communication system. 2247-2251 - Tetsuya Kobayashi, Hiroyoshi Morita, Akiko Manada:
On the capacity of Write-Constrained Memories. 2252-2256
Coding for Memories On the Capacity of Write-Constrained Memories
- Erik Ordentlich, Ron M. Roth:
When data must satisfy constraints upon writing. 2257-2261 - Qing Li, Anxiao Jiang, Erich F. Haratsch:
Noise modeling and capacity analysis for NAND flash memories. 2262-2266
Topics in Learning
- Lili Su, Farzad Farnoud, Olgica Milenkovic:
Similarity distances between permutations. 2267-2271 - Abhik Kumar Das, Praneeth Netrapalli, Sujay Sanghavi, Sriram Vishwanath:
Learning structure of power-law Markov networks. 2272-2276 - Alexey Gronskiy, Joachim M. Buhmann:
How informative are Minimum Spanning Tree algorithms? 2277-2281
Dirty Paper Coding
- Jonathan Scarlett:
On the dispersion of dirty paper coding. 2282-2286 - Stefano Rini, Shlomo Shamai:
The impact of phase fading on the dirty paper coding channel. 2287-2291 - Ram Zamir:
The modulo loss in lattice dirty-paper coding. 2292-2295
Topics in Network Coding 2
- Baojian Zhou, Wai Ho Mow:
A quadratic programming relaxation approach to compute-and-forward network coding design. 2296-2300 - Vitaly Skachek, Michael G. Rabbat:
Subspace synchronization: A network-coding approach to object reconciliation. 2301-2305 - Jayant Apte, Congduan Li, John MacLaren Walsh:
Algorithms for computing network coding rate regions via single element extensions of matroids. 2306-2310
Spatially Coupled Systems
- Najeeb ul Hassan, Michael Lentmaier, Iryna Andriyanova, Gerhard P. Fettweis:
Improving code diversity on block-fading channels by spatial coupling. 2311-2315 - Keigo Takeuchi:
A generalization of threshold saturation: application to spatially coupled BICM-ID. 2316-2320 - Rafah El-Khatib, Nicolas Macris, Tom Richardson, Rüdiger L. Urbanke:
Analysis of coupled scalar systems by displacement convexity. 2321-2325
Lattice Codes
- Roope Vehkalahti, Wittawat Kositwattanarerk, Frédérique E. Oggier:
Constructions a of lattices from number fields and division algebras. 2326-2330 - Roope Vehkalahti, Laura Luzzi, Jean-Claude Belfiore:
Shifted inverse determinant sums and new bounds for the DMT of space-time lattice codes. 2331-2335 - Avinash Vem, Yu-Chih Huang, Krishna R. Narayanan, Henry D. Pfister:
Multilevel lattices based on spatially-coupled LDPC codes with applications. 2336-2340
Group Testing
- Arkadii G. D'yachkov, Ilya Vorobyev, N. A. Polyanskii, Vladislav Yu. Shchukin:
Bounds on the rate of superimposed codes. 2341-2345 - Tongxin Li, Chun Lam Chan, Wenhao Huang, Tarik Kaced, Sidharth Jaggi:
Group testing with prior statistics. 2346-2350 - Amin Emad, Olgica Milenkovic:
Group testing for non-uniformly quantized adder channels. 2351-2355
Sequential Transmission & Feedback
- Mehnaz Mannan, Aditya Mahajan:
Simultaneous real-time transmission of multiple Markov sources over a shared channel. 2356-2360 - Yucel Altug, Aaron B. Wagner:
Feedback can improve the second-order coding performance in discrete memoryless channels. 2361-2365 - Rui Ma, Todd P. Coleman:
Necessary and sufficient conditions for reliability of posterior matching in arbitrary dimensions. 2366-2370
Topics in Secrecy 2
- Quan Geng, Pramod Viswanath:
The optimal mechanism in differential privacy. 2371-2375 - Holger Boche, Rafael F. Schaefer, H. Vincent Poor:
On arbitrarily varying wiretap channels for different classes of secrecy measures. 2376-2380 - Faruk Yavuz, Jun Zhao, Osman Yagan, Virgil D. Gligor:
On secure and reliable communications in wireless sensor networks: Towards k-connectivity under a random pairwise key predistribution scheme. 2381-2385
Rank Modulation Codes
- Sarit Buzaglo, Eitan Yaakobi, Tuvi Etzion, Jehoshua Bruck:
Systematic codes for rank modulation. 2386-2390 - Sarit Buzaglo, Tuvi Etzion:
Perfect permutation codes with the Kendall's τ-metric. 2391-2395 - Sarit Buzaglo, Eitan Yaakobi:
Constrained codes for rank modulation. 2396-2400
Topics in Networks
- Oliver Kosut, Jörg Kliewer:
Equivalence for networks with adversarial state. 2401-2405 - Yu Zhao, Biao Chen:
Capacity theorems for multi-functioning radios. 2406-2410 - Clement Kam, Sastry Kompella, Anthony Ephremides:
Effect of message transmission diversity on status age. 2411-2415
Continuous-Time Information Theory
- Edwin Hammerich:
Waterfilling theorems in the time-frequency plane for the heat channel and a related source. 2416-2420 - Xianming Liu, Guangyue Han:
Recent results in continuous-time network information theory. 2421-2425 - Luca Barletta, Gerhard Kramer:
On continuous-time white phase noise channels. 2426-2429
Distributed Storage - Repair and Generation 2
- Birenjith Padmakumari Sasidharan, Kaushik Senthoor, P. Vijay Kumar:
An improved outer bound on the storage-repair-bandwidth tradeoff of exact-repair regenerating codes. 2430-2434 - Gokhan Calis, Onur Ozan Koyluoglu:
Repairable Block Failure Resilient codes. 2435-2439 - Shiqiu Liu, Frédérique E. Oggier:
On storage codes allowing partially collaborative repairs. 2440-2444
Non-Binary LDPC Codes
- Koji Tazoe, Kenta Kasai, Kohichi Sakaniwa:
Non-binary LDPC codes with large alphabet size. 2445-2448 - Xishuo Liu, Stark C. Draper:
ADMM decoding of non-binary LDPC codes in F2m. 2449-2453 - Juane Li, Keke Liu, Shu Lin, Khaled A. S. Abdel-Ghaffar:
Quasi-cyclic LDPC codes on two arbitrary sets of a finite field. 2454-2458 - Neri Merhav:
List decoding - Random coding exponents and expurgated exponents. 2459-2463 - Tsung-Yi Chen, Adam R. Williamson, Richard D. Wesel:
Asymptotic expansion and error exponent for two-phase feedback codes on DMCs. 2464-2468 - Tsung-Yi Chen, Dariush Divsalar, Richard D. Wesel:
Achievability bounds for rate-compatible codes. 2469-2473
Information Measures
- Peter Harremoës:
Mutual information of contingency tables and related inequalities. 2474-2478 - Nils Bertschinger, Johannes Rauh:
The Blackwell relation defines no lattice. 2479-2483 - Georg Pichler, Günther Koliander, Erwin Riegler, Franz Hlawatsch:
Entropy for singular distributions. 2484-2488
Lossless Compression
- Hongchao Zhou, Da Wang, Gregory W. Wornell:
A simple class of efficient compression schemes supporting local access and editing. 2489-2493 - Thomas A. Courtade, Sergio Verdú:
Cumulant generating function of codeword lengths in optimal lossless compression. 2494-2498 - Thomas A. Courtade, Sergio Verdú:
Variable-length lossy compression and channel coding: Non-asymptotic converses via cumulant generating functions. 2499-2503 - Xiao Yang, Andrew R. Barron:
Compression and predictive distributions for large alphabet i.i.d and Markov models. 2504-2508
Finite Blocklength & Error Exponents
- Nir Weinberger, Neri Merhav:
Codeword or noise? Exact random coding exponents for slotted asynchronism. 2509-2513 - Sy-Quoc Le, Vincent Yan Fu Tan, Mehul Motani:
Second-order asymptotics for the Gaussian interference channel with strictly very strong interference. 2514-2518 - Yanina Y. Shkel, Vincent Y. F. Tan, Stark C. Draper:
Achievability bounds for unequal message protection at finite block lengths. 2519-2523 - Austin Collins, Yury Polyanskiy:
Orthogonal designs optimize achievable dispersion for coherent MISO channels. 2524-2528
Uplink and Downlink
- Ansuman Adhikary, Alexei E. Ashikhmin, Thomas L. Marzetta:
Uplink interference reduction in Large Scale Antenna Systems. 2529-2533 - Maha Alodeh, Symeon Chatzinotas, Björn E. Ottersten:
A multicast approach for constructive interference precoding in MISO downlink channel. 2534-2538 - Jonathan Scarlett, Alfonso Martinez, Albert Guillen i Fabregas:
Mismatched multi-letter successive decoding for the multiple-access channel. 2539-2543 - Wenbo He, Bobak Nazer, Shlomo Shamai:
Uplink-downlink duality for integer-forcing. 2544-2548
Gaussian Channel with Feedback
- Erdem Koyuncu, Hamid Jafarkhani:
Delay-limited capacity of MIMO channels with limited feedback. 2549-2553 - Marat V. Burnashev, Hirosuke Yamamoto:
Noisy feedback improves the Gaussian channel reliability function. 2554-2558 - Christoph Bunte, Amos Lapidoth, Lars Palzer:
Coding for the Gaussian channel with intermittent feedback. 2559-2563
Broadcast Channels with Imperfect CSI
- Jinyuan Chen, Sheng Yang, Ayfer Özgür, Andrea J. Goldsmith:
Outdated CSIT can achieve full DoF in heterogeneous parallel channels. 2564-2568 - Tsung-Yi Chen, Xu Chen, Dongning Guo:
Many-broadcast channels: Definition and capacity in the degraded case. 2569-2573 - Mohamed Fadel, Aria Nosratinia:
Coherent, non-coherent, and mixed-CSIR broadcast channels: Multiuser degrees of freedom. 2574-2578 - Jinyuan Chen, Petros Elia, Syed Ali Jafar:
On the vector broadcast channel with alternating CSIT: A topological perspective. 2579-2583
Decoding and Encoding Algorithms for Algebraic Codes
- Alexander Zeh, San Ling:
Decoding of quasi-cyclic codes up to a new lower bound on the minimum distance. 2584-2588 - Michael Helmling, Eirik Rosnes, Stefan Ruzika, Stefan Scholl:
Efficient maximum-likelihood decoding of linear block codes on binary memoryless channels. 2589-2593 - Anna-Lena Trautmann:
Message encoding for spread and orbit codes. 2594-2598 - Srdan Brkic, Predrag N. Ivanis, Bane Vasic:
Analysis of one-step majority logic decoding under correlated data-dependent gate failures. 2599-2603
Analysis of Iterative Decoding Algorithms
- Shrinivas Kudekar, Tom Richardson, Aravind R. Iyengar:
The effect of saturation on belief propagation decoding of LDPC codes. 2604-2608 - Saeedeh Moloudi, Michael Lentmaier:
Density evolution analysis of braided convolutional codes on the erasure channel. 2609-2613 - Qinliang Su, Yik-Chung Wu:
Determining the convergence of variance in Gaussian belief propagation via semi-definite programming. 2614-2618 - Nithin Raveendran, Shayan Garani Srinivasa:
A modified sum-product algorithm over graphs with isolated short cycles. 2619-2623
Topics in Signal Processing
- Sijia Liu, Makan Fardad, Swarnendu Kar, Pramod K. Varshney:
On optimal sensor collaboration topologies for linear coherent estimation. 2624-2628 - Hailong Shi, Hao Zhang, Gang Li, Xiqin Wang:
Stable grassmann manifold embedding via Gaussian random matrices. 2629-2633 - Wasim Huleihel, Neri Merhav:
Asymptotic MMSE analysis under sparse representation modeling. 2634-2638
Markov Fields Types and Tilings
- Yuliy M. Baryshnikov, Jaroslaw Duda, Wojciech Szpankowski:
Markov field types and tilings. 2639-2643 - Sheng Huang, Mikael Skoglund:
Supremus typicality. 2644-2648 - Junekey Jeon:
A generalized typicality for abstract alphabets. 2649-2653 - Jorge F. Silva, Milan S. Derpich:
Precise best k-term approximation error analysis of ergodic processes. 2654-2658
Successive Refinement
- Albert No, Amir Ingber, Tsachy Weissman:
Strong successive refinability: Sufficient conditions. 2659-2663 - Badri N. Vellambi, Roy Timo:
Successive refinement with common receiver reconstructions. 2664-2668 - Chien-Yi Wang, Michael Gastpar:
On distributed successive refinement with lossless recovery. 2669-2673 - Derek Xu, Kittipong Kittichokechai, Tobias J. Oechtering, Mikael Skoglund:
Secure successive refinement with degraded side information. 2674-2678
Finite Blocklength Source Coding
- Victoria Kostina, Yury Polyanskiy, Sergio Verdú:
Variable-length compression allowing errors. 2679-2683 - Shigeaki Kuzuoka, Shun Watanabe:
An information-spectrum approach to weak variable-length Slepian-Wolf coding. 2684-2688 - Oliver Kosut, Lalitha Sankar:
New results on third-order coding rate for universal fixed-to-variable source coding. 2689-2693
Backhaul Design for Cellular Systems
- Aly El Gamal, Venugopal V. Veeravalli:
Flexible backhaul design and degrees of freedom for linear interference networks. 2694-2698 - Seok-Hwan Park, Osvaldo Simeone, Onur Sahin, Shlomo Shamai:
Multivariate backhaul compression for the downlink of cloud radio access networks. 2699-2703 - Seok-Hwan Park, Osvaldo Simeone, Onur Sahin, Shlomo Shamai:
Multihop backhaul compression for the uplink of cloud radio access networks. 2704-2708 - Harpreet S. Dhillon, Giuseppe Caire:
Scalability of line-of-sight massive MIMO mesh networks for wireless backhaul. 2709-2713
Multi-way Relay Channel
- Zhiyu Cheng, Natasha Devroye:
The degrees of freedom of the K-pair-user full-duplex two-way interference channel with a MIMO relay. 2714-2718 - Reza Rafie Borujeny, Moslem Noori, Masoud Ardakani:
On the achievable rates of pairwise multiway relay channels. 2719-2723 - Stephan Schedler, Volker Kühn:
Mutual information based resource allocation in the two-way relay channel with OFDM. 2724-2728 - Leila Ghabeli, Milan S. Derpich:
Approaching the capacity of two-way gaussian relay channel with relay private messages. 2729-2733
Two-user IC
- Reza Khosravi-Farsani:
On the capacity region of the two-user Interference Channel. 2734-2738 - Zhengchuan Chen, Pingyi Fan, Dapeng Oliver Wu, Yunquan Dong, Khaled Ben Letaief:
On the achievable sum rate of Gaussian interference channel via Gaussian signaling. 2739-2743 - Igal Sason:
On the corner points of the capacity region of a two-user Gaussian interference channel. 2744-2748 - Lele Wang, Eren Sasoglu, Young-Han Kim:
Sliding-window superposition coding for interference networks. 2749-2753
Deletion Correction in Permutations
- Farzad Farnoud, Olgica Milenkovic:
Multipermutation codes in the Ulam metric. 2754-2758 - Ryan Gabrys, Eitan Yaakobi, Farzad Farnoud, Jehoshua Bruck:
Codes correcting erasures and deletions for rank modulation. 2759-2763 - Ryan Gabrys, Eitan Yaakobi, Farzad Farnoud, Frederic Sala, Jehoshua Bruck, Lara Dolecek:
Single-deletion-correcting codes over permutations. 2764-2768 - Frederic Sala, Ryan Gabrys, Lara Dolecek:
Deletions in multipermutations. 2769-2773
Topics in LDPC and Turbo Coding
- Irina E. Bocharova, Boris D. Kudryashov, Rolf Johannesson:
LDPC convolutional codes versus QC LDPC block codes in communication standard scenarios. 2774-2778 - Hironori Uchikawa:
Design of non-precoded protograph-based LDPC codes. 2779-2783 - Jean-Pierre Tillich, Audrey Tixier, Nicolas Sendrier:
Recovering the interleaver of an unknown turbo-code. 2784-2788 - Zihui Liu, Jens Zumbrägel, Marcus Greferath, Xin-Wen Wu:
Notes on the pseudoredundancy. 2789-2793
Optical Communications
- Ronen Dar, Meir Feder, Antonio Mecozzi, Mark Shtaif:
On shaping gain in the nonlinear fiber-optic channel. 2794-2798 - Masahiro Takeoka, Saikat Guha:
Capacity of optical communication in loss and noise with general quantum Gaussian receivers. 2799-2803 - Qun Zhang, Terence H. Chan, Alex J. Grant:
Spatially periodic signals for fiber channels. 2804-2808 - Hongchao Zhou, Gregory W. Wornell:
On the limits of communication over optical on-off keying channels with crosstalk. 2809-2813
Information Inequalities
- Siu-Wai Ho, Chee Wei Tan, Raymond W. Yeung:
Proving and disproving information inequalities. 2814-2818 - Randall Dougherty:
Computations of linear rank inequalities on six variables. 2819-2823 - Yuta Kishi, Nozomu Ochiumi, Masahiro Yanagida:
Entropy inequalities for sums over several subsets and their applications to average entropy. 2824-2828 - Liyao Wang, Jae Oh Woo, Mokshay M. Madiman:
A lower bound on the Rényi entropy of convolutions in the integers. 2829-2833
Rate Distortion for Gaussian Sources
- Alon Kipnis, Andrea J. Goldsmith:
Distortion rate function of cyclo-stationary Gaussian processes. 2834-2838 - Steffen Dempfle, Fabian Steiner, Amir Ingber, Tsachy Weissman:
Compression for quadratic similarity queries via shape-gain quantizers. 2839-2843 - Ramji Venkataramanan, Sekhar Tatikonda:
The Gaussian rate-distortion function of sparse regression codes with optimal encoding. 2844-2848 - Andreas Winkelbauer, Stefan Farthofer, Gerald Matz:
The rate-information trade-off for Gaussian vector channels. 2849-2853
Variations on Channel Capacity
- Pulkit Grover:
Is "Shannon-capacity of noisy computing" zero? 2854-2858 - Nir Elkayam, Meir Feder:
A universal decoder relative to a given family of metrics. 2859-2863 - Gábor Simonyi, Ágnes Tóth:
A generalization of Witsenhausen's zero-error rate for directed graphs. 2864-2868 - Arya Mazumdar:
On the capacity of memoryless adversary. 2869-2873 - Hideki Yagi, Ryo Nomura:
Single-letter characterization of epsilon-capacity for mixed memoryless channels. 2874-2878
Fading Channels
- Hamza Soury, Mohamed-Slim Alouini:
On the symbol error rate of M-ary MPSK over generalized fading channels with additive Laplacian noise. 2879-2883 - Gholamreza Alirezaei, Rudolf Mathar:
Scrutinizing the average error probability for Nakagami fading channels. 2884-2888 - Junyoung Nam:
Fundamental limits in correlated fading MIMO broadcast channels: Benefits of transmit correlation diversity. 2889-2893 - Zouheir Rezki, Mohamed-Slim Alouini:
On the outage capacity of the block fading channel at low-power regime. 2894-2898 - Behzad Asadi, Lawrence Ong, Sarah J. Johnson:
The capacity of three-receiver AWGN broadcast channels with receiver message side information. 2899-2903
Capacity Approximation
- David Sutter, Peyman Mohajerin Esfahani, Tobias Sutter, John Lygeros:
Efficient approximation of discrete memoryless channel capacities. 2904-2908 - Tobias Sutter, Peyman Mohajerin Esfahani, David Sutter, John Lygeros:
Capacity approximation of memoryless channels with countable output alphabets. 2909-2913 - Tobias Lutz:
Recursions for the trapdoor channel and an upper bound on its capacity. 2914-2918 - Xiao Gao, David B. Grayden, Mark D. McDonnell:
Using convex optimization to compute channel capacity in a channel model of cochlear implant stimulation. 2919-2923 - Ligong Wang, Gregory W. Wornell:
The impact of dark current on the wideband Poisson channel. 2924-2928
Multiple Access Channel
- Michal Yemini, Anelia Somekh-Baruch, Amir Leshem:
On the asynchronous cognitive MAC. 2929-2933 - Tal Kopetz, Haim H. Permuter, Shlomo Shamai:
Multiple access channels with combined cooperation and partial cribbing. 2934-2938 - Jui Wu, Achilleas Anastasopoulos:
The feedback capacity of a class of finite state multiple access channels. 2939-2943 - Lóránt Farkas, Tamás Kói:
Universal error exponent for discrete asynchronous multiple access channels. 2944-2948 - Jingge Zhu, Michael Gastpar:
Gaussian (dirty) multiple access channels: A compute-and-forward perspective. 2949-2953
Algebraic Coding Theory 2
- Rafael Gregorio Lucas D'Oliveira, Marcelo Firer:
The packing radius of a code and partitioning problems: The case for poset metrics. 2954-2958 - Yeow Meng Chee, Van Khu Vu:
Breakpoint analysis and permutation codes in generalized Kendall tau and Cayley metrics. 2959-2963 - Yeow Meng Chee, Liyasi Wu, Chaoping Xing:
Correcting on curves and highly sound locally correctable codes of high rate. 2964-2966 - Marion Bellard, Jean-Pierre Tillich:
Detecting and reconstructing an unknown convolutional code by counting collisions. 2967-2971
Decoding of Polar Codes
- Peter Trifonov:
Binary successive cancellation decoding of polar codes with Reed-Solomon kernel. 2972-2976 - Alexios Balatsoukas-Stimming, Georgios Karakonstantis, Andreas Burg:
Enabling complexity-performance trade-offs for successive cancellation decoding of polar codes. 2977-2981 - Veeresh Taranalli, Paul H. Siegel:
Adaptive linear programming decoding of polar codes. 2982-2986 - Jing Guo, Minghai Qin, Albert Guillen i Fabregas, Paul H. Siegel:
Enhanced belief propagation decoding of polar codes through concatenation. 2987-2991 - Dina Goldin, David Burshtein:
Gap to capacity in concatenated Reed-Solomon polar coding scheme. 2992-2996
Linear Inverse Problems 1
- Reinhard Heckel, Michael Tschannen, Helmut Bölcskei:
Subspace clustering of dimensionality-reduced data. 2997-3001 - Sunav Choudhary, Urbashi Mitra:
Sparse blind deconvolution: What cannot be done. 3002-3006 - Christos Thrampoulidis, Samet Oymak, Babak Hassibi:
Simple error bounds for regularized noisy linear inverse problems. 3007-3011 - Matthew S. Nokleby, Miguel R. D. Rodrigues, A. Robert Calderbank:
Discrimination on the grassmann manifold: Fundamental limits of subspace classifiers. 3012-3016 - Galen Reeves:
The fundamental limits of stable recovery in compressed sensing. 3017-3021
Information Theory & Statistics
- Venkat Anantharam, Amin Aminzadeh Gohari, Sudeep Kamath, Chandra Nair:
On hypercontractivity and a data processing inequality. 3022-3026 - Sabyasachi Chatterjee, Andrew R. Barron:
Information theoretic validity of penalized likelihood. 3027-3031 - Mustafa S. Mehmetoglu, Emrah Akyol, Kenneth Rose:
A deterministic annealing approach to Witsenhausen's counterexample. 3032-3036 - Jun'ichi Takeuchi, Andrew R. Barron:
Asymptotically minimax regret for models with hidden variables. 3037-3041 - Zsolt Talata:
Markov neighborhood estimation with linear complexity for random fields. 3042-3046
Variations on Lossy Source Coding
- Yeow-Khiang Chia, Hon Fah Chong:
On lossy source coding with side information under the erasure distortion measure. 3047-3051 - Hongbo Si, Onur Ozan Koyluoglu, Sriram Vishwanath:
Lossy compression of exponential and laplacian sources using expansion coding. 3052-3056 - Vinay Praneeth Boda, Prakash Narayan:
Sampling rate distortion. 3057-3061 - Photios A. Stavrou, Christos K. Kourtellaris, Charalambos D. Charalambous:
Applications of information Nonanticipative Rate Distortion Function. 3062-3066
Capacity with Constraints or Mismatch
- Anelia Somekh-Baruch:
A general formula for the mismatch capacity. 3067-3071 - Yonglong Li, Guangyue Han:
Input-constrained erasure channels: Mutual information and capacity. 3072-3076 - Jihad Fahs, Ibrahim C. Abou-Faycal:
A cauchy input achieves the capacity of a Cauchy channel under a logarithmic constraint. 3077-3081 - Or Ordentlich, Ofer Shayevitz:
Bounding techniques for the intrinsic uncertainty of channels. 3082-3086
MIMO Systems
- Yang Liu, Tiffany Jing Li, Xuanxuan Lu:
Multi-terminal joint transceiver design for MIMO systems with contaminated source and individual power constraint. 3087-3091 - Xiaohu Shang:
Interference mitigation and signal enhancement for K-user MIMO interference channels. 3092-3096 - Pierre Coucheney, Bruno Gaujal, Panayotis Mertikopoulos:
Distributed optimization in multi-user MIMO systems with imperfect and delayed information. 3097-3101 - Alexander Fish, Shamgar Gurevich:
Performance estimates of the pseudo-random method for radar detection. 3102-3106 - Ebtihal H. G. Yousif, Tharmalingam Ratnarajah:
On the design and throughput analysis of a new MME detector using Bartlett's method. 3107-3111 - Pengfei Yang, Biao Chen:
Wyner's common information in Gaussian channels. 3112-3116
Variations on MAC
- Alexandros Manolakos, Mainak Chowdhury, Andrea J. Goldsmith:
CSI is not needed for optimal scaling in multiuser massive SIMO systems. 3117-3121 - Uri Mendlovic, Meir Feder:
Collaboration gain in MAC is limited. 3122-3126 - Xu Chen, Dongning Guo:
Many-access channels: The Gaussian case with random user activities. 3127-3131 - Parham Noorzad, Michelle Effros, Michael Langberg, Tracey Ho:
On the power of cooperation: Can a little help a lot? 3132-3136
Code Distance and Weight Enumerators
- Guanghui Song, Jun Cheng:
Distance enumerator analysis for multi-user codes. 3137-3141 - Ryutaroh Matsumoto:
New asymptotic metrics for relative generalized Hamming weight. 3142-3144 - Wenbing Chen, Jinquan Luo, Yuansheng Tang:
Exponential sum from half quadratic forms and its application. 3145-3149 - Danilo Gligoroski, Katina Kralevska:
Families of Optimal Binary Non-MDS Erasure Codes. 3150-3154
LDPC and Turbo Code Analysis
- Eirik Rosnes, Marcel Adrian Ambroze, Martin Tomlinson:
An upper bound on the minimum distance of array low-density parity-check codes. 3155-3159 - Pavel S. Rybin, Victor V. Zyablov:
On the upper bound on undetected error probability for LDPC code. 3160-3164 - Pavel S. Rybin:
On the error-correcting capabilities of low-complexity decoded irregular LDPC codes. 3165-3169 - Ayça Özçelikkale, Tolga M. Duman:
Lower bounds on the error probability of turbo codes. 3170-3174
Linear Inverse Problems 2
- Samet Oymak, Babak Hassibi:
A case for orthogonal measurements in linear inverse problems. 3175-3179 - Quan Geng, John Wright:
On the local correctness of ℓ1-minimization for dictionary learning. 3180-3184 - Mikko Vehkaperä, Yoshiyuki Kabashima, Saikat Chatterjee:
Analysis of regularized LS reconstruction and random matrix ensembles in compressed sensing. 3185-3189 - Yuan Wang, Yajun Mei:
Online parallel monitoring via hard-thresholding post-change estimation. 3190-3194 - Saeed Bagheri, Anna Scaglione:
The Cognitive Compressive Sensing problem. 3195-3199 - Jayadev Acharya, Ashkan Jafarpour, Alon Orlitsky, Ananda Theertha Suresh:
Sublinear algorithms for outlier detection and generalized closeness testing. 3200-3204 - Yun Li, Sirin Nitinawarat, Venugopal V. Veeravalli:
Universal sequential outlier hypothesis testing. 3205-3209
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-01-29 02:19 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:
