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, Vladimir Sidorenko:
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, Ayfer Özgür, Haim H. Permuter:
State-dependent multiple-access channels with partially cribbing encoders. 21-25 - Tal Kopetz, Haim H. Permuter, Shlomo Shamai:
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, Ertem Tuncel:
Delay limited transmission of a uniform source over an AWGN channel. 76-80
Mo-AM1-5: Error Exponents 1
- Yuta Sakai, Ken-ichi Iwata:
Feasible regions of symmetric capacity and Gallager's E0 function for ternary-input discrete memoryless channels. 81-85 - Jonathan Scarlett, Alfonso Martinez, Albert Guillen i Fabregas:
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, Alfonso Martinez, Albert Guillen i Fabregas:
Achievable rates and exponents for asynchronous communication with ML decoding. 96-100
Mo-AM1-6: Gaussian Channels and Secrecy
- Nir Shlezinger, Daniel Zahavi, Yonathan Murin, Ron Dabora:
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, Phan-Minh Nguyen, Ayfer Özgür:
Capacity of the energy harvesting channel with a finite battery. 131-135 - Dor Shaviv, Ayfer Özgür:
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, Olivier Lévêque:
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, Hirosuke Yamamoto:
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, Khaled A. S. Abdel-Ghaffar:
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, Fei Gao, Samuel Tien Ho Teo, Hui Zhang:
Combinatorial systematic switch codes. 241-245 - Ohad Elishco, Tom Meyerovitch, Moshe Schwartz:
Semiconstrained systems. 246-250 - Thomas Mittelholzer, Thomas P. Parnell, Nikolaos Papandreou, Haralampos Pozidis:
Symmetry-based subproduct codes. 251-255 - Igor V. Zhilin, Pavel S. Rybin, Victor V. Zyablov:
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, Yury Polyanskiy, Sergio Verdú:
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, Navin Kashyap:
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, Hideki Yagi:
Information spectrum approach to fixed-length lossy source coding problem with some excess distortion probability. 306-310 - Silas L. Fong, Vincent Y. F. Tan:
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, Hans-Andrea Loeliger:
Deconvolution of weakly-sparse signals and dynamical-system identification by Gaussian message passing. 326-330 - Jun Chen, Fei Wang, Jianjiang Zhou:
The metrication of LPI radar waveforms based on the asymptotic spectral distribution of wigner matrices. 331-335 - Mojtaba Soltanalian, Babak Hassibi:
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, Raúl Tempone:
A unified simulation approach for the fast outage capacity evaluation over generalized fading channels. 346-350 - Khoa D. Nguyen, Roy Timo, Lars K. Rasmussen:
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, Megasthenis Asteris, Alexandros G. Dimakis:
On approximating the sum-rate for multiple-unicasts. 381-385
Mo-PM1-2: Broadcast Channels
- Behzad Asadi, Lawrence Ong, Sarah J. Johnson:
A unified scheme for two-receiver broadcast channels with receiver message side information. 386-390 - Ronit Bustin, Rafael F. Schaefer, H. Vincent Poor, Shlomo Shamai:
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, Khaled A. S. Abdel-Ghaffar:
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, Brian M. Kurkoski:
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, Laura Luzzi:
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, Deniz Gündüz:
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, Joseph J. Boutros:
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, Krishna R. Narayanan, Ping-Chung Wang:
Adaptive compute-and-forward with lattice codes over algebraic integers. 566-570 - Shwan Ashrafi, Chen Feng, Sumit Roy, Frank R. Kschischang:
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, Yi Hong, Emanuele Viterbo:
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, Aditya Ramamoorthy:
Capacity of sum-networks for different message alphabets. 606-610
Mo-PM2-2: The X-Channel
- Praneeth Kumar V., Srikrishna Bhashyam:
On the sum capacity of the Gaussian x channel in the mixed interference regime. 611-615 - Zhao Wang, Ming Xiao, Mikael Skoglund, H. Vincent Poor:
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, Han Mao Kiah, Yuval Cassuto:
Optimal binary switch codes with small query size. 636-640