default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDISIT 2011: St. Petersburg, Russia
- Alexander Kuleshov, Vladimir M. Blinovsky, Anthony Ephremides:
2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011, St. Petersburg, Russia, July 31 - August 5, 2011. IEEE 2011, ISBN 978-1-4577-0596-0 - Ido Tal, Alexander Vardy
:
List decoding of polar codes. 1-5 - Noam Presman, Ofer Shapira, Simon Litsyn:
Polar codes with mixed kernels. 6-10 - Ramtin Pedarsani, Seyed Hamed Hassani, Ido Tal, Emre Telatar:
On the construction of polar codes. 11-15 - Ali Eslami, Hossein Pishro-Nik:
A practical approach to polar codes. 16-20 - Huarui Yin, Lei Ke, Zhengdao Wang:
Interference alignment and Degrees of Freedom region of cellular sigma channel. 21-25 - Changxin Shi, Randall A. Berry, Michael L. Honig:
Interference alignment in multi-carrier interference networks. 26-30 - Girish N. Nair:
When is n-pairs information a multicommodity flow? 31-35 - Lei Ke, Aditya Ramamoorthy, Zhengdao Wang, Huarui Yin:
Degrees of freedom region for an interference network with general message demands. 36-40 - Victoria Kostina, Sergio Verdú:
Fixed-length lossy compression in the finite blocklength regime: Discrete memoryless sources. 41-45 - Shirin Jalali, Michelle Effros:
On distortion bounds for dependent sources over wireless networks. 46-50 - Amos Lapidoth, Andreas Malär, Ligong Wang:
Covering point patterns. 51-55 - Yasutada Oohama:
Characterization of a part of the rate distortion region for the gaussian distributed source coding. 56-60 - Vladimir M. Blinovsky:
About the reliability function of symmetric channel under list decoding. 61-63 - Runyao Duan, Simone Severini, Andreas J. Winter:
Zero-error communication via quantum channels and a quantum Lovász θ-function. 64-68 - Rudolf Ahlswede, Christian Deppe, Vladimir S. Lebedev:
Bounds for threshold and majority group testing. 69-73 - Binyue Liu, Ning Cai:
Analog network coding in the generalized high-SNR regime. 74-78 - Caner Nazaroglu, B. Javad Ebrahimi, Ayfer Özgür, Christina Fragouli:
Network Simplification: The Gaussian diamond network with multiple antennas. 79-83 - Lawrence Ong, Christopher M. Kellett, Sarah J. Johnson:
On achievable rate regions of the asymmetric AWGN two-way relay channel. 84-88 - Nicolas Schrammar, Mattias Andersson, Mikael Skoglund:
Approximate capacity of the general gaussian parallel relay network. 89-93 - Junwei Zhang, Mustafa Cenk Gursoy:
An achievable rate region for imperfectly-known two-way relay fading channels. 94-98 - Igor Bjelakovic, Holger Boche, Gisbert Janssen:
Universal quantum state merging. 99-103 - Samuel L. Braunstein, David W. Kribs, Manas K. Patra:
Zero-error subspaces of quantum channels. 104-108 - Hirotada Kobayashi, Francois Le Gall, Harumichi Nishimura, Martin Rötteler:
Constructing quantum network coding schemes from classical nonlinear protocols. 109-113 - Saikat Guha, Ivan Savov, Mark M. Wilde:
The free space optical interference channel. 114-118 - Galen Reeves, Michael Gastpar:
On the role of diversity in sparsity estimation. 119-123 - Sebastian Schmutzhard, Alexander Jung, Franz Hlawatsch:
Minimum variance estimation for the sparse signal in noise model. 124-128 - David L. Donoho, Iain M. Johnstone, Arian Maleki, Andrea Montanari:
Compressed Sensing over ℓp-balls: Minimax mean square error. 129-133 - Arian Maleki, Richard G. Baraniuk:
Least favorable compressed sensing problems for first-order methods. 134-138 - Tadashi Wadayama, Manabu Hagiwara:
LP decodable permutation codes based on linearly constrained permutation matrices. 139-143 - Tuvi Etzion:
Sidon sequences and doubly periodic two-dimensional synchronization patterns. 144-148 - Erik Ordentlich, Ron M. Roth:
Low complexity two-dimensional weight-constrained codes. 149-153 - Erik Ordentlich, Farzad Parvaresh, Ron M. Roth:
Asymptotic enumeration of binary matrices with bounded row and column weights. 154-158 - Himanshu Asnani, Haim H. Permuter, Tsachy Weissman:
To feed or not to feed back. 159-163 - Siva K. Gorantla, Todd P. Coleman:
Equivalence between reliable feedback communication and nonlinear filter stability. 164-168 - Chong Li, Nicola Elia:
Bounds on the achievable rate of noisy feedback Gaussian channels under linear feedback coding scheme. 169-173 - Chong Li, Nicola Elia:
The information theoretic characterization of the capacity of channels with noisy feedback. 174-178 - Noam Presman, Ofer Shapira, Simon Litsyn:
Binary polar code kernels from code decompositions. 179-183 - Emmanuel Abbe:
Polarization and randomness extraction. 184-188 - Eren Sasoglu:
Polarization in the presence of memory. 189-193 - Emmanuel Abbe, Andrew R. Barron:
Polar coding schemes for the AWGN channel. 194-198 - Chinmay S. Vaze, Mahesh K. Varanasi:
The degrees of freedom region of the two-user MIMO broadcast channel with delayed CSIT. 199-203 - Mohammad Shahmohammadi, Onur Ozan Koyluoglu, Tamer M. S. Khattab, Hesham El Gamal:
On the degrees of freedom of the cognitive broadcast channel. 204-208 - Mohammad Javad Abdoli, Akbar Ghasemi, Amir K. Khandani:
On the degrees of freedom of three-user MIMO broadcast channel with delayed CSIT. 209-213 - Ilan Shomorony, Amir Salman Avestimehr:
Sum degrees-of-freedom of two-unicast wireless networks. 214-218 - Yuval Lomnitz, Meir Feder:
Prediction of priors for communication over arbitrarily varying channels. 219-223 - Ronen Dar, Meir Feder:
Finite-memory least squares universal prediction of individual continuous sequences. 224-228 - Yuval Lomnitz, Meir Feder:
Universal communication over modulo-additive individual noise sequence channels. 229-233 - Virag Shah, Bikash Kumar Dey, D. Manjunath:
Network flows for functions. 234-238 - John Tadrous, Atilla Eryilmaz, Hesham El Gamal:
Proactive multicasting with predictable demands. 239-243 - Mohammad Asad R. Chaudhry, Zakia Asad, Alex Sprintson, Michael Langberg:
On the complementary Index Coding problem. 244-248 - Yi-Ting Chen, Constantine Caramanis, Sanjay Shakkottai:
On file sharing over a wireless social network. 249-253 - Steven Corroy, Rudolf Mathar:
Worst-case linear transmit strategies with limited relay information in Gaussian relay networks. 254-258 - Urs Niesen, Suhas N. Diggavi:
The approximate capacity of the Gaussian N-relay diamond network. 259-263 - Jinyuan Chen, Petros Elia, Raymond Knopp:
Relay-aided interference neutralization for the multiuser uplink-downlink asymmetric setting. 264-268 - Youvaraj T. Sagar, Jie Yang, Hyuck M. Kwon:
Channel capacities of parallel and serial modulo-sum relay networks. 269-273 - Saikat Guha, Zachary Dutton, Jeffrey H. Shapiro:
On quantum limit of optical communications: Concatenated codes and joint-detection receivers. 274-278 - Yuichiro Fujiwara, Min-Hsiu Hsieh:
Adaptively correcting quantum errors with entanglement. 279-283 - Hye Won Chung, Saikat Guha, Lizhong Zheng:
On capacity of optical channels with coherent detection. 284-288 - Alexander S. Holevo:
The entropy gain of quantum channels. 289-292 - Christopher J. Quinn, Negar Kiyavash, Todd P. Coleman:
Equivalence between minimal generative model graphs and directed information graphs. 293-297 - Gadiel Seroussi, Wojciech Szpankowski, Marcelo J. Weinberger:
Deinterleaving Markov processes: The finite-memory switch case. 298-302 - Divyanshu Vats, José M. F. Moura:
Necessary conditions for consistent set-based graphical model selection. 303-307 - David T. Lee, Jehoshua Bruck:
Generating probability distributions using multivalued stochastic relay circuits. 308-312 - Kees A. Schouhamer Immink:
High-rate maximum runlength constrained coding schemes using nibble replacement. 313-316 - Kees A. Schouhamer Immink, Jos H. Weber, Hendrik C. Ferreira:
Balanced runlength limited codes using Knuth's algorithm. 317-320 - Vitaly Skachek, Kees A. Schouhamer Immink:
Constant weight codes: An approach based on Knuth's balancing method. 321-325 - Rudolf Ahlswede, Christian Deppe, Vladimir S. Lebedev:
Majority group testing with density tests. 326-330 - Kittipong Kittichokechai, Tobias J. Oechtering, Mikael Skoglund:
On the capacity of a channel with action-dependent state and reversible input. 331-335 - Shih-Wei Wang, Po-Ning Chen, Chung-Hsuan Wang, Wen-Chieh Chang:
On the optimal power allocation for additive color noise parallel channels with limited access constraint. 336-340 - Roberto Wanderley da Nóbrega, Bartolomeu F. Uchôa Filho, Danilo Silva:
On the capacity of multiplicative finite-field matrix channels. 341-345 - Ramji Venkataramanan, Sekhar Tatikonda, Kannan Ramchandran:
Achievable rates for channels with deletions and insertions. 346-350 - Pavel S. Rybin, Victor V. Zyablov:
Asymptotic estimation of error fraction corrected by binary LDPC code. 351-355 - Seyed Hamed Hassani, Nicolas Macris, Ryuhei Mori:
Near concavity of the growth rate for coupled LDPC chains. 356-360 - Masanori Hirotomo, Masami Mohri, Masakatu Morii:
A reliability-based computation method for the weight distribution of LDPC codes using the probabilistic algorithm. 361-365 - Qiuju Diao, Qin Huang, Shu Lin, Khaled A. S. Abdel-Ghaffar:
A transform approach for computing the ranks of parity-check matrices of quasi-cyclic LDPC codes. 366-370 - Adriano Pastore, Michael Joham, Javier Rodríguez Fonollosa:
Joint pilot and precoder design for optimal throughput. 371-375 - Hassan Ghozlan, Gerhard Kramer:
Interference focusing for simplified optical fiber models with dispersion. 376-379 - Aravind R. Iyengar, Paul H. Siegel, Jack K. Wolf:
Modeling and information rates for synchronization error channels. 380-384 - Iddo Naiss, Haim H. Permuter:
Bounds on rate distortion with feed forward for stationary and ergodic sources. 385-389 - Mariko Tsurusaki, Jun'ichi Takeuchi:
Stochastic interpretation of universal portfolio and generalized target classes. 390-394 - Wei-Hsin Gu, Michelle Effros:
A strong converse in source coding for super-source networks. 395-399 - Jayadev Acharya, Hirakendu Das, Alon Orlitsky, Shengjun Pan:
Algebraic computation of pattern maximum likelihood. 400-404 - Eimear Byrne, Akiko Manada, Stevan Jovica Marinkovic, Emanuel M. Popovici:
A graph theoretical approach for network coding in wireless body area networks. 405-409 - Nebojsa Milosavljevic, Sameer Pawar, Salim Y. El Rouayheb, Michael Gastpar, Kannan Ramchandran:
Deterministic algorithm for the cooperative data exchange problem. 410-414 - Yiwei Song, Natasha Devroye, Bobak Nazer:
Inverse compute-and-forward: Extracting messages from simultaneously transmitted equations. 415-419 - Susana B. Cruz, Gerhard Maierbacher, João Barros:
Joint source-network coding for large-scale sensor networks. 420-424 - Shlomo Shamai, Michèle A. Wigger:
Rate-limited transmitter-cooperation in Wyner's asymmetric interference network. 425-429 - Chenwei Wang, Syed Ali Jafar, Shlomo Shamai, Michèle A. Wigger:
Interference, cooperation and connectivity - A degrees of freedom perspective. 430-434 - François Baccelli, Abbas El Gamal, David Tse:
Interference networks with point-to-point codes. 435-439 - Chinmay S. Vaze, Mahesh K. Varanasi:
On completing the degrees of freedom characterization of MIMO interference networks with No CSIT. 440-444 - Mark M. Wilde, Min-Hsiu Hsieh:
Entanglement boosts quantum turbo codes. 445-449 - Mark M. Wilde, Monireh Houshmand, Saied Hosseini-Khayat:
Examples of minimal-memory, non-catastrophic quantum convolutional encoders. 450-454 - Lingfei Jin, Chaoping Xing:
Quantum Gilbert-Varshamov bound through symplectic self-orthogonal codes. 455-458 - Ulugbek Kamilov, Vivek K. Goyal, Sundeep Rangan:
Optimal quantization for compressive sensing under message passing reconstruction. 459-463 - Sina Jafarpour, Volkan Cevher, Robert E. Schapire:
A game theoretic approach to expander-based compressive sensing. 464-468 - M. Amin Khajehnejad, Arash Saber Tehrani, Alexandros G. Dimakis, Babak Hassibi:
Explicit matrices for sparse approximation. 469-473 - Yaser Eftekhari, Anoosheh Heidarzadeh, Amir H. Banihashemi, Ioannis Lambadaris:
Density evolution analysis of node-based verification-based algorithms in compressed sensing. 474-478 - Gerhard Wunder:
Analysis of alternative metrics for the PAPR problem in OFDM transmission. 479-483 - Igal Kotzer, Smadar Har-Nevo, Sasha Sodin, Simon Litsyn:
On the EVM of sequences. 484-488 - Zi Long Liu, Yong Liang Guan, Wai Ho Mow:
Improved lower bound for quasi-complementary sequence set. 489-493 - Serdar Boztas, Udaya Parampalli:
On the relative abundance of nonbinary sequences with perfect autocorrelations. 494-498 - Marco Dalai:
A new bound on the capacity of the binary deletion channel with high deletion probabilities. 499-502 - Hongyi Yao, Tracey Ho, Michelle Effros:
On the equivalence of Shannon capacity and stable capacity in networks with memoryless channels. 503-507 - Hirosuke Yamamoto, Keishi Okudera:
Channel coding theorem for the number of guesses in decoding. 508-512 - Lei Zhang, Dongning Guo:
Capacity of Gaussian channels with duty cycle and power constraints. 513-517 - Yuval Cassuto, Mohammad Amin Shokrollahi:
Array-code ensembles -or- two-dimensional LDPC codes. 518-522 - Valentin Savin, David Declercq:
Linear growing minimum distance of ultra-sparse non-binary cluster-LDPC codes. 523-527 - Dmitri K. Zigangirov, Kamil Sh. Zigangirov, Daniel J. Costello Jr.:
Partially-regular LDPC codes with linear encoding complexity and improved thresholds. 528-532 - Tomoharu Shibuya:
Block-triangularization of parity check matrices for efficient encoding of linear codes. 533-537 - A. Taufiq Asyhari, Albert Guillen i Fabregas:
Mismatched CSI outage exponents of block-fading channels. 538-542 - Rajesh T. Krishnamachari, Mahesh K. Varanasi:
MIMO performance under covariance matrix feedback. 543-547 - Inaki Estella Aguerri, Deniz Gündüz:
Distortion exponent in fading MIMO channels with time-varying side information. 548-552 - Salam Akoum, Marios Kountouris, Robert W. Heath Jr.:
On imperfect CSI for the downlink of a two-tier network. 553-557 - Paul de Kerret, David Gesbert:
The multiplexing gain of a two-cell MIMO channel with unequal CSI. 558-562 - Ravi Tandon, Lalitha Sankar, H. Vincent Poor:
Multi-user privacy: The Gray-Wyner system and generalized common information. 563-567 - Julius Kusuma, Lav R. Varshney, Vivek K. Goyal:
Malleable coding with fixed segment reuse. 568-572 - Ersen Ekrem, Sennur Ulukus:
Secure lossy transmission of vector Gaussian sources. 573-577 - Himanshu Tyagi:
Minimal public communication for maximum rate secret key generation. 578-582 - Nan Ma, Kannan Ramchandran, David Tse:
Efficient file synchronization: A distributed source coding approach. 583-587 - Anthony Kim, Muriel Médard:
Computing bounds on network capacity regions as a polytope reconstruction problem. 588-592 - Søren Riis, Maximilien Gadouleau:
A dispersion theorem for communication networks based on term sets. 593-597 - Amin Aminzadeh Gohari, Shenghao Yang, Sidharth Jaggi:
Beyond the cut-set bound: Uncertainty computations in network coding with correlated sources. 598-602 - Maximilien Gadouleau, Søren Riis:
Max-flow min-cut theorem for Rényi entropy in communication networks. 603-607 - Se Yong Park, Anant Sahai:
An algebraic mincut-maxflow theorem. 608-612 - Jun Muramatsu, Shigeki Miyake:
Construction of strongly secure wiretap channel code based on hash property. 613-617 - Xiang He, Aylin Yener:
Secrecy when the eavesdropper controls its channel states. 618-622 - Nan Liu, Wei Kang:
The secrecy capacity region of a special class of multiple access channels. 623-627 - Omur Ozel, Sennur Ulukus:
Wiretap channels: Roles of rate splitting and channel prefixing. 628-632