default search action
ISIT 2015: Hong Kong, China
- IEEE International Symposium on Information Theory, ISIT 2015, Hong Kong, China, June 14-19, 2015. IEEE 2015, ISBN 978-1-4673-7704-1
Mo-AM1-1: List Decoding 1
- Lin-Zhi Shen
, Fang-Wei Fu:
The list decoding error probability of linear codes over the erasure channel. 1-5 - Netanel Raviv, Antonia Wachter-Zeh:
Some Gabidulin codes cannot be list decoded efficiently at any radius. 6-10 - Hannes Bartz
List and probabilistic unique decoding of folded subspace codes. 11-15 - Alexander Zeh, Ron M. Roth:
Improved burst error correction via list decoding quasi-cyclic codes. 16-20
Mo-AM1-2: Cooperative MACS
- Ritesh Kolte
State-dependent multiple-access channels with partially cribbing encoders. 21-25 - Tal Kopetz, Haim H. Permuter
Cooperative multiple access channels with oblivious encoders. 26-30 - Yi Ouyang, Demosthenis Teneketzis:
A common information-based multiple access protocol achieving full throughput. 31-35 - Parham Noorzad, Michelle Effros, Michael Langberg:
On the cost and benefit of cooperation. 36-40
Mo-AM1-3: LPDC and Spatially Coupled LDPC Codes
- Walter Nitzold, Gerhard P. Fettweis, Michael Lentmaier:
Rate-compatible spatially-coupled LDPC code ensembles with nearly-regular degree distributions. 41-45 - Xuan He, Liang Zhou, Junyi Du, Zhiping Shi:
The multi-step PEG and ACE constrained PEG algorithms can design the LDPC codes with better cycle-connectivity. 46-50 - Behzad Amiri, Amirhossein Reisizadeh, Jörg Kliewer, Lara Dolecek:
Optimized array-based spatially-coupled LDPC Codes: An absorbing set approach. 51-55 - Lei M. Zhang, Dmitri V. Truhachev, Frank R. Kschischang
Spatially-coupled split-component codes with bounded-distance component decoding. 56-60
Mo-AM1-4: Topics in Coding and Information Theory
- Paolo Minero, Massimo Franceschetti:
Anytime capacity of Markov channels. 61-65 - Abhinav Ganesan, Sidharth Jaggi, Venkatesh Saligrama
Learning immune-defectives graph through group tests. 66-70 - Audrey Tixier:
Blind identification of an unknown interleaved convolutional code. 71-75 - Morteza Varasteh, Deniz Gündüz
Delay limited transmission of a uniform source over an AWGN channel. 76-80
Mo-AM1-5: Error Exponents 1
- Yuta Sakai
Feasible regions of symmetric capacity and Gallager's E0 function for ternary-input discrete memoryless channels. 81-85 - Jonathan Scarlett, Alfonso Martinez
The likelihood decoder: Error exponents and mismatch. 86-90 - Junya Honda:
Exact asymptotics for the random coding error probability. 91-95 - Seçkin Anil Yildirim
Achievable rates and exponents for asynchronous communication with ML decoding. 96-100
Mo-AM1-6: Gaussian Channels and Secrecy
- Nir Shlezinger
The secrecy capacity of MIMO Gaussian channels with finite memory. 101-105 - Si-Hyeon Lee, Ashish Khisti:
The degraded Gaussian diamond-wiretap channel. 106-110 - Hao Ge, Ruijie Xu, Randall A. Berry
Secure signaling games for Gaussian multiple access wiretap channels. 111-115 - Sanket Satpathy, Paul W. Cuff:
Gaussian secure source coding and Wyner's Common Information. 116-120
Mo-AM1-7: Capacity in Energy Harvesting Communications
- Varun S. Jog, Venkat Anantharam:
A geometric analysis of the AWGN channel with a (σ, ρ)-power constraint. 121-125 - Wei Mao, Babak Hassibi:
New capacity upper bounds and coding aspects for some channels with causal CSIT. 126-130 - Dor Shaviv
Capacity of the energy harvesting channel with a finite battery. 131-135 - Dor Shaviv
Capacity of the AWGN channel with random battery recharges. 136-140
Mo-AM1-8: Changepoint Detection and Estimation
- Cheng-Der Fuh, Yajun Mei:
Quickest change detection and Kullback-Leibler divergence for two-state hidden Markov models. 141-145 - Taposh Banerjee, Hamed Firouzi, Alfred O. Hero III:
Non-parametric quickest change detection for large scale random matrices. 146-150 - Yong Sheng Soh, Venkat Chandrasekaran:
High-dimensional change-point estimation: Combining filtering with convex optimization. 151-155 - Ehsan Ebrahimzadeh, Aslan Tchamkerten:
Sequential detection of transient changes in stochastic systems under a sampling constraint. 156-160
Mo-AM1-9: Ad Hoc and Wireless Networks
- An Liu, Vincent K. N. Lau:
On the improvement of scaling laws for wireless ad hoc networks with physical layer caching. 161-165 - Philippe Jacquet:
Optimized outage capacity in random wireless networks in uniform and fractal maps. 166-170 - Serj Haddad
On the broadcast capacity of large wireless networks at low SNR. 171-175 - Yu Zhang, Zhaoyang Zhang, Li Ping, Xiaoming Chen, Caijun Zhong
Capacity scaling of relay networks with successive relaying. 176-180
Mo-AM2-1: Algebra for Coding
- Li Xiao, Xiang-Gen Xia:
A robust Chinese Remainder Theorem with applications in error correction coding. 181-185 - Pascale Charpin, Sihem Mesnager, Sumanta Sarkar:
On involutions of finite fields. 186-190 - Lu Wei, Renaud-Alexandre Pitaval, Jukka Corander, Olav Tirkkonen
On the volume of a metric ball in unitary group. 191-195 - Hugues Randriambololona:
Linear independence of rank 1 matrices and the dimension of *-products of codes. 196-200
Mo-AM2-2: Gaussian Interference Channels
- Lan V. Truong
On the capacity of symmetric Gaussian interference channels with feedback. 201-205 - Xiaohu Shang:
Partial capacity boundary of parallel Gaussian Z interference channels. 206-210 - Junyoung Nam:
Upper bounds on the sum capacity of the K-user Gaussian interference channel. 211-215 - Ruchen Duan, Yingbin Liang, Shlomo Shamai
State-dependent Gaussian Z-interference channel: Capacity results. 216-220
Mo-AM2-3: Finite Length Analysis of Polar Codes
- Hsien-Ping Lin, Shu Lin
Binary nonlinear kernels of maximum exponents of polar codes of dimensions up to sixteen. 221-225 - Dina Goldin, David Burshtein:
On the finite length scaling of ternary polar codes. 226-230 - Min Ye, Alexander Barg:
Polar codes using dynamic kernels. 231-235 - Jing Guo, Albert Guillen i Fabregas:
Efficient sphere decoding of polar codes. 236-240
Mo-AM2-4: application Specific Codes
- Yeow Meng Chee
Combinatorial systematic switch codes. 241-245 - Ohad Elishco
Semiconstrained systems. 246-250 - Thomas Mittelholzer, Thomas P. Parnell, Nikolaos Papandreou, Haralampos Pozidis:
Symmetry-based subproduct codes. 251-255 - Igor V. Zhilin
High-rate codes for high-reliability data transmission. 256-260
Mo-AM2-5: Source-Channel Coding 1
- Andrew J. Young, Yury Polyanskiy:
Converse and duality results for combinatorial source-channel coding in binary Hamming spaces. 261-265 - Roy Timo, Michèle A. Wigger:
Slepian-wolf coding for broadcasting with cooperative base-stations. 266-270 - Arya Mazumdar, Ankit Singh Rawat
On adversarial joint source channel coding. 271-275 - Victoria Kostina
Joint source-channel coding with feedback. 276-280
Mo-AM2-6: Capacity and Equivocation Aspects of Secrecy
- Masahito Hayashi, Vincent Yan Fu Tan:
Equivocations and exponents under various Rényi information measures. 281-285 - Peng Xu, Zhiguo Ding, Xuchu Dai:
The private key capacity of a cooperative pairwise-independent network. 286-290 - Huishuai Zhang, Yingbin Liang, Lifeng Lai:
Secret key capacity: Talk or keep silent? 291-295 - Manuj Mukherjee
The communication complexity of achieving SK capacity in a class of PIN models. 296-300
Mo-AM2-7: Finite Blocklength Analysis 1
- Mohammad Hossein Yassaee:
One-shot achievability via fidelity. 301-305 - Ryo Nomura
Information spectrum approach to fixed-length lossy source coding problem with some excess distortion probability. 306-310 - Silas L. Fong
Asymptotic expansions for the AWGN channel with feedback under a peak power constraint. 311-315
Mo-AM2-8: Advances in Signal Processing
- Or Ordentlich, Uri Erez:
Performance analysis and optimal filter design for sigma-delta modulation via duality with DPCM. 321-325 - Lukas Bruderer, Hampus Malmberg
Deconvolution of weakly-sparse signals and dynamical-system identification by Gaussian message passing. 326-330 - Jun Chen
The metrication of LPI radar waveforms based on the asymptotic spectral distribution of wigner matrices. 331-335 - Mojtaba Soltanalian
Beyond semidefinite relaxation: Basis banks and computationally enhanced guarantees. 336-340
Mo-AM2-9: Fading Channels 1
- Juan Manuel Romero-Jerez, Francisco Javier López-Martínez:
On the distribution of the squared norm of non-circular complex Gaussian random variables with applications. 341-345 - Nadhir Ben Rached, Abla Kammoun, Mohamed-Slim Alouini
A unified simulation approach for the fast outage capacity evaluation over generalized fading channels. 346-350 - Khoa D. Nguyen
Causal-CSIT rate adaptation for block-fading channels. 351-355 - Adriano Pastore, Michael Gastpar:
A unified view on nearest-neighbor decoding rates for noncoherent and semicoherent fading channels. 356-360
Mo-PM1-1: Network Coding for Multiple Unicasts
- Wentao Huang, Michael Langberg, Jörg Kliewer:
Connecting multiple-unicast and network error correction: Reduction and unachievability. 361-365 - Kai Cai, Guangyue Han:
On network coding advantage for multiple unicast networks. 366-370 - Ming Fai Wong, Michelle Effros, Michael Langberg:
On an equivalence of the reduction of k-unicast to 2-unicast capacity and the edge removal property. 371-375 - Jayant Apte, John MacLaren Walsh:
Symmetry in network coding. 376-380 - Karthikeyan Shanmugam
On approximating the sum-rate for multiple-unicasts. 381-385
Mo-PM1-2: Broadcast Channels
- Behzad Asadi, Lawrence Ong
A unified scheme for two-receiver broadcast channels with receiver message side information. 386-390 - Ronit Bustin, Rafael F. Schaefer, H. Vincent Poor
On MMSE properties of "good" and "bad" codes for the Gaussian broadcast channel. 391-395 - Jin Sima, Wei Chen:
Multicasting messages over Gaussian broadcast channels with receiver message side information. 396-400 - Sina Lashgari, Ravi Tandon, Amir Salman Avestimehr:
A general outer bound for MISO broadcast channel with heterogeneous CSIT. 401-405 - Michael Heindlmaier, Shirin Saeedi Bidokhti:
Capacity regions of two-user broadcast erasure channels with feedback and hidden memory. 406-410
Mo-PM1-3: LDPC Code Analysis
- Louay Bazzi, Hani Audah:
Impact of redundant checks on the LP decoding thresholds of LDPC codes. 411-415 - Juane Li, Shu Lin
Improved message-passing algorithm for counting short cycles in bipartite graphs. 416-420 - David G. M. Mitchell, Michael Lentmaier, Ali Emre Pusane, Daniel J. Costello Jr.:
Approximating decoding thresholds of punctured LDPC code ensembles on the AWGN channel. 421-425 - Francisco Javier Cuadros Romero
Decoding LDPC codes with mutual information-maximizing lookup tables. 426-430 - Sudarsan V. S. Ranganathan, Dariush Divsalar, Richard D. Wesel:
On the girth of (3, L) quasi-cyclic LDPC codes based on complete protographs. 431-435
Mo-PM1-4: Lattice Codes 1
- Roope Vehkalahti
Number field lattices achieve Gaussian and Rayleigh channel capacity within a constant gap. 436-440 - Ahmed Hindy, Aria Nosratinia:
Achieving the ergodic capacity with lattice codes. 441-445 - Laura Luzzi, Roope Vehkalahti
Division algebra codes achieve MIMO block fading channel capacity within a constant gap. 446-450 - Jinming Wen, Xiao-Wen Chang:
A modified KZ reduction algorithm. 451-455 - Mayur Punekar, Joseph Jean Boutros, Ezio Biglieri:
A Poltyrev outage limit for lattices. 456-460
Mo-PM1-5: Source-Channel Coding 2
- Shraga I. Bross, Yaron Laufer:
Necessary condition for sending a bivariate Gaussian source over the "asymmetric" Gaussian MAC. 461-465 - Maël Le Treust:
Empirical coordination with two-sided state information and correlated source and state. 466-470 - Maël Le Treust:
Empirical coordination with channel feedback and strictly causal or causal encoding. 471-475 - Chao Tian, Jun Chen, Suhas N. Diggavi, Shlomo Shamai
Matched multiuser Gaussian source-channel communications via uncoded schemes. 476-480 - Erman Koken, Ertem Tuncel
On the asymptotic distortion-energy tradeoff for zero-delay transmission of a Gaussian source over the AWGN channel. 481-485
Mo-PM1-6: Boolean Functions and Cryptography
- Tianze Wang, Meicheng Liu, Shangwei Zhao, Dongdai Lin:
Construction of cubic rotation symmetric bent functions in power-of-two variables. 486-490 - Baofeng Wu, Jia Zheng, Dongdai Lin:
Constructing Boolean functions with (potentially) optimal algebraic immunity based on multiplicative decompositions of finite fields. 491-495 - Meicheng Liu, Dongdai Lin, Wenhao Wang:
Searching cubes for testing Boolean functions and its application to Trivium. 496-500 - Chia-Jung Lee, Satyanarayana V. Lokam, Shi-Chun Tsai, Ming-Chuan Yang:
Restrictions of nondegenerate Boolean functions and degree lower bounds over different rings. 501-505 - Baofeng Wu, Dongdai Lin:
On the dual of generalized Boolean bent functions over ℤ4. 506-510
Mo-PM1-7: Topics in Shannon Theory 1
- Venkat Chandar, Aslan Tchamkerten:
Asynchronous capacity per unit cost under a receiver sampling constraint. 511-515 - Sergey Loyka, Charalambos D. Charalambous
A general formula for compound channel capacity. 516-520 - Christos K. Kourtellaris, Charalambos D. Charalambous
Nonanticipative transmission for sources and channels with memory. 521-525 - Anelia Somekh-Baruch:
On mismatched list decoding. 526-530 - Anelia Somekh-Baruch:
Multi-letter converse bounds for the mismatched discrete memoryless channel with an additive metric. 531-535
Mo-PM1-8: Algorithms for Compressed Sensing
- Chao-Bing Song, Shu-Tao Xia, Xin-Ji Liu:
Subspace thresholding pursuit: A reconstruction algorithm for compressed sensing. 536-540 - Xiaochen Zhao, Wei Dai:
On joint recovery of sparse signals with common supports. 541-545 - Pan Li, Wei Dai, Huadong Meng, Xiqin Wang:
On recovery of sparse signals with block structures. 546-550 - Siddhartha Satpathi, Luca Baldassarre, Volkan Cevher:
Sparse group covers and greedy tree approximations. 551-555 - Christos Thrampoulidis, Babak Hassibi:
Isotropically random orthogonal matrices: Performance of LASSO and minimum conic singular values. 556-560
Mo-PM1-9: Physical-Layer Network Coding
- Yihua Tan, Xiaojun Yuan:
Compute-compress-and-forward. 561-565 - Yu-Chih Huang
Adaptive compute-and-forward with lattice codes over algebraic integers. 566-570 - Shwan Ashrafi, Chen Feng
Slotted ALOHA with compute-and-forward. 571-575 - Islam El Bakoury, Bobak Nazer:
The impact of channel variation on integer-forcing receivers. 576-580 - Islam El Bakoury, Wenbo He, Bobak Nazer:
Integer-forcing interference alignment: Iterative optimization via aligned lattice reduction. 581-585
Mo-PM2-1: Topics in Network Coding 1
- Eli Ben-Sasson, Tuvi Etzion, Ariel Gabizon, Netanel Raviv:
Subspace polynomials and cyclic subspace codes. 586-590 - Srikanth B. Pai, B. Sundar Rajan:
On the bounds of certain maximal linear codes in a projective space. 591-595 - Natarajan Lakshmi Prasad
Capacity of coded index modulation. 596-600 - Bin Wang, Haibin Kan, Kenneth W. Shum:
Hermitian codes in distributed storage systems with optimal error-correcting capacity. 601-605 - Ardhendu Tripathy
Capacity of sum-networks for different message alphabets. 606-610
Mo-PM2-2: The X-Channel
- Praneeth Kumar V.
On the sum capacity of the Gaussian x channel in the mixed interference regime. 611-615 - Zhao Wang, Ming Xiao
Secrecy degrees of freedom of wireless X networks using artificial noise alignment. 616-620 - Abhinav Ganesan, Koteshwar Pavan Srinath:
Interference aligned space-time transmission with diversity for the 2 × 2 X-Network. 621-625 - Jingjing Zhang, Dirk T. M. Slock, Petros Elia
Achieving the DoF limits of the SISO X channel with imperfect-quality CSIT. 626-630 - Songze Li, David T. H. Kao, Amir Salman Avestimehr:
Rover-to-orbiter communication in Mars: Taking advantage of the varying topology. 631-635
Mo-PM2-3: Coding for Memory
- Zhiying Wang
Optimal binary switch codes with small query size. 636-640 - Hessam Mahdavifar, Alexander Vardy
Explicit capacity achieving codes for defective memories. 641-645 - Eyal En Gad, Wentao Huang, Yue Li, Jehoshua Bruck
Rewriting flash memories by message passing. 646-650 - Meysam Asadi, Erich F. Haratsch, Aleksandar Kavcic, Narayana P. Santhanam:
Write process modeling in MLC flash memories using renewal theory. 651-655 - Rami Cohen, Yuval Cassuto:
Algorithms and throughput analysis for MDS-coded switches. 656-660
Mo-PM2-4: Big Data Analytics
- Shao-Lun Huang, Lizhong Zheng:
A spectrum decomposition to the feature spaces and the application to big data analytics. 661-665 - Anders Høst-Madsen, Elyas Sabeti:
Atypical information theory for real-valued data. 666-670 - Pejman Khadivi, Ravi Tandon, Naren Ramakrishnan
Online denoising of discrete noisy data. 671-675 - Diego Mesa, Sanggyun Kim, Todd P. Coleman:
A scalable framework to transform samples from one continuous distribution to another. 676-680 - Sanggyun Kim, Diego Mesa, Todd P. Coleman:
Efficient total probability prediction via convex optimization and optimal transport. 681-685
Mo-PM2-5: Distributed Quantum Protocols
- Walter O. Krawec:
Security proof of a semi-quantum key distribution protocol. 686-690 - Masahito Hayashi, Masaki Owari:
Tight asymptotic bounds on local hypothesis testing between a pure bipartite state and the white noise state. 691-695 - Hiroaki Sasaki, Ryutaroh Matsumoto
Key rate of the B92 quantum key distribution protocol with finite qubits. 696-699 - Eyuri Wakakuwa, Akihito Soeda, Mio Murao:
Markovianizing cost of tripartite quantum states. 700-704 - Eyuri Wakakuwa, Akihito Soeda, Mio Murao:
A coding theorem for bipartite unitaries in distributed quantum computation. 705-709
Mo-PM2-6: Key Generation and Distribution
- Jingbo Liu, Paul W. Cuff, Sergio Verdú:
Secret key generation with one communicator and a one-shot converse via hypercontractivity. 710-714 - Huishuai Zhang, Yingbin Liang, Lifeng Lai, Shlomo Shamai
Two-key generation for a cellular model with a helper. 715-719 - Wenwen Tu, Lifeng Lai:
On the simulatability condition in key generation over a non-authenticated public channel. 720-724 - Mitsugu Iwamoto, Junji Shikata:
Constructions of symmetric-key encryption with guessing secrecy. 725-729 - Christoph Pacher
An information reconciliation protocol for secret-key agreement with small leakage. 730-734
Mo-PM2-7: Information Measures
- Rami Atar, Neri Merhav:
Information-theoretic applications of the logarithmic probability comparison bound. 735-739 - Peter Harremoës
Lattices with non-Shannon inequalities. 740-744 - Siu-Wai Ho
Convexity/concavity of renyi entropy and α-mutual information. 745-749 - Peng Xu, Mokshay M. Madiman:
The norm of the Fourier series operator. 750-754 - Jingbo Liu, Paul W. Cuff, Sergio Verdú:
Resolvability in Eγ with applications to lossy compression and wiretap channels. 755-759
Mo-PM2-8: Topics in Detection and Estimation 1
- Yanting Ma, Dror Baron
Mismatched estimation in large linear systems. 760-764 - Javad Heydari, Ali Tajer:
Quickest linear search over correlated sequences. 765-769 - Sirin Nitinawarat, Venugopal V. Veeravalli:
Universal quickest outlier detection and isolation. 770-774 - Ehsan Variani, Kamel Lahouel, Avner Bar-Hen, Bruno Jedynak:
NON-adaptive policies for 20 questions target localization. 775-778 - Pierre Moulin, Patrick R. Johnstone:
Strong large deviations for Rao test score and GLRT in exponential families. 779-783
Mo-PM2-9: Queueing
- Wonju Lee, Osvaldo Simeone
HARQ buffer management: An information-theoretic view. 784-788 - AmirEmad Ghassami, Xun Gong, Negar Kiyavash:
Capacity limit of queueing timing channel in shared FCFS schedulers. 789-793 - Matha Deghel, Mohamad Assaad, Mérouane Debbah:
Queueing stability and CSI probing of a TDD wireless network with interference alignment. 794-798 - Mustafa Ozmen, Mustafa Cenk Gursoy:
Energy efficiency in multiple-antenna channels with markov arrivals and queueing constraints. 799-803
Tu-AM1-SP1: Semi-Plenary Session 1A
- Chandra Chekuri, Sudeep Kamath, Sreeram Kannan, Pramod Viswanath:
Delay-constrained unicast and the triangle-cast problem. 804-808 - Mohammad Ali Maddah-Ali, Urs Niesen:
Cache-aided interference channels. 809-813 - Han Mao Kiah, Gregory J. Puleo, Olgica Milenkovic:
Codes for DNA sequence profiles. 814-818 - Yuval Cassuto, Koby Crammer:
In-memory hamming similarity computation in resistive arrays. 819-823
Tu-AM1-SP2: Semi-Plenary Session 1B
- Yihong Wu, Pengkun Yang:
Optimal entropy estimation on large alphabets via best polynomial approximation. 824-828 - Varun S. Jog, Venkat Anantharam:
On the geometry of convex typical sets. 829-833 - Hyeji Kim, Benjamin Nachman, Abbas El Gamal:
Superposition coding is almost always optimal for the Poisson broadcast channel. 834-838 - Jiantao Jiao, Kartik Venkat, Yanjun Han, Tsachy Weissman:
Maximum Likelihood Estimation of information measures. 839-843
Tu-AM2-1: Regenerating Codes 1
- Chao Tian, Tie Liu:
Multilevel diversity coding with regeneration. 844-848 - Imad Ahmad
When locally repairable codes meet regenerating codes - What if some helpers are unavailable. 849-853 - Ximing Fu
Overhead-free in-place recovery and repair schemes of XOR-based regenerating codes. 854-858 - N. Prakash, M. Nikhil Krishnan
The storage-repair-bandwidth trade-off of exact repair linear regenerating codes for the case d = k = n - 1. 859-863
Tu-AM2-2: Interference Alignment 1
- Jingwen Bai, Suhas N. Diggavi, Ashutosh Sabharwal:
On degrees-of-freedom of multi-user MIMO full-duplex network. 864-868 - Sang-Woon Jeon, Sung Ho Chae, Sung Hoon Lim
Degrees of freedom of full-duplex multiantenna cellular networks. 869-873 - Vasilis Ntranos, Mohammad Ali Maddah-Ali, Giuseppe Caire:
Cooperation alignment for distributed interference management. 874-878 - Kaniska Mohanty, Mahesh K. Varanasi:
The degrees of freedom region of the 3-User MIMO cyclic Z-interference channel with perfect and delayed CSIT. 879-883
Tu-AM2-3: Spatially-Coupled Codes
- Eirik Rosnes:
On the minimum distance of array-based spatially-coupled low-density parity-check codes. 884-888 - Markus Stinner, Pablo M. Olmos:
Finite-length performance of multi-edge protograph-based spatially coupled LDPC codes. 889-893 - Kechao Huang, Xiao Ma, Daniel J. Costello Jr.:
EXIT chart analysis of block markov superposition transmission of short codes. 894-898 - Masaru Fukushima, Takuya Okazaki, Kenta Kasai:
Spatially-coupled MacKay-Neal codes universally achieve the symmetric information rate of arbitrary generalized erasure channels with memory. 899-903
Tu-AM2-4: Sequence Assembly and DNA Storage
- Farzad Farnoud, Moshe Schwartz
A stochastic model for genomic interspersed duplication. 904-908 - Ryan Gabrys, Han Mao Kiah, Olgica Milenkovic:
Asymmetric Lee distance codes for DNA-based storage. 909-913 - Govinda M. Kamath, Eren Sasoglu, David N. C. Tse:
Optimal haplotype assembly from high-throughput mate-pair reads. 914-918 - Ilan Shomorony, Thomas A. Courtade, David N. C. Tse:
Do read errors matter for genome assembly? 919-923
Tu-AM2-5: Error Exponents 2
- Yasutada Oohama, Yutaka Jitsumatsu:
A new iterative algorithm for computing the optimal exponent of correct decoding for discrete memoryless channels. 924-928 - Gonzalo Vazquez-Vilar, Alfonso Martinez
A derivation of the cost-constrained sphere-packing exponent. 929-933 - Venkat Anantharam, François Baccelli:
On error exponents for a dimension-matched vector MAC with additive noise. 934-938 - Yasutada Oohama:
Strong converse exponent for degraded broadcast channels at rates outside the capacity region. 939-943
Tu-AM2-6: Information Theoretic Security
- Parthajit Mohapatra, Chandra R. Murthy
Capacity of the deterministic z-interference channel with unidirectional transmitter cooperation and secrecy constraints. 944-948 - Prakash Narayan, Himanshu Tyagi, Shun Watanabe
Common randomness for secure computing. 949-953 - Athanasios Papadopoulos, László Czap, Christina Fragouli:
LP formulations for secrecy over erasure networks with feedback. 954-958 - Yvo Desmedt, Kirill Morozov:
Parity Check based redistribution of secret shares. 959-963
Tu-AM2-7: Topics in Shannon Theory 2
- Taehyung J. Lim, Massimo Franceschetti:
Bits of Kolmogorov and Shannon in a deterministic setting. 964-968 - Yonatan Kaspi, Ofer Shayevitz, Tara Javidi
Searching for multiple targets with measurement dependent noise. 969-973 - Qi Chen, Fan Cheng, Tie Liu, Raymond W. Yeung:
A marginal characterization of entropy functions for conditional mutually independent random variables (with application to Wyner's common information). 974-978 - Benjamin Larrousse, Samson Lasaulce, Michèle A. Wigger:
Coordination in state-dependent distributed networks: The two-agent case. 979-983
Tu-AM2-8: Applications of Compressed Sensing 1
- Yuanxin Li, Yuejie Chi
Super-resolution of mutually interfering signals. 984-988 - Ramtin Pedarsani, Kangwook Lee, Kannan Ramchandran:
Capacity-approaching PhaseCode for low-complexity compressive phase retrieval. 989-993 - Francesco Renna
Classification and reconstruction of compressed GMM signals with side information. 994-998 - Erwin Riegler, Georg Tauböck
Almost lossless analog compression without phase information. 999-1003
Tu-AM2-9: Cellular Networks
- Maria Gregori, Jesús Gómez-Vilardebó
Joint transmission and caching policy design for energy minimization in the wireless backhaul link. 1004-1008 - Radha Krishna Ganti
SIR asymptotics in general cellular network models. 1009-1013 - Zhengchuan Chen, Pingyi Fan
On the cooperation gain in 5g heterogeneous networking systems. 1014-1018 - Can Karakus, Suhas N. Diggavi:
Opportunistic scheduling for full-duplex uplink-downlink networks. 1019-1023
Tu-PM1-1: Index Coding
- Chandra Thapa
A new index coding scheme exploiting interlinked cycles. 1024-1028 - Anoop Thomas, B. Sundar Rajan:
Error correcting index codes and matroids. 1029-1033 - Fatemeh Arbabjolfaei, Young-Han Kim:
Structural properties of index coding capacity using fractional graph theory. 1034-1038 - Anoop Thomas, B. Sundar Rajan:
Vector linear error correcting index codes and discrete polymatroids. 1039-1043 - R. Kavitha, B. Sundar Rajan:
On the number of optimal index codes. 1044-1048
Tu-PM1-2: Degrees of Freedom in Networks
- Tang Liu, Daniela Tuninetti
On the DoF of two-user interference channel with an instantaneous relay. 1049-1053 - Hua Sun, Syed Ali Jafar
On the separability of GDoF region for parallel Gaussian TIN optimal interference networks. 1054-1058 - Sunghyun Kim, I-Hsiang Wang, Changho Suh
A relay can increase degrees of freedom in bursty mimo interference networks. 1059-1063 - Yao Wang, Mahesh K. Varanasi:
Degrees of freedom region of the MIMO two-transmit, two-receive network with General message sets. 1064-1068 - Jinyuan Chen, Andrea Goldsmith, Ayfer Özgür
Degrees of freedom of the MIMO interference channel with parallel multicasting. 1069-1073
Tu-PM1-3: Design of LDPC Codes
- Anatoly Khina
LDPC code ensembles that universally achieve capacity under BP decoding: A simple derivation. 1074-1078 - Madiagne Diouf, David Declercq, Samuel Ouya
A PEG-like LDPC code design avoiding short trapping sets. 1079-1083 - Shahrouz Sharifi, Ahmet Korhan Tanc
LDPC code design for binary-input binary-output Z interference channels. 1084-1088 - Fabian Steiner, Georg Böcherer, Gianluigi Liva:
Protograph-based LDPC code design for bit-metric decoding. 1089-1093 - Min Zhu, Yun Wei, Baoming Bai, Xiao Ma:
Nonbinary Kite codes: A family of nonbinary rate-compatible LDPC codes. 1094-1098
Tu-PM1-4: Quantum Codes
- Ryuhei Mori
Holographic transformation, belief propagation and loop calculus for generalized probabilistic theories. 1099-1103 - Markus Grassl
Quantum MDS codes over small fields. 1104-1108 - Arjun Bhagoji, Pradeep Kiran Sarvepalli
Equivalence of 2D color codes (without translational symmetry) to surface codes. 1109-1113 - Yuichiro Fujiwara:
Global stabilizer quantum error correction with combinatorial arrays. 1114-1118 - Martin Suchara
Leakage suppression in the toric code. 1119-1123
Tu-PM1-5: Energy Harvesting Communications
- Anshoo Tandon, Mehul Motani
Real-time simultaneous energy and information transfer. 1124-1128 - Omur Ozel, Sennur Ulukus, Pulkit Grover
Optimal scheduling for energy harvesting transmitters under temperature constraints. 1129-1133 - Jingxian Wu
Optimum sensing of a time-varying random event with energy harvesting power sources. 1134-1138 - Rajeev Gangula, Deniz Gündüz
Distributed compression and transmission with energy harvesting sensors. 1139-1143 - Hajar Mahdavi-Doost, Roy D. Yates:
Hybrid ARQ in block-fading channels with an energy harvesting receiver. 1144-1148
Tu-PM1-6: Wiretap Channel 1
- Wanyao Zhao, Ashish Khisti:
Gaussian wiretap channel with shared keys between transmitter and helpers. 1149-1153 - Germán Bassi
On the capacity of the wiretap channel with generalized feedback. 1154-1158 - Mohamed S. Nafea, Aylin Yener:
Wiretap channel II with a noisy main channel. 1159-1163 - Bikash Kumar Dey, Sidharth Jaggi
Sufficiently myopic adversaries are blind. 1164-1168 - Manoj Mishra, Bikash Kumar Dey, Vinod M. Prabhakaran, Suhas N. Diggavi:
On the oblivious transfer capacity of the degraded wiretapped binary erasure channel. 1169-1173
Tu-PM1-7: Information Theory and Statistics
- Varun S. Jog, Po-Ling Loh:
On model misspecification and KL separation for Gaussian graphical models. 1174-1178 - Mehdi Molkaraie:
An importance sampling scheme for models in a strong external field. 1179-1183 - Alaa Saade, Marc Lelarge, Florent Krzakala
Spectral detection in the censored block model. 1184-1188 - Matthew L. Malloy, Scott Alfeld, Paul Barford:
Contamination estimation via convex relaxations. 1189-1193 - Amir Sani, Alessandro Lazaric, Daniil Ryabko:
The replacement bootstrap for dependent data. 1194-1198
Tu-PM1-8: Pattern Recognition and Learning
- Daniil Ryabko, Boris Ryabko:
Predicting the outcomes of every process for which an asymptotically accurate stationary predictor exists is impossible. 1204-1206 - Michael Tschannen, Helmut Bölcskei:
Nonparametric nearest neighbor random process clustering. 1207-1211 - Thomas Wiatowski, Helmut Bölcskei:
Deep convolutional neural networks based on semi-discrete frames. 1212-1216 - Zhizhong Li
Determining step sizes in geometric optimization algorithms. 1217-1221
Tu-PM1-9: Massive MIMO 1
- Chuili Kong, Caijun Zhong
Effect of channel aging on the sum rate of uplink massive MIMO systems. 1222-1226 - Charles Jeon, Ramina Ghods
Optimality of large MIMO detection via approximate message passing. 1227-1231 - Ada S. Y. Poon, David N. C. Tse:
Does superdirectivity increase the degrees of freedom in wireless channels? 1232-1236 - Chao-Kai Wen, Shi Jin, Kai-Kit Wong, Chang-Jen Wang
Joint cHANNEL-AND-dATA estimation for large-MIMO systems with low-precision ADCs. 1237-1241 - Erdem Koyuncu
Interleaving training and limited feedback for point-to-point massive multiple-antenna systems. 1242-1246
Tu-PM2-1: Locally Repairable Codes 1
- Natalia Silberstein, Alexander Zeh:
Optimal binary locally repairable codes via anticodes. 1247-1251 - Alexander Barg, Itzhak Tamo, Serge G. Vladut:
Locally recoverable codes on algebraic curves. 1252-1256 - Birenjith Sasidharan
Codes with hierarchical locality. 1257-1261 - Itzhak Tamo, Alexander Barg, Sreechakra Goparaju, A. Robert Calderbank:
Cyclic LRC codes and their subfield subcodes. 1262-1266
Tu-PM2-2: Relay Networks 1
- Martina Cardone, Daniela Tuninetti
Gaussian MIMO half-duplex relay networks: Approximate optimality of simple schedules. 1267-1271 - Yanying Chen, Natasha Devroye:
On the optimality of Colour-and-Forward relaying for a class of zero-error primitive relay channels. 1272-1276 - Si-Hyeon Lee, Sae-Young Chung:
A unified approach for network information theory. 1277-1281 - Xiugang Wu, Liang-Liang Xie, Ayfer Özgür
Upper bounds on the capacity of symmetric primitive relay channels. 1282-1286
Tu-PM2-3: On Polarization and Polar Code Construction
- Narayanan Rengaswamy
Cyclic polar codes. 1287-1291 - Kasra Vakilinia, Dariush Divsalar, Richard D. Wesel:
RCA analysis of the polar codes and the use of feedback to aid polarization at short blocklengths. 1292-1296 - Ido Tal:
On the construction of polar codes for channels with moderate input alphabet sizes. 1297-1301
Tu-PM2-4: Coding for Memory and Distributed Storage
- Wael Halbawi, Matthew Thill, Babak Hassibi:
Coding with constraints: Minimum distance bounds and systematic constructions. 1302-1306 - Tadashi Wadayama, Taisuke Izumi, Hirotaka Ono
Subgraph domatic problem and writing capacity of memory devices with restricted state transitions. 1307-1311 - Tetsuya Kobayashi, Hiroyoshi Morita, Akiko Manada:
On rate tradeoffs for erasable write-once memory codes. 1312-1316 - Qi Cao, Ning Cai, Wangmei Guo:
Zero-error capacity of binary channels with 1-memory. 1317-1321
Tu-PM2-5: Information Theory for Biology 1
- Hans-Andrea Loeliger, Sarah Neff:
Pulse-domain signal parsing and neural computation. 1322-1326 - Nicolò Michelusi
Capacity of bacterial cables via Electron-transfer under full-CSI. 1327-1331 - Arash Einolghozati, Faramarz Fekri
Rate-distortion in molecular signal sensing with ligand receptors. 1332-1336 - Erik C. Johnson, Douglas L. Jones, Rama Ratnam
Minimum squared-error, energy-constrained encoding by adaptive threshold models of neurons. 1337-1341
Tu-PM2-6: Secrecy in Broadcast Channels 1
- Ziv Goldfeld, Gerhard Kramer
Cooperative broadcast channels with a secret message. 1342-1346 - Yanling Chen, Onur Ozan Koyluoglu, Aydin Sezgin
On the individual secrecy rate region for the broadcast channel with an external eavesdropper. 1347-1351 - Manoj Mishra, Tanmay Sharma, Bikash Kumar Dey, Vinod M. Prabhakaran:
Private data transfer over a broadcast channel. 1352-1356 - Shaofeng Zou, Yingbin Liang, Lifeng Lai, Shlomo Shamai
Rate splitting and sharing for degraded broadcast channel with secrecy outside a bounded range. 1357-1361
Tu-PM2-7: Estimation of Distributions and Their Functionals
- Yuichi Kaji:
Bounds on the entropy of multinomial distribution. 1362-1366 - Yanjun Han, Jiantao Jiao, Tsachy Weissman:
Does dirichlet prior smoothing solve the Shannon entropy estimation problem? 1367-1371 - Yanjun Han, Jiantao Jiao, Tsachy Weissman:
Adaptive estimation of Shannon entropy. 1372-1376 - Farzan Farnia
Minimum HGR correlation principle: From marginals to joint distribution. 1377-1381
Tu-PM2-8: Streaming and Zero-Delay Source Coding
- Richard G. Wood, Tamás Linder, Serdar Yüksel:
Optimality of Walrand-Varaiya type policies and approximation results for zero delay coding of Markov sources. 1382-1386 - Jhelum Chakravorty, Aditya Mahajan:
Distortion-transmission trade-off in real-time transmission of Gauss-Markov sources. 1387-1391 - Farrokh Etezadi, Ashish Khisti, Jun Chen:
Price of perfection: Limited prediction for streaming over erasure channels. 1392-1396 - Farrokh Etezadi, Ashish Khisti:
Delay-constrained streaming of Gauss-Markov sources over erasure channels. 1397-1401
Tu-PM2-9: Scheduling in Wireless Networks
- Matthew Johnston, Eytan H. Modiano:
Scheduling over time varying channels with hidden state information. 1402-1406 - Matthew Johnston, Eytan H. Modiano:
A new look at wireless scheduling with delayed information. 1407-1411 - Bo Zhou
Optimal dynamic multicast scheduling for cache-enabled content-centric wireless networks. 1412-1416 - Wenbo He, Chen Feng, Corina I. Ionita, Bobak Nazer:
Collision scheduling for cellular networks. 1417-1421
We-AM1-SP1: Semi-Plenary Session 2A
- Marco Mondelli
Unified scaling of polar codes: Error exponent, scaling exponent, moderate deviations, and error floors. 1422-1426 - Rajai Nasser, Emre Telatar:
Fourier analysis of MAC polarization. 1427-1431 - Mohammad Mahdi Mojahedian, Amin Gohari, Mohammad Reza Aref:
Perfectly secure index coding. 1432-1436 - Christopher G. Blake, Frank R. Kschischang
Scaling Rules for the Energy of Decoder Circuits. 1437-1441
We-AM1-SP2: Semi-Plenary Session 2B
- Bruce E. Hajek, Yihong Wu, Jiaming Xu:
Achieving exact cluster recovery threshold via semidefinite programming. 1442-1446 - Masahito Hayashi, Marco Tomamichel
Correlation detection and an operational interpretation of the Rényi mutual information. 1447-1451 - Hiroki Koga:
On a partition of a finite set and its relationships to encoding tasks and the Rényi entropy. 1452-1456 - Jingbo Liu, Paul Cuff, Sergio Verdú:
One-shot mutual covering lemma and Marton's inner bound with a common message. 1457-1461
We-AM2-1: Distributed Storage
- Netanel Raviv, Tuvi Etzion:
Distributed storage systems based on intersecting subspace codes. 1462-1466 - Swanand Kadhe
Analyzing the download time of availability codes. 1467-1471 - Salim El Rouayheb, Sreechakra Goparaju, Han Mao Kiah, Olgica Milenkovic:
Synchronizing edits in distributed storage networks. 1472-1476 - Ankit Singh Rawat
Batch codes through dense graphs without short cycles. 1477-1481 - Brijesh Kumar Rai
On adaptive distributed storage systems. 1482-1486
We-AM2-2: Interference Alignment 2
- Subhashini Krishnasamy, Urs Niesen, Piyush Gupta:
On the scaling of interference alignment under delay and power constraints. 1487-1491 - Marc Torrellas, Adrian Agustin
Retrospective Interference Alignment for the MIMO interference broadcast channel. 1492-1496 - Mohammad Ali Khojastepour, Mohammad Farajzadeh-Tehrani
A sufficient condition for interference alignment. 1497-1501 - Aly El Gamal, Navid Naderializadeh, Amir Salman Avestimehr:
When does an ensemble of matrices with randomly scaled rows lose rank? 1502-1506 - Muryong Kim, Sriram Vishwanath:
Layered lattice coding for the symmetric Gaussian X channel. 1507-1511
We-AM2-3: Applications of Polar Codes
- Remi A. Chou
Polar coding for empirical and strong coordination via distribution approximation. 1512-1516 - Runxin Wang, Junya Honda, Hirosuke Yamamoto
FV polar coding for lossy compression with an improved exponent. 1517-1521 - Salman Salamatian, Muriel Médard, Emre Telatar:
A Successive Description property of Monotone-Chain Polar Codes for Slepian-Wolf coding. 1522-1526 - David Burshtein:
Coding for asymmetric side information channels with applications to polar codes. 1527-1531 - Lele Wang:
Polar coding for relay channels. 1532-1536
We-AM2-4: Construction of Sequences
- Ki-Hyeon Park, Hong-Yeop Song, Dae San Kim:
Families of perfect polyphase sequences from the array structure of Fermat-Quotient sequences and Frank-Zadoff sequences. 1537-1540 - Serdar Boztas
A generalized construction for perfect autocorrelation sequences. 1541-1545 - Jin-Ho Chung, Kyeongcheol Yang:
Three new families of optimal variable-weight optical orthogonal codes. 1546-1550 - Yang Yang, Xiaohu Tang, Zhengchun Zhou
Binary sequences with optimal odd periodic autocorrelation. 1551-1554 - Yang Yang, Xiaohu Tang, Zhengchun Zhou
Binary signature set with optimal odd periodic total squared correlation. 1555-1559
We-AM2-5: Multi-Terminal Source Coding 1
- Neri Merhav:
Statistical physics of random binning. 1560-1564 - Nir Weinberger, Neri Merhav:
Optimum trade-offs between error exponent and excess-rate exponent of Slepian-Wolf coding. 1565-1569 - Tomohiko Uyematsu, Tetsunao Matsuta:
Source coding with side information at the decoder revisited. 1570-1574 - Yasutada Oohama:
Exponent function for one helper source coding problem at rates outside the rate region. 1575-1579 - Farhad Shirani Chaharsooghi
New lattice codes for multiple-descriptions. 1580-1584
We-AM2-6: Security in Various Settings
- Annina Bracher, Eran Hof, Amos Lapidoth:
Guessing Attacks on Distributed-Storage Systems. 1585-1589 - Hugues Mercier, Maxime Augier, Arjen K. Lenstra:
STEP-archival: Storage integrity and anti-tampering using data entanglement. 1590-1594 - Marcel Fernandez, Grigory Kabatiansky, José Moreira:
Almost IPP-codes or provably secure digital fingerprinting codes. 1595-1599 - V. Sriram Siddhardh Nadendla
Information-dispersal games for security in cognitive-radio networks. 1600-1604 - Maggie Mhanna, Pablo Piantanida:
On secure distributed hypothesis testing. 1605-1609
We-AM2-7: Information Measures and Statistics
- Igal Sason:
On the Rényi divergence and the joint range of relative entropies. 1610-1614 - Josep Font-Segura
Sphericity minimum description length: Asymptotic performance under unknown noise variance. 1615-1619 - Mehrdad Khatami
Symmetric information rate estimation and bit aspect ratio optimization for TDMR using Generalized Belief Propagation. 1620-1624 - Jae Oh Woo, Mokshay M. Madiman:
A discrete entropy power inequality for uniform distributions. 1625-1629 - Dmitri S. Pavlichin:
Nearest symmetric distributions. 1630-1634
We-AM2-8: Compressed Sensing and Sparsity
- Thibault Lesieur, Florent Krzakala
Phase transitions in sparse PCA. 1635-1639 - Sundeep Rangan, Alyson K. Fletcher, Philip Schniter, Ulugbek S. Kamilov:
Inference for Generalized Linear Models via alternating directions and Bethe Free Energy minimization. 1640-1644 - Xiao Li, Sameer Pawar, Kannan Ramchandran:
Sub-linear time compressed sensing using sparse-graph codes. 1645-1649 - Ruiyang Song, Yao Xie, Sebastian Pokutta:
Sequential sensing with model mismatch. 1650-1654 - Kishore Jaganathan, Yonina C. Eldar, Babak Hassibi:
Phase retrieval with masks using convex optimization. 1655-1659
We-AM2-9: Optical Communication and Networking
- Qun Zhang, Terence H. Chan
A spectral domain noise model for optical fibre channels. 1660-1664 - Si-Hui Tan
Finite codelength analysis of the sequential waveform nulling receiver for M-ary PSK. 1665-1670 - Yan-Yu Zhang
Full large-scale diversity space codes for MIMO optical wireless communications. 1671-1675 - Sander Wahls
Fast inverse nonlinear Fourier transform for generating multi-solitons in optical fiber. 1676-1680 - Longbo Huang, Eytan H. Modiano:
Optimizing age-of-information in a multi-class queueing system. 1681-1685
Th-AM1-1: Coded Caching
- Jinbei Zhang, Xiaojun Lin, Chih-Chun Wang, Xinbing Wang:
Coded caching for files with distinct file sizes. 1686-1690 - Avik Sengupta, Ravi Tandon, T. Charles Clancy:
Improved approximation of storage-rate tradeoff for caching via new outer bounds. 1691-1695 - Hooshang Ghasemi, Aditya Ramamoorthy:
Improved lower bounds for coded caching. 1696-1700 - Jad Hachem, Nikhil Karamchandani, Suhas N. Diggavi:
Effect of number of users in multi-level coded caching. 1701-1705
Th-AM1-2: Treating Interference as Noise
- Chunhua Geng, Syed Ali Jafar
On the optimality of treating interference as noise for K-user compound interference channels. 1706-1710 - Shuo Li, Yu-Chih Huang
On the limits of treating interference as noise for two-user symmetric Gaussian interference channels. 1711-1715 - Alex Dytso
i.i.d. mixed inputs and treating interference as noise are gDoF optimal for the symmetric Gaussian two-user interference channel. 1716-1720 - Xinping Yi, Giuseppe Caire:
On the optimality of treating interference as noise: A combinatorial optimization perspective. 1721-1725
Th-AM1-3: Coding for Flash Memory 1
- Faruk Göloglu
New bounds for permutation codes in Ulam metric. 1726-1730 - Moshe Schwartz
Bounds on the size of balls over permutations with the infinity metric. 1731-1735 - Sarit Buzaglo, Paul H. Siegel, Eitan Yaakobi:
Coding schemes for inter-cell interference in flash memory. 1736-1740 - Yeow Meng Chee
Permutation codes correcting a single burst deletion I: Unstable deletions. 1741-1745
Th-AM1-4: Analysis of Coding Systems
- Stanislav Krajci, Chin-Fu Liu, Ladislav Mikes, Stefan M. Moser:
Performance analysis of Fano coding. 1746-1750 - Po-Ning Chen
Nonlinear codes outperform the best linear codes on the binary erasure channel. 1751-1755 - Jia Liu, Xiao Ma:
Improved Hamming sphere bounds on the MLD performance of binary linear codes. 1756-1760 - Jun Yang, Fady Alajaji, Glen Takahara:
On bounding the union probability. 1761-1765
Th-AM1-5: Multi-Terminal Source Coding 2
- Shigeaki Kuzuoka, Shun Watanabe
A dichotomy of functions in distributed coding: An information spectral approach. 1766-1770 - Leonardo Rey Vega
On the rate-distortion regions for interactive source coding. 1771-1775 - Chien-Yi Wang, Sung Hoon Lim
Information-theoretic caching. 1776-1780 - Yinfei Xu, Jun Chen, Qiao Wang:
On the sum rate of multiple description coding with tree-structured distortion constraints. 1781-1785
Th-AM1-6: Privacy
- Masahito Hayashi, Toyohiro Tsurumaru:
More efficient privacy amplification with less random seeds. 1786-1790 - Kittipong Kittichokechai, Giuseppe Caire:
Secret key-based authentication with a privacy constraint. 1791-1795 - Flávio P. Calmon, Ali Makhdoumi, Muriel Médard:
Fundamental limits of perfect privacy. 1796-1800 - Murat A. Erdogdu, Nadia Fawaz
Privacy-utility trade-off under continual observation. 1801-1805
Th-AM1-7: Finite Blocklength Analysis 2
- Himanshu Tyagi, Pramod Viswanath, Shun Watanabe
Interactive communication for data exchange. 1806-1810 - Tetsunao Matsuta, Tomohiko Uyematsu:
Non-asymptotic bounds for fixed-length lossy compression. 1811-1815 - Yucel Altug, H. Vincent Poor
On fixed-length channel coding with feedback in the moderate deviations regime. 1816-1820 - Masahito Hayashi, Vincent Yan Fu Tan:
Erasure and undetected error probabilities in the moderate deviations regime. 1821-1825
Th-AM1-8: Matrix Completion
- Brian Lois, Namrata Vaswani:
Online matrix completion and online robust PCA. 1826-1830 - Yuanming Shi, Jun Zhang, Khaled Ben Letaief:
Low-rank matrix completion via Riemannian pursuit for topological interference management. 1831-1835 - Erwin Riegler, David Stotz, Helmut Bölcskei:
Information-theoretic limits of matrix completion. 1836-1840 - Yang Cao, Yao Xie:
Poisson matrix completion. 1841-1845
Th-AM1-9: Cognitive Communication and Sensor Networks
- Diana Maamari, Daniela Tuninetti
On the sum-capacity of the cognitive interference channel with cognitive-only message sharing. 1846-1850 - Osama Amin
Outage performance of cognitive radio systems with Improper Gaussian signaling. 1851-1855 - Sang-Woon Jeon, Bang Chul Jung
Opportunistic in-network computation for wireless sensor networks. 1856-1860 - Jing Yue, Zihuai Lin
Design and performance analysis of network code division multiplexing for wireless sensor networks. 1861-1865
Th-AM2-1: Locally Repairable Codes 2
- Anyu Wang
Achieving arbitrary locality and availability in binary codes. 1866-1870 - Pengfei Huang, Eitan Yaakobi, Hironori Uchikawa, Paul H. Siegel:
Linear locally repairable codes with availability. 1871-1875 - Junyu Chen, Kenneth W. Shum, Quan Yu, Chi Wan Sung:
Sector-disk codes and partial MDS codes with up to three global parities. 1876-1880 - Balaji Srinivasan Babu, P. Vijay Kumar:
On partial maximally-recoverable and maximally-recoverable codes. 1881-1885
Th-AM2-2: Multiway Relay Channels
- Lawrence Ong
Capacity results for the multi-way relay channel with common messages. 1886-1890 - Lawrence Ong
The half-duplex Gaussian two-way relay channel with direct links. 1891-1895 - Mehdi Ashraphijuo, Vaneet Aggarwal
Capacity of two-way linear deterministic diamond channel. 1896-1900 - Shih-Chun Lin, I-Hsiang Wang:
On two-pair two-way relay channel with an intermittently available relay. 1901-1905
Th-AM2-3: LDPC Code Encoding and Analysis
- Chu-Hsiang Huang, Yao Li, Lara Dolecek:
Adaptive error correction coding scheme for computations in the noisy min-sum decoder. 1906-1910 - Takayuki Nozaki
Parallel encoding algorithm for LDPC codes based on block-diagonalization. 1911-1915 - Pavel Panteleev:
Fast systematic encoding of quasi-cyclic codes using the Chinese remainder theorem. 1916-1920 - Jossy Sayir
An investigation of SUDOKU-inspired non-linear codes with local constraints. 1921-1925
Th-AM2-4: Combinatorial Coding Theory
- Louay Bazzi:
Weight distribution of cosets of small codes with good dual properties. 1926-1930 - Yeow Meng Chee
Spectrum of sizes for perfect burst deletion-correcting codes. 1931-1935 - Michael Langberg, Moshe Schwartz
Coding for the ℓ∞-limited permutation channel. 1936-1940 - Son Hoang Dau
Weakly secure MDS codes for simple multiple access networks. 1941-1945
Th-AM2-5: Information Theory for Biology 2
- Siddharth Jain, Farzad Farnoud, Jehoshua Bruck
Capacity and expressiveness of genomic tandem duplication. 1946-1950 - Gholamali Aminian, Mahtab Mirmohseni, Masoumeh Nasiri-Kenari, Faramarz Fekri
On the capacity of level and type modulations in Molecular communication with ligand receptors. 1951-1955 - Hessam Mahdavifar, Ahmad Beirami:
Diffusion channel with Poisson reception process: capacity results and applications. 1956-1960 - Toby Berger, Mustafa Sungkar:
Design of efficient channels with given input statistics. 1961-1965
Th-AM2-6: Secrecy in Broadcast Channels 2
- Pritam Mukherjee, Ravi Tandon, Sennur Ulukus:
Secrecy for MISO broadcast channels with heterogeneous CSIT. 1966-1970 - Rafael F. Schaefer, Ashish Khisti, H. Vincent Poor
How to use independent secret keys for secure broadcasting of common messages. 1971-1975 - Sheng Yang, Mari Kobayashi:
Secure communication in K-user multi-antenna broadcast channel with state feedback. 1976-1980 - Anatoly Khina
The confidential MIMO broadcast capacity: A simple derivation. 1981-1985
Th-AM2-7: Universal Source Coding
- Shota Saito
Fundamental limit and pointwise asymptotics of the Bayes code for Markov sources. 1986-1990 - Ayush Jain, Rakesh Kumar Bansal:
On redundancy rate of FDLZ algorithm and its variants. 1991-1995 - Nematollah Iri, Oliver Kosut:
Third-order coding rate for universal compression of Markov sources. 1996-2000 - Moein Falahatgar, Ashkan Jafarpour, Alon Orlitsky, Venkatadheeraj Pichapati, Ananda Theertha Suresh:
Universal compression of power-law distributions. 2001-2005
Th-AM2-8: Topics in Compressed Sensing
- Ayaka Sakata
Replica symmetric bound for restricted isometry constant. 2006-2010 - Zai Yang
Generalized Vandermonde decomposition and its use for multi-dimensional super-resolution. 2011-2015 - Cynthia Rush
Capacity-achieving Sparse Regression Codes via approximate message passing decoding. 2016-2020 - Christos Thrampoulidis, Ashkan Panahi
Asymptotically exact error analysis for the generalized equation-LASSO. 2021-2025
Th-AM2-9: Cooperative Communication
- Hsiao-feng Lu:
Optimal distributed codes with delay four and constant decoding complexity. 2026-2030 - Bin Qian, Wai Ho Mow:
A Markov error modeling approach to distributed turbo coding. 2031-2035 - Paul de Kerret, David Gesbert
Regularized ZF in cooperative broadcast channels under distributed CSIT: A large system analysis. 2036-2040 - Muhammed Faruk Gencel, Maryam Eslami Rasekh, Upamanyu Madhow:
Distributed transmit beamforming with one bit feedback revisited: How noise limits scaling. 2041-2045
Th-PM1-1: Regenerating Codes 2
- Natalia Silberstein, Tuvi Etzion:
Optimal fractional repetition codes and fractional repetition batch codes. 2046-2050 - Birenjith Sasidharan
A high-rate MSR code with polynomial sub-packetization level. 2051-2055 - Soheil Mohajer, Ravi Tandon:
New bounds on the (n, k, d) storage systems with exact repair. 2056-2060 - Mehran Elyasi, Soheil Mohajer, Ravi Tandon:
Linear exact repair rate region of (k + 1, k, k) distributed storage systems: A new approach. 2061-2065
Th-PM1-2: Structured Codes
- Jingge Zhu
On lattice codes for Gaussian interference channels. 2066-2070 - Arun Padakandla, S. Sandeep Pradhan:
Coset codes for communicating over non-additive channels. 2071-2075 - Anne Savard
Lattice coding for the Gaussian one- and two-way relay channels with correlated noises. 2076-2080 - Mohsen Heidari, Farhad Shirani Chaharsooghi
Beyond group capacity in multi-terminal communications. 2081-2085
Th-PM1-3: Coding for Flash Memory 2
- Evyatar Hemo, Yuval Cassuto:
A constraint scheme for correcting massive asymmetric magnitude-1 errors in multi-level NVMs. 2086-2090 - Eitan Yaakobi, Alexander Yucovich, Gal Maor, Gala Yadgar
When do WOM codes improve the erasure factor in flash memories? 2091-2095 - Frederic Sala, Clayton Schoeny, Dariush Divsalar, Lara Dolecek:
Asymmetric error-correcting codes for Flash memories in high-radiation environments. 2096-2100 - Clayton Schoeny, Frederic Sala, Lara Dolecek:
Analysis and coding schemes for the flash normal-laplace mixture channel. 2101-2105
Th-PM1-4: Applications of Coding Theory
- Guanghui Song, Jun Cheng:
Low-complexity coding scheme to approach multiple-access channel capacity. 2106-2110 - Rana Ali Amjad, Gerhard Kramer
Channel resolvability codes based on concatenation and sparse linear encoding. 2111-2115 - Jayadev Acharya, Clément L. Canonne, Gautam Kamath
Adaptive estimation in weighted group testing. 2116-2120 - Mina Karzand, Lav R. Varshney:
Communication strategies for low-latency trading. 2121-2125
Th-PM1-5: Topics in Network Information Theory
- Meryem Benammar, Pablo Piantanida, Shlomo Shamai
On Multiple Description coding for the Multicast Cognitive Interference Channel. 2126-2130 - Matías Vera, Leonardo Rey Vega
The two-way cooperative Information Bottleneck. 2131-2135 - Louis Tan, Kaveh Mahdaviani, Ashish Khisti, Emina Soljanin
Coding for source-broadcasting over erasure channels with feedback. 2136-2140 - Mainak Chowdhury, Alon Kipnis
Reliable uncoded communication in the quantized SIMO MAC. 2141-2145
Th-PM1-6: Fading and Arbitrarily Varying Wiretap Channel
- Moritz Wiese, Janis Noetzel, Holger Boche:
The arbitrarily varying wiretap channel - communication under uncoordinated attacks. 2146-2150 - Janis Noetzel, Moritz Wiese, Holger Boche:
The arbitrarily varying wiretap channel - secret randomness, stability and super-activation. 2151-2155 - Marwen Zorgui
Secret-key agreement over spatially correlated fast-fading multiple-antenna channels with public discussion. 2156-2160 - Hongbo Si, Onur Ozan Koyluoglu, Sriram Vishwanath:
Achieving secrecy without any instantaneous CSI: polar coding for fading wiretap channels. 2161-2165
Th-PM1-7: Lossy Source Coding
- Albert No, Tsachy Weissman:
Universality of logarithmic loss in lossy compression. 2166-2170 - Badri N. Vellambi
Lossless and lossy source compression with near-uniform output: Is common randomness always required? 2171-2175 - Basak Guler, Ebrahim MolavianJazi, Aylin Yener:
Remote source coding with two-sided information. 2176-2180 - Hideki Yagi, Ryo Nomura
Variable-length coding with epsilon-fidelity criteria for general sources. 2181-2185
Th-PM1-8: Dictionary Learning and Subspace Classification
- Haroon Raja, Waheed U. Bajwa:
A convergence analysis of distributed dictionary learning based on the K-SVD algorithm. 2186-2190 - Daniel L. Pimentel-Alarcón, Nigel Boston, Robert D. Nowak:
Deterministic conditions for subspace identifiability from incomplete sampling. 2191-2195 - Hailong Shi, Hao Zhang, Xiqin Wang:
A volume correlation subspace detector for signals buried in unknown clutter. 2196-2200 - Jure Sokolic, Francesco Renna
Mismatch in the classification of linear subspaces: Upper bound to the probability of error. 2201-2205
Th-PM1-9: Topics in Game Theory & Control
- Husheng Li:
Entropy reduction via communications in cyber physical systems: How to feed maxwell's demon? 2206-2210 - Arnob Ghosh, Saswati Sarkar:
Pricing for profit in internet of things. 2211-2215 - Faisal Alotaibi
A game theoretic approach to content trading in proactive wireless networks. 2216-2220 - Gireeja Ranade, Anant Sahai:
Control capacity. 2221-2225
Th-PM2-1: List Decoding 2
- Nir Weinberger, Neri Merhav:
Simplified erasure/list decoding. 2226-2230 - Yury Polyanskiy:
Upper bound on list-decoding radius of binary codes. 2231-2235 - Arkady G. D'yachkov, Ilya V. Vorobyev
Symmetric disjunctive list-decoding codes. 2236-2240
Th-PM2-2: Gaussian Relay Networks
- Yuhan Zhou, Yinfei Xu, Jun Chen, Wei Yu:
Optimality of gaussian fronthaul compression for uplink MIMO cloud radio access networks. 2241-2245 - Song-Nam Hong
On the achievable rates of multihop virtual full-duplex relay channels. 2246-2250 - Thomas A. Courtade, Ayfer Özgür
Approximate capacity of Gaussian relay networks: Is a sublinear gap to the cutset bound plausible? 2251-2255
Th-PM2-3: On the Ising Model
- Artyom Sharov, Ron M. Roth:
On the capacity of generalized Ising channels. 2256-2260 - Chun Lam Chan, Mahdi Jafari Siavoshani, Sidharth Jaggi, Navin Kashyap, Pascal O. Vontobel:
Generalized belief propagation for estimating the partition function of the 2D Ising model. 2261-2265 - Ali Al-Bashabsheh, Pascal O. Vontobel:
The ising model: Kramers-Wannier duality and normal factor graphs. 2266-2270
Th-PM2-4: Streaming
- Rafid Mahmood, Ahmed Badr, Ashish Khisti:
Convolutional codes with maximum column sum rank for network streaming. 2271-2275 - Ahmed Badr, Rafid Mahmood, Ashish Khisti:
Embedded MDS codes for multicast streaming. 2276-2280 - Kaveh Mahdaviani, Ashish Khisti, Gauri Joshi, Gregory W. Wornell:
Playback delay in on-demand streaming communication with feedback. 2281-2285
Th-PM2-5: Estimation of Distributions and Dirty Paper Coding
- Stefano Rini, Shlomo Shamai
On the dirty paper channel with fast fading dirt. 2286-2290 - Yanjun Han, Jiantao Jiao, Tsachy Weissman:
Minimax estimation of discrete distributions. 2291-2295 - Jiantao Jiao, Kartik Venkat, Yanjun Han, Tsachy Weissman:
Minimax estimation of information measures. 2296-2300
Th-PM2-6: Wiretap Channel 2
- Dajiang Chen, Shaoquan Jiang, Zhiguang Qin:
Message Authentication Code over a wiretap channel. 2301-2305 - Wei Kang, Nan Liu:
A permutation-based code for the wiretap channel. 2306-2310 - Pritam Mukherjee, Sennur Ulukus:
Secure degrees of freedom of the multiple access wiretap channel with no eavesdropper CSI. 2311-2315
Th-PM2-7: Capacity Bounds
- Radha Krishna Ganti
Approximation of capacity for ISI channels with one-bit output quantization. 2316-2320 - Andrew Thangaraj, Gerhard Kramer
Capacity upper bounds for discrete-time amplitude-constrained AWGN channels. 2321-2325 - Luca Barletta, Gerhard Kramer
Lower bound on the capacity of continuous-time Wiener phase noise channels. 2326-2330
Th-PM2-8: Information-Theoretic Approaches to Compressed Sensing
- Jonathan Scarlett, Volkan Cevher
Limits on support recovery with probabilistic models: An information-theoretic framework. 2331-2335 - Yuxin Chen, Changho Suh
Information recovery from pairwise measurements: A shannon-theoretic approach. 2336-2340 - Liming Wang, Jiaji Huang, Xin Yuan
A concentration-of-measure inequality for multiple-measurement models. 2341-2345
Th-PM2-9: Fading Channels 2
- Lu Wei:
Ergodic capacity of spatially correlated multi-cluster scattering MIMO channels. 2346-2350 - Felipe Gómez-Cuba
Bandwidth occupancy of non-coherent wideband fading channels. 2351-2355 - Maice Costa, Stefan Valentin, Anthony Ephremides:
On the age of Channel State Information for non-reciprocal wireless links. 2356-2360
Fr-AM1-SP1: Semi-Plenary Session 3A
- Adiseshu Hari, Urs Niesen, Gordon T. Wilfong:
Optimal path encoding for software-defined networks. 2361-2365 - Or Ordentlich, Ofer Shayevitz:
A VC-dimension-based outer bound on the zero-error capacity of the binary adder channel. 2366-2370 - David T. H. Kao, Mohammad Ali Maddah-Ali, Amir Salman Avestimehr:
Blind index coding. 2371-2375
Fr-AM1-SP2: Semi-Plenary Session 3b
- Aolin Xu, Maxim Raginsky:
Converses for distributed estimation via strong data processing inequalities. 2376-2380 - Salman Beigi, Amin Gohari
On the duality of additivity and tensorization. 2381-2385 - Marco Tomamichel
Strong converse rates for quantum communication. 2386-2390
Fr-AM2-1: Algebraic Codes
- Jiyou Li, Daqing Wan, Jun Zhang:
On the minimum distance of elliptic curve codes. 2391-2395 - Jiun-Hung Yu
Decoding of interleaved Reed-Solomon codes via simultaneous partial inverses. 2396-2400 - Daniel Augot, Françoise Levy-dit-Vehel, Man Cuong Ngô
Information sets of Multiplicity codes. 2401-2405 - Haiyang Liu, Daeyeoul Kim, Yang Li
On the separating redundancy of extended Hamming codes. 2406-2410 - Wei Zhou, Shu Lin
On the maximum true burst correcting capability of primitive Fire codes. 2411-2415
Fr-AM2-2: Interference Channels and Networks
- Chandra Nair, Lingxiao Xia, Mehdi Yazdanpanah:
Sub-optimality of Han-Kobayashi achievable region for interference channels. 2416-2420 - Alireza Vahid, A. Robert Calderbank:
Impact of local delayed CSIT on the capacity region of the two-user interference channel. 2421-2425 - Paula Aquilina, Tharmalingam Ratnarajah:
Topological interference management for interference broadcast channels with alternating connectivity. 2426-2430 - Meghana Bande, Aly El Gamal, Venugopal V. Veeravalli:
Flexible backhaul design with cooperative transmission in cellular interference networks. 2431-2435 - Ehsan Ebrahimzadeh, Kamyar Moshksar, Amir K. Khandani:
Outage analysis for two-user parallel Gaussian interference channels. 2436-2440
Fr-AM2-3: Polarization Theory
- Erdal Arikan:
A packing lemma for polar codes. 2441-2445 - Joseph M. Renes
Alignment of polarized sets. 2446-2450 - Rajai Nasser:
Ergodic theory meets polarization I: A foundation of polarization theory. 2451-2455 - Rajai Nasser:
Ergodic theory meets polarization II: A foundation of polarization theory for MACs. 2456-2460 - Emmanuel Abbe, Yuval Wigderson:
High-Girth matrices and polarization. 2461-2465
Fr-AM2-4: Lattice Codes 2
- Anne-Maria Ernvall-Hytönen, B. A. Sethuraman:
Counterexample to the generalized belfiore-solé secrecy function conjecture for l-modular lattices. 2466-2469 - Zheng Wang, Cong Ling:
Independent Metropolis-Hastings-Klein algorithm for lattice Gaussian sampling. 2470-2474 - Parisa Babaheidarian, Somayeh Salimi:
Compute-and-forward can buy secrecy cheap. 2475-2479 - Hiroyoshi Morita:
Nearest-neighbor error correcting codes on a hexagonal signal constellation. 2480-2484 - Yu-Chih Huang
Lattice index codes from algebraic number fields. 2485-2489
Fr-AM2-5: Feedback
- Lars Palzer:
Signaling over the Gaussian channel with intermittent feedback. 2490-2494 - Annina Bracher, Michèle A. Wigger:
Feedback and partial message side-information on the semideterministic broadcast channel. 2495-2499 - Assaf Ben-Yishai, Ofer Shayevitz:
The Gaussian channel with noisy feedback: improving reliability via interaction. 2500-2504 - Kasper Fløe Trillingsgaard, Wei Yang, Giuseppe Durisi
Broadcasting a common message with variable-length stop-feedback codes. 2505-2509 - Yasutada Oohama:
Strong converse theorems for degraded broadcast channels with feedback. 2510-2514
Fr-AM2-6: Security and Channels
- Saurabh Shintre, Virgil D. Gligor, João Barros:
Optimal strategies for side-channel leakage in FCFS packet schedulers. 2515-2519 - Eva C. Song, Paul W. Cuff, H. Vincent Poor
Joint source-channel secrecy using hybrid coding. 2520-2524 - Ligong Wang, Gregory W. Wornell, Lizhong Zheng:
Limits of low-probability-of-detection communication over a discrete memoryless channel. 2525-2529 - Qiaosheng Eric Zhang
Coding against a limited-view adversary: The effect of causality and feedback. 2530-2534 - Matthieu R. Bloch:
A channel resolvability perspective on stealth communications. 2535-2539
Fr-AM2-7: Topics in Shannon Theory 3
- Amos Lapidoth, Christoph Pfister:
A method for the construction of optimal task encoders. 2540-2544 - Silas L. Fong
Strong converse theorems for classes of multimessage multicast networks: A Rényi divergence approach. 2545-2549 - Sudeep Kamath, Chandra Nair:
The strong data processing constant for sums of i.i.d. random variables. 2550-2552 - Shuhang Wu, Shuangqing Wei, Yue Wang, Ramachandran Vaidyanathan, Jian Yuan, Xiqin Wang:
Detection of graph structures via communications over a multiaccess Boolean channel. 2553-2557 - Flávio P. Calmon, Yury Polyanskiy, Yihong Wu:
Strong data processing inequalities in power-constrained Gaussian channels. 2558-2562
Fr-AM2-8: Applications of Compressed Sensing 2
- Jaeseok Lee, Byonghyo Shim
Greedy tree search for Internet of Things signal detection. 2563-2567 - Céline Aubel, Helmut Bölcskei:
Density criteria for the identification of linear time-varying systems. 2568-2572 - Xu Chen, Dongning Guo:
Robust sublinear complexity Walsh-Hadamard transform with arbitrary sparse support. 2573-2577 - Zeinab Zeinalkhani, Amir H. Banihashemi:
Low-complexity detection of zero blocks in wideband spectrum sensing. 2578-2582 - Dong Yin, Kangwook Lee, Ramtin Pedarsani, Kannan Ramchandran:
Fast and robust compressive phase retrieval with sparse-graph codes. 2583-2587
Fr-AM2-9: Massive MIMO 2
- Qurrat-Ul-Ain Nadeem
On the mutual information of 3D massive MIMO systems: An asymptotic approach. 2588-2592 - Zhong Zheng, Lu Wei, Roland Speicher, Ralf R. Müller, Jyri Hämäläinen, Jukka Corander:
On the finite-SNR Diversity-Multiplexing Tradeoff in large Rayleigh product channels. 2593-2597 - Zhanzhan Zhang, Zhiyong Chen, Manyuan Shen, Bin Xia, Ling Luo:
Achievable rate analysis for multi-pair two-way massive MIMO full-duplex relay systems. 2598-2602 - Sudip Biswas, Jiang Xue, Faheem Ahmad Khan
On the capacity of correlated massive MIMO systems using stochastic geometry. 2603-2607 - Hong Yang, Thomas L. Marzetta:
On existence of power controls for Massive MIMO. 2608-2612
Fr-PM1-1: Topics in Network Coding 2
- Nitzan Adler, Yuval Cassuto:
Low-delay erasure-correcting codes with optimal average delay. 2613-2617 - Ni Ding
Estimating minimum sum-rate for cooperative data exchange. 2618-2622 - Wentao Huang, Ting Wang, Xin Hu, Jiyong Jang, Theodoros Salonidis:
Rateless and pollution-attack-resilient network coding. 2623-2627 - Mark Shifrin
Coded retransmission in wireless networks via abstract MDPs: Theory and algorithms. 2628-2632 - Qifu Tyler Sun, Xiaolong Yang, Keping Long, Zongpeng Li:
Constructing multicast networks where vector linear coding outperforms scalar linear coding. 2633-2637
Fr-PM1-2: Broadcast and Multiple Access
- Lóránt Farkas, Tamás Kói
Controlled asynchronism improves error exponent. 2638-2642 - Rick Fritschek, Gerhard Wunder:
Constant-gap sum-capacity approximation of the deterministic interfering multiple access channel. 2643-2647 - Jaemin Han, Chih-Chun Wang:
General capacity region for the fully-connected 3-node packet erasure network. 2648-2652 - Yossef Steinberg
Instances of the relay-broadcast channel and cooperation strategies. 2653-2657 - Henry P. Romero, Mahesh K. Varanasi:
Polymatroidal structure in the multiple access channel with general message sets. 2658-2662
Fr-PM1-3: Decoding of LDPC Codes
- Xishuo Liu, Stark C. Draper
ADMM decoding on trapping sets. 2663-2667 - Ahmed A. Emran, Maha Elsabrouty, Osamu Muta, Hiroshi Furukawa:
Optimized quantization and scaling of layered LDPC scaled min-sum decoder. 2668-2672 - Alexey A. Frolov
On the multiple threshold decoding of LDPC codes over GF(q). 2673-2677 - Saeid Haghighatshoar, Amin Karbasi, Amir Hesam Salavati:
Asynchronous decoding of LDPC codes over BEC. 2678-2682 - Pablo M. Olmos, David G. M. Mitchell
Analyzing the finite-length performance of generalized LDPC codes. 2683-2687
Fr-PM1-4: Sequences
- Qichun Wang, Chik How Tan:
New bounds on the imbalance of a half-l-sequence. 2688-2691 - Zi Long Liu
Optimal spectrally-constrained sequences. 2692-2696 - Domingo Gómez-Pérez
Linear complexity for multidimensional arrays - a numerical invariant. 2697-2701 - Frederic Sala, Ryan Gabrys, Clayton Schoeny, Lara Dolecek:
Three novel combinatorial theorems for the insertion/deletion channel. 2702-2706 - Serdar Boztas
Correlation distribution of a new sequence family. 2707-2711
Fr-PM1-5: Energy Harvesting in Fading and Multiuser Channels
- Zhe Wang, Xiaodong Wang, Vaneet Aggarwal
Energy-subchannel allocation for energy harvesting nodes in frequency-selective channels. 2712-2716 - Zhe Wang, Vaneet Aggarwal
Energy-bandwidth allocation in multiple orthogonal broadcast channels with energy harvesting. 2717-2721 - Omur Ozel, Kaya Tutuncuoglu, Sennur Ulukus, Aylin Yener:
The binary energy harvesting channel with on-off fading. 2722-2726 - Jing Yang, Jingxian Wu
Online throughput maximization in an energy harvesting multiple access channel with fading. 2727-2731 - Berk Gurakan, Sennur Ulukus:
Energy harvesting cooperative diamond channel. 2732-2736
Fr-PM1-6: Cryptography and Secure Computing
- Deepesh Data, Vinod M. Prabhakaran:
On coding for secure computing. 2737-2741 - Himanshu Tyagi, Shun Watanabe
Impossibility bounds for secure computing. 2742-2746 - Adrien Hauteville, Jean-Pierre Tillich:
New algorithms for decoding in the rank metric and an attack on the LRPC cryptosystem. 2747-2751 - Simona Samardjiska, Danilo Gligoroski:
Approaching maximum embedding efficiency on small covers using Staircase-Generator codes. 2752-2756 - Ahmad Beirami, A. Robert Calderbank, Ken R. Duffy
Quantifying computational security subject to source constraints, guesswork and inscrutability. 2757-2761
Fr-PM1-7: Quantum Shannon Theory
- Min-Hsiu Hsieh
Source compression with a quantum helper. 2762-2766 - David Sutter
Approximate degradable quantum channels. 2767-2771 - Nilanjana Datta, Marco Tomamichel
Second-order coding rates for entanglement-assisted communication. 2772-2776 - Cyril J. Stark, Aram W. Harrow
Compressibility of positive semidefinite factorizations and quantum models. 2777-2781 - Christoph Hirche
An improved rate region for the classical-quantum broadcast channel. 2782-2786
Fr-PM1-8: Message Passing and Hypothesis Testing
- Tadashi Wadayama, Taisuke Izumi, Kazushi Mimura:
Bitwise MAP estimation for group testing based on holographic transformation. 2787-2791 - Wenwen Zhao, Lifeng Lai:
Distributed testing with zero-rate compression. 2792-2796 - Gil Katz, Pablo Piantanida, Romain Couillet, Mérouane Debbah:
On the necessity of binning for the distributed hypothesis testing problem. 2797-2801 - Arise Kuriya, Toshiyuki Tanaka:
Performance degradation of AMP for small-sized problems. 2802-2806 - Burak Çakmak
S-AMP for non-linear observation models. 2807-2811
Fr-PM1-9: Topics in Wireless Networks
- Yi Zhong, Wenyi Zhang, Martin Haenggi:
Stability analysis of static Poisson networks. 2812-2816 - Yueping Wu, Ying Cui, Bruno Clerckx:
User-centric interference nulling in downlink multi-antenna heterogeneous networks. 2817-2821 - Jubin Jose, Chong Li, Xinzhou Wu, Lei Ying
Distributed rate and power control in DSRC. 2822-2826 - Heecheol Yang, Wonjae Shin, Jungwoo Lee
Grouping based blind interference alignment for K-user MISO interference channels. 2827-2831 - Michael Farag, Bobak Nazer:
Matching alignment. 2832-2836
Fr-PM2-1: Topics in Distributed Storage
- Ryan Gabrys, Farzad Farnoud:
Reconciling similar sets of data. 2837-2841 - Terence H. Chan
Private information retrieval for coded storage. 2842-2846 - Rawad Bitar, Salim El Rouayheb:
Securing data against limited-knowledge adversaries in distributed storage systems. 2847-2851 - Arman Fazeli
Codes for distributed PIR with low storage overhead. 2852-2856
Fr-PM2-2: Relay Networks 2
- Silas L. Fong
Cut-set bound for multimessage multicast networks with independent channels and zero-delay edges. 2857-2861 - Nan Liu, Wei Kang:
The multiple access diamond channel with caching relays. 2862-2866 - Mohit Thakur, Gerhard Kramer
Quasi-concavity for Gaussian multicast relay channels. 2867-2869 - Si-Hyeon Lee, Sae-Young Chung:
Noisy network coding with partial DF. 2870-2874
Fr-PM2-3: Weight Distribution and Minimum Distance of LDPC Codes
- Giuliano Garrammone, David Declercq, Marc P. C. Fossorier:
Weight distributions of non-binary multi-edge type LDPC code ensembles. 2875-2879 - Francisco Lázaro Blasco, Enrico Paolini
On the weight distribution of fixed-rate Raptor codes. 2880-2884 - Alexey A. Frolov
An upper bound on the minimum distance of LDPC codes over GF(q). 2885-2888 - Tarik Benaddi, Charly Poulliat, Marie-Laure Boucheret, Benjamin Gadat, Guy Lesthievent:
Ensemble weight enumerators for protographs: A proof of Abu Surra's conjecture and a continuous relaxation for a faster enumeration. 2889-2893
Fr-PM2-4: Topics in Coding Theory
- Arkady G. D'yachkov, Ilya V. Vorobyev
Cover-free codes and separating system codes. 2894-2898 - Arkady G. D'yachkov, Ilya V. Vorobyev
Almost cover-free codes and designs. 2899-2903 - Venkata Gandikota
On the NP-hardness of bounded distance decoding of Reed-Solomon codes. 2904-2908 - Huang-Chang Lee, Guan-Xuan Huang, Chung-Hsuan Wang, Yeong-Luh Ueng
Iterative soft-decision decoding of Reed-Solomon codes using informed dynamic scheduling. 2909-2913
Fr-PM2-5: Topics in Detection and Estimation 2
- Sabina Zejnilovic, João Xavier, João Gomes, Bruno Sinopoli:
Selecting observers for source localization via error exponents. 2914-2918 - Wasim Huleihel, Neri Merhav:
Universal decoding for Gaussian intersymbol interference channels. 2919-2923 - Jaeho Lee, Maxim Raginsky, Pierre Moulin:
On MMSE estimation from quantized observations in the nonasymptotic regime. 2924-2928 - Shaunak Mishra, Yasser Shoukry
Secure state estimation: Optimal guarantees against sensor attacks in the presence of noise. 2929-2933
Fr-PM2-6: Security and Correlation
- Daming Cao
Message authentication with correlated sources. 2934-2938 - Cheuk Ting Li, Abbas El Gamal:
Maximal correlation secrecy. 2939-2943 - Ali Makhdoumi, Flávio P. Calmon, Muriel Médard:
Forgot your password: Correlation dilution. 2944-2948 - Reevana Balmahoon, Ling Cheng:
Information leakage of heterogeneous encoded correlated sequences over an eavesdropped channel. 2949-2953
Fr-PM2-7: Finite Blocklength Analysis 3
- Jonathan Scarlett, Alfonso Martinez
Refinements of the third-order term in the fixed error asymptotics of constant-composition codes. 2954-2958 - Wei Yang, Giuseppe Durisi
Minimum energy to send k bits over Rayleigh-fading channels. 2959-2963 - Jonathan Scarlett, Vincent Y. F. Tan:
Second-order asymptotics for the discrete memoryless MAC with degraded message sets. 2964-2968 - Hideki Yagi, Te Sun Han, Ryo Nomura
First- and second-order coding theorems for mixed memoryless channels with general mixture. 2969-2973
Fr-PM2-8: Data Compression
- Takahiro Ota, Hiroyoshi Morita:
On a two-dimensional antidictionary construction using suffix tries. 2974-2978 - Ashwin Pananjady, Thomas A. Courtade:
Compressing sparse sequences under local decodability constraints. 2979-2983 - Arya Mazumdar, Venkat Chandar, Gregory W. Wornell:
Local recovery in data compression for general sources. 2984-2988 - Mehryar Mohri, Michael Riley, Ananda Theertha Suresh:
Automata and graph compression. 2989-2993
Fr-PM2-9: Topics in Wireless Communiction
- Yi-Sheng Su, Chung-Hsuan Wang, Huei-Yun Siao:
On unequal missing protection of the grouping of RFID tags. 2994-2998 - Wonseok Jeon, Sae-Young Chung:
Improving degrees of freedom of wireless channels using superdirectivity. 2999-3003 - Alfonso Martinez
Improved information rates for bit-interleaved coded modulation. 3004-3007 - Roy D. Yates:
Lazy is timely: Status updates by an energy harvesting source. 3008-3012
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 2024-12-26 01:00 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: