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