default search action
ISIT 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
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
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
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
Network Simplification: The Gaussian diamond network with multiple antennas. 79-83 - Lawrence Ong
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
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
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
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
On the complementary Index Coding problem. 244-248 - Yi-Ting Chen, Constantine Caramanis
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
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
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
Majority group testing with density tests. 326-330 - Kittipong Kittichokechai
On the capacity of a channel with action-dependent state and reversible input. 331-335 - Shih-Wei Wang, Po-Ning Chen
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
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
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
Joint source-network coding for large-scale sensor networks. 420-424 - Shlomo Shamai
Rate-limited transmitter-cooperation in Wyner's asymmetric interference network. 425-429 - Chenwei Wang, Syed Ali Jafar
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
Entanglement boosts quantum turbo codes. 445-449 - Mark M. Wilde
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
Optimal quantization for compressive sensing under message passing reconstruction. 459-463 - Sina Jafarpour, Volkan Cevher
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
Improved lower bound for quasi-complementary sequence set. 489-493 - Serdar Boztas
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
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
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
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
Computing bounds on network capacity regions as a polytope reconstruction problem. 588-592 - Søren Riis
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
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 - Matthieu R. Bloch:
Achieving secrecy: Capacity vs. resolvability. 633-637 - Manabu Hagiwara, Kenta Kasai, Hideki Imai, Kohichi Sakaniwa:
Spatially coupled quasi-cyclic quantum LDPC codes. 638-642 - Alain Couvreur, Nicolas Delfosse, Gilles Zémor
A construction of quantum LDPC codes from Cayley graphs. 643-647 - Sagarmoy Dutta, Piyush P. Kurur:
Quantum cyclic code of length dividing pt + 1. 648-652 - Kenta Kasai, Manabu Hagiwara, Hideki Imai, Kohichi Sakaniwa:
Non-binary quasi-cyclic quantum LDPC codes. 653-657 - Jong Min Kim, Ok Kyun Lee, Jong Chul Ye:
Compressive MUSIC with optimized partial support for joint sparse recovery. 658-662 - Dustin G. Mixon, Waheed U. Bajwa, A. Robert Calderbank:
Frame coherence and sparse signal processing. 663-667 - Chenlu Qiu, Namrata Vaswani:
Support-Predicted Modified-CS for recursive robust principal components' Pursuit. 668-672 - Megasthenis Asteris, Dimitris S. Papailiopoulos, George N. Karystinos:
Sparse principal component of a rank-deficient matrix. 673-677 - Arya Mazumdar, Alexander Barg:
General constructions of deterministic (S)RIP matrices for compressive sampling. 678-682 - Sung-Tai Choi, Tae-Hyung Lim, Jong-Seon No, Habong Chung:
Evaluation of cross-correlation values of p-ary m-sequence and its decimated sequence by pn+1 over p+1 + pn-1 over 2. 683-687 - Alex J. Burrage, Ana Salagean
Linear complexity for sequences with characteristic polynomial ƒv. 688-692 - Nikolay Kolomeec:
Constructions of bent functions on the minimal distance from the quadratic bent function. 693-697 - Yen-Wen Huang, Ying Li:
16-QAM Golay complementary sequences with new sequence lengths. 698-702 - Claude Carlet, Tor Helleseth, Alexander Kholosha, Sihem Mesnager:
On the dual of bent functions with 2r Niho exponents. 703-707 - Rami Atar, Tsachy Weissman:
Mutual information, relative entropy, and estimation in the Poisson channel. 708-712 - Christopher Li, Tong Cheng, Todd P. Coleman:
A memoryless channel coding methodology for infinite-memory queuing timing channels. 713-717 - Yi-Lin Tsai, Christopher Rose
An additive exponential noise channel with a transmission deadline. 718-722 - Arash Einolghozati, Mohsen Sardari, Ahmad Beirami, Faramarz Fekri
Capacity of discrete molecular diffusion channels. 723-727 - Michel T. Ivrlac, Josef A. Nossek
Gaussian multiple access channel with compact antenna arrays. 728-731 - Irina E. Bocharova, Florian Hug, Rolf Johannesson, Boris D. Kudryashov, Roman V. Satyukov:
Some voltage graph-based LDPC tailbiting codes with large girth. 732-736 - Sergei Kovalev, Victor Y. Krachkovsky:
A simple method to construct LDPC codes based on projective planes. 737-741 - Xiaopeng Jiao, Marc André Armand:
Interleaved LDPC codes, reduced-complexity inner decoder and an iterative decoder for the Davey-MacKay construction. 742-746 - Kenta Kasai, Kohichi Sakaniwa:
Spatially-coupled MacKay-Neal codes and Hsu-Anastasopoulos codes. 747-751 - Minqi Shen, Anders Høst-Madsen:
Wideband slope in interference channels with imperfect CSI at transmitters. 752-756 - Chinmay S. Vaze, Sanjay Karmakar, Mahesh K. Varanasi:
On the generalized degrees of freedom region of the MIMO interference channel with no CSIT. 757-761 - Hamed Farhadi
On the throughput of wireless interference networks with limited feedback. 762-766 - Akbar Ghasemi, Abolfazl S. Motahari, Amir K. Khandani:
On the degrees of freedom of X channel with delayed CSIT. 767-770 - Sergey Tridenski, Ram Zamir:
Bounds for joint source-channel coding at high SNR. 771-775 - Kumar Viswanatha, Emrah Akyol
An achievable rate region for distributed source coding and dispersive information routing. 776-780 - Paolo Minero, Sung Hoon Lim
Joint source-channel coding via hybrid coding. 781-785 - Amos Lapidoth, I-Hsiang Wang:
Communicating remote Gaussian sources over Gaussian multiple access channels. 786-790 - Yu-Pin Hsu
Opportunities for network coding: To wait or not to wait. 791-795 - Daniel E. Lucani
Energy-delay considerations in coded packet flows. 796-800 - Anoosheh Heidarzadeh, Amir H. Banihashemi:
Analysis of overlapped chunked codes with small chunks over line networks. 801-805 - Yossi Berliner, Michael Langberg:
Index coding with outerplanar side information. 806-810 - Xiujie Huang, Xiao Ma, Lei Lin, Baoming Bai:
Accessible capacity of secondary users over the Gaussian interference channel. 811-815 - Haim H. Permuter
Cooperation in multiple access channels in the presence of partial state information. 816-820 - Yang Han, See Ho Ting, Mehul Motani
On throughput and delay scaling with cooperative spectrum sharing. 821-825 - Matthew S. Nokleby, Behnaam Aazhang:
Cooperative computation in wireless networks. 826-830 - Yingquan Wu:
Erasure-only list decoding of Reed-Solomon and BCH codes with applications to their product codes. 831-834 - Davide Schipani, Michele Elia, Joachim Rosenthal
On the decoding complexity of cyclic codes up to the BCH bound. 835-839 - Mortuza Ali, Margreta Kuijper
Minimal list decoding of Reed-Solomon codes using a parameterization of Gröbner bases. 840-844 - Christian Senger, Vladimir Sidorenko
Optimal threshold-based multi-trial error/erasure decoding with the Guruswami-Sudan algorithm. 845-849 - Amir Hesam Salavati, K. Raj Kumar, Mohammad Amin Shokrollahi, Wulfram Gerstner:
Neural pre-coding increases the pattern retrieval capacity of Hopfield and Bidirectional Associative Memories. 850-854 - José Bento, Morteza Ibrahimi, Andrea Montanari:
Information theoretic limits on learning stochastic differential equations. 855-859 - Adam Krzyzak:
Radial Basis Function Networks with optimal kernels. 860-863 - Matthew Ager, Zoran Cvetkovic, Peter Sollich:
Combined waveform-cepstral representation for robust speech recognition. 864-868 - Arya Mazumdar, Alexander Barg, Gilles Zémor
Constructions of rank modulation codes. 869-873 - Eyal En Gad, Michael Langberg, Moshe Schwartz
Generalized Gray codes for local rank modulation. 874-878 - Itzhak Tamo, Moshe Schwartz
On the labeling problem of permutation group codes under the infinity metric. 879-883 - Eyal En Gad, Anxiao Jiang, Jehoshua Bruck
Compressed encoding for rank modulation. 884-888 - Hari Palaiyanur, Anant Sahai:
An improvement to the Haroutunian bound for anytime coding systems. 889-893 - Ofer Shayevitz:
On Rényi measures and hypothesis testing. 894-898 - Adrià Tauste Campo
Random-coding joint source-channel bounds. 899-902 - Frantisek Matús, Johannes Rauh
Maximization of the information divergence from an exponential family and criticality. 903-907 - Reza Asvadi
Design of irregular quasi-cyclic protograph codes with low error floors. 908-912 - Dariush Divsalar, Lara Dolecek:
Enumerators for protograph-based ensembles of nonbinary LDPC codes. 913-917 - Hosung Park
Protograph design with multiple edges for regular QC LDPC codes having large girth. 918-922 - Irina E. Bocharova, Florian Hug, Rolf Johannesson, Boris D. Kudryashov:
Double-Hamming based QC LDPC codes with large minimum distance. 923-927 - Michal Kaliszan, Emmanuel Pollakis, Slawomir Stanczak:
Efficient beamforming algorithms for MIMO multicast with application-layer coding. 928-932 - Ali Tajer, Xiaodong Wang, H. Vincent Poor
Coordination limits in MIMO networks. 933-937 - Aris L. Moustakas:
SINR distribution of MIMO MMSE receiver. 938-942 - Aurel A. Lazar
Encoding of multivariate stimuli with MIMO neural circuits. 943-947 - Silvija Kokalj-Filipovic, Emina Soljanin
Cliff effect suppression through multiple-descriptions with split personality. 948-952 - Amin Karbasi, Morteza Zadimoghaddam:
Compression with graphical constraints: An interactive browser. 953-957 - Yihong Wu, Erik Ordentlich, Marcelo J. Weinberger:
Energy-optimized lossless compression: Rate-variability tradeoff. 958-962 - Ying Cui, Vincent K. N. Lau
Delay-optimal scheduling for cooperative networks. 963-967 - Sadaf Salehkalaibar, Mohammad Reza Aref:
The capacity region of a class of 3-receiver broadcast channels with two eavesdroppers. 968-972 - Mayank Bakshi
On equivalence for networks of noisy channels under byzantine attacks. 973-977 - Chung Chan
The hidden flow of information. 978-982 - Son Hoang Dau
On secure Index Coding with Side Information. 983-987 - Zheng Wang, Jie Luo:
Coding theorems for random access communication over compound channel. 988-992 - Moritz Wiese, Holger Boche:
The arbitrarily varying multiple-access channel with conferencing encoders. 993-997 - Gireeja Ranade, Anant Sahai:
Implicit communication in multiple-access settings. 998-1002 - Eli Haim, Yuval Kochman, Uri Erez:
Improving the MAC error exponent using distributed structure. 1003-1007 - Sabine Kampf, Martin Bossert, Irene I. Bouw:
Solving the key equation for Hermitian codes with a division algorithm. 1008-1012 - Peter Trifonov
A concatenated coding scheme based on folded Reed-Solomon codes. 1013-1016 - Alexander Zeh, Antonia Wachter, Sergey Bezzateev
Efficient decoding of some classes of binary cyclic codes beyond the Hartmann-Tzeng bound. 1017-1021 - Masaya Fujisawa, Shojiro Sakata:
On a fast decoding of multipoint codes from algebraic curves. 1022-1026 - Bharath K. Sriperumbudur:
Mixture density estimation via Hilbert space embedding of measures. 1027-1030 - So Hirai, Kenji Yamanishi
Efficient computation of normalized maximum likelihood coding for Gaussian mixtures with its applications to optimal clustering. 1031-1035 - Mario Frank, Joachim M. Buhmann:
Selecting the rank of truncated SVD by maximum approximation capacity. 1036-1040 - Taesup Moon, Tsachy Weissman, Jae-Young Kim:
Discrete denoising of heterogeneous two-dimensional data. 1041-1045 - Hongchao Zhou, Anxiao Jiang, Jehoshua Bruck
Nonuniform codes for correcting asymmetric errors. 1046-1050 - Luca G. Tallini, Bella Bose:
Reed-Muller codes, elementary symmetric functions and asymmetric error correction. 1051-1055 - Eitan Yaakobi, Paul H. Siegel, Alexander Vardy
On codes that correct asymmetric errors with graded magnitude distribution. 1056-1060 - Luca G. Tallini, Bella Bose:
On L1-distance error control codes. 1061-1065 - Gautam Dasarathy
On reliability of content identification from databases based on noisy queries. 1066-1070 - Da Wang, Venkat Chandar, Sae-Young Chung, Gregory W. Wornell:
Error exponents in asynchronous communication. 1071-1075 - Amos Lapidoth, Andreas Malär, Michèle A. Wigger:
Constrained Wyner-Ziv coding. 1076-1080 - Urs Niesen, Phil Whiting:
The degrees of freedom of compute-and-forward. 1081-1085 - Qin Huang, Qiuju Diao, Shu Lin, Khaled A. S. Abdel-Ghaffar:
Trapping sets of structured LDPC codes. 1086-1090 - Mehdi Karimi, Amir H. Banihashemi:
An efficient algorithm for finding dominant trapping sets of irregular LDPC codes. 1091-1095 - David G. M. Mitchell, Ali Emre Pusane, Michael Lentmaier, Daniel J. Costello Jr.:
Exact free distance and trapping set growth rates for LDPC convolutional codes. 1096-1100 - Takayuki Nozaki
Analysis of stopping constellation distribution for irregular non-binary LDPC code ensemble. 1101-1105 - Cong Ling, Shuiyin Liu, Laura Luzzi, Damien Stehlé:
Decoding by embedding: Correct decoding radius and DMT optimality. 1106-1110 - Ashish Khisti, Stark C. Draper
Streaming data over fading wireless channels: The diversity-multiplexing tradeoff. 1111-1115 - Ti-wen Tang, Min-Kun Chen, Hsiao-feng Lu:
Improving the DMT performances of MIMO linear receivers. 1116-1120 - Ahmed Hesham Mehana, Aria Nosratinia
The diversity of MMSE receiver over frequency-selective MIMO channel. 1121-1125 - Shun-ichi Amari:
Data compression in multiterminal statistical inference - linear-threshold encoding. 1126-1130 - Themistoklis Charalambous
Lossless coding with generalized criteria. 1131-1135 - Yu-Chih Huang
Joint source-channel coding with correlated interference. 1136-1140 - Joffrey Villard, Pablo Piantanida, Shlomo Shamai
Secure lossy source-channel wiretapping with side information at the receiving terminals. 1141-1145 - Ning Cai:
Network localized error correction: For non-coherent coding. 1146-1150 - Bernhard Haeupler
One packet suffices - Highly efficient packetized Network Coding With finite memory. 1151-1155 - Wangmei Guo, Ning Cai
Localized dimension growth in random network coding: A convolutional approach. 1156-1160 - Ho Yuet Kwan, Kenneth W. Shum, Chi Wan Sung
Generation of innovative and sparse encoding vectors for broadcast systems with feedback. 1161-1165 - Daniela Tuninetti
K-user interference channels: General outer bound and sum-capacity for certain Gaussian channels. 1166-1170 - Lei Zhou, Wei Yu:
On the capacity of the K-user cyclic Gaussian interference channel. 1171-1175 - Kamyar Moshksar, Akbar Ghasemi, Amir K. Khandani:
An alternative to decoding interference or treating interference as Gaussian noise. 1176-1180 - Chinmay S. Vaze, Mahesh K. Varanasi:
The capacity region of the symmetric Gaussian interference channel with common information to within a constant gap. 1181-1185 - L. Javier García-Villalba
Use of Gray codes for optimizing the search of (shortened) cyclic single burst-correcting codes. 1186-1189 - Jiun-Hung Yu
On irreducible polynomial remainder codes. 1190-1194 - Vincent Y. F. Tan, Laura Balzano
Rank minimization over finite fields. 1195-1199 - Sergei V. Fedorenko
The discrete Fourier transform over a finite field with reduced multiplicative complexity. 1200-1204 - Kumar Sricharan, Raviv Raich, Alfred O. Hero III:
k-nearest neighbor estimation of entropies with confidence. 1205-1209 - Rémi Cogranne
Statistical decision by using quantized observations. 1210-1214 - Farhad Shirani Chaharsooghi
A new method for variable elimination in systems of inequations. 1215-1219 - Maxim Raginsky:
Shannon meets Blackwell and Le Cam: Channels, codes, and statistical experiments. 1220-1224 - Viveck R. Cadambe
Permutation code: Optimal exact-repair of a single failed node in MDS code based distributed storage systems. 1225-1229 - Dimitris S. Papailiopoulos, Alexandros G. Dimakis:
Distributed storage codes through Hadamard designs. 1230-1234 - K. V. Rashmi, Nihar B. Shah, P. Vijay Kumar:
Enabling node repair in any erasure code for distributed storage. 1235-1239 - Itzhak Tamo, Zhiying Wang
MDS array codes with optimal rebuilding. 1240-1244 - Jianwei Xie, Sennur Ulukus:
Secrecy games on the one-sided interference channel. 1245-1249 - Suvarup Saha, Randall A. Berry
A potential function view of information theoretic interference games. 1250-1254 - Xun Gong, Negar Kiyavash, Parv Venkitasubramaniam
Information theoretic analysis of side channel information leakage in FCFS schedulers. 1255-1259 - Nikita D. Vvedenskaya, Yuri M. Suhov, Vladimir Belitsky:
A non-linear model of limit order book dynamics. 1260-1262 - David Burshtein, Idan Goldenberg:
Efficient methods for bounding the fractional distance of LDPC codes and obtaining fundamental polytopes of nonbinary and generalized codes. 1263-1267 - Igal Sason, Ronen Eshel:
On concentration of measures for LDPC code ensembles. 1268-1272 - Alexander Barg, Gilles Zémor
List decoding of product codes by the MinSum algorithm. 1273-1277 - Idan Goldenberg, David Burshtein:
The approximate maximum-likelihood certificate. 1278-1282 - Wen-Yao Chen, Chung-Chin Lu:
On error correction capability of bit-flipping algorithm for LDPC codes. 1283-1286 - Vincent K. N. Lau
Tradeoff analysis of delay-power-CSIT quality of generalized dynamic backpressure algorithm for energy efficient OFDM systems. 1287-1291 - Tharaka Samarasinghe
Vector broadcast channels: Optimality of threshold feedback policies. 1292-1296 - Xiaojun Yuan, Li Ping
Space-time linear precoding and iterative LMMSE detection for MIMO channels without CSIT. 1297-1301 - Sungkyu Jung, Kyeongjun Ko, Jungwoo Lee
Performance of hybrid codebook techniques for MISO downlink channels with limited feedback. 1302-1306 - Subhash Lakshminarayana, Mérouane Debbah, Mohamad Assaad:
Asymptotic analysis of downlink multi-cell systems with partial CSIT. 1307-1311 - Kumar Viswanatha, Emrah Akyol
Combinatorial Message Sharing for a refined multiple descriptions achievable region. 1312-1316 - Michael Drmota, Wojciech Szpankowski:
Analysis of a Block Arithmetic Coding: Discrete divide and conquer recurrences. 1317-1321 - Yuriy A. Reznik:
Codes for unordered sets of words. 1322-1326 - Hiroki Koga, Mitsuharu Arimura, Ken-ichi Iwata:
Coding theorems on the worst-case redundancy of fixed-length coding for a general source. 1327-1331 - Elchanan Zwecher, Dana Porrat:
Training over sparse multipath channels in the low SNR regime. 1332-1336 - Wei-Cheng Kuo, Chih-Chun Wang:
On the capacity of 2-user 1-hop relay erasure networks - The union of feedback, scheduling, opportunistic routing, and network coding. 1337-1341 - Farzad Parvaresh, Raúl H. Etkin:
On computing the capacity of relay networks in polynomial time. 1342-1346 - Lele Wang, Mohammad Naghshvar:
On the capacity of the noncausal relay channel. 1347-1351 - Sadaf Salehkalaibar, Mohammad Reza Aref:
On the transmission of correlated sources over relay channels. 1352-1356 - Erhan Yilmaz, Raymond Knopp:
Hash-and-forward relaying for two-way relay channel. 1357-1361 - Yihong Wu, Shlomo Shamai
Degrees of freedom of the interference channel: A general formula. 1362-1366 - Sung Ho Chae, Sae-Young Chung:
On the degrees of freedom of rank deficient interference channels. 1367-1371 - Ali Tajer, Xiaodong Wang:
(n, K)-user interference channels: Degrees of freedom. 1372-1376 - V. Sreekanth Annapureddy, Aly El Gamal, Venugopal V. Veeravalli:
Degrees of freedom of cooperative interference networks. 1377-1381 - Yuanpeng Liu, Elza Erkip
On the sum capacity of K-user cascade Gaussian Z-interference channel. 1382-1386 - Kazushi Mimura, Tadashi Wadayama, Toshiyuki Tanaka, Yoshiyuki Kabashima:
Average error exponent of undetected error probability of binary matrix ensembles. 1387-1391 - Ishay Haviv, Michael Langberg:
Beating the Gilbert-Varshamov bound for online channels. 1392-1396 - Alexey A. Frolov
Upper and lower bounds on the minimum distance of expander codes. 1397-1401 - Ozgun Y. Bursalioglu, Giuseppe Caire:
Is Unequal Error Protection useful? 1402-1406 - Amir Ingber, Ram Zamir, Meir Feder:
The dispersion of infinite constellations. 1407-1411 - Reinhard Heckel, Helmut Bölcskei:
Compressive identification of linear operators. 1412-1416 - Yuzhe Jin, Bhaskar D. Rao:
MultiPass lasso algorithms for sparse signal recovery. 1417-1421 - Christoph Studer, Patrick Kuppinger, Graeme Pope, Helmut Bölcskei:
Sparse signal recovery from sparsely corrupted measurements. 1422-1426 - M. Amin Khajehnejad, Juhwan Yoo, Animashree Anandkumar, Babak Hassibi:
Summary based structures with improved sublinear recovery for compressed sensing. 1427-1431 - Kazushi Mimura:
Generating functional analysis of iterative algorithms for compressed sensing. 1432-1436 - Majid Gerami, Ming Xiao, Mikael Skoglund:
Optimal-cost repair in multi-hop distributed storage systems. 1437-1441 - Kenneth W. Shum, Yuchong Hu:
Exact minimum-repair-bandwidth cooperative regenerating codes for distributed storage systems. 1442-1446 - Derek Leong
Distributed storage allocations for optimal delay. 1447-1451 - Sameer Pawar, Salim Y. El Rouayheb, Kannan Ramchandran:
Securing dynamic distributed storage systems from malicious nodes. 1452-1456 - Ankit Singh Rawat
Update efficient codes for distributed storage. 1457-1461 - Todd P. Coleman, Aurel A. Lazar:
Special session on information theory and neuroscience at ISIT 2011. 1462-1463 - Zhongwei Si, Ragnar Thobaben, Mikael Skoglund:
Bilayer LDPC convolutional codes for half-duplex relay channels. 1464-1468 - Marina Ivashkina, Iryna Andriyanova, Pablo Piantanida, Charly Poulliat:
Block-Markov LDPC scheme for half- and full-duplex erasure relay channel. 1469-1473 - Hironori Uchikawa, Kenta Kasai, Kohichi Sakaniwa:
Spatially coupled LDPC codes for decode-and-forward in erasure relay channel. 1474-1478 - Marwan Hadri Azmi, Jun Li, Jinhong Yuan
Soft decode-and-forward using LDPC coding in half-duplex relay channels. 1479-1483 - Ali Tajer, H. Vincent Poor
Partial group decoding for interference channels. 1484-1488 - Keigo Takeuchi, Toshiyuki Tanaka, Tsutomu Kawabata:
Improvement of BP-based CDMA multiuser detection by spatial coupling. 1489-1493 - Yue Zhao, Chee Wei Tan
On the sum-capacity with successive decoding in interference channels. 1494-1498 - Wei Kang, Nan Liu:
The Gaussian multiple access diamond channel. 1499-1503 - Ahmad Beirami, Faramarz Fekri
Results on the redundancy of universal compression for finite-length sequences. 1504-1508 - Philippe Jacquet, Wojciech Szpankowski:
Limiting distribution of Lempel Ziv'78 redundancy. 1509-1513 - Vladimir V. V'yugin:
On instability of the ergodic limit theorems with respect to small violations of algorithmic randomness. 1514-1518 - Danny Dubé, Hidetoshi Yokoo:
The universality and linearity of compression by substring enumeration. 1519-1523 - Arash Behboodi, Pablo Piantanida:
On the asymptotic error probability of composite relay channels. 1524-1528 - Si-Hyeon Lee, Sae-Young Chung:
Capacity of less noisy relay channels. 1529-1533 - Mahdi Zamani, Amir K. Khandani:
On the maximum achievable rates in the decode-forward diamond channel. 1534-1538 - Kiran T. Gowda, David Gesbert
Interference mitigation in femto-macro coexistence with two-way relay channel. 1539-1543 - Yanlin Geng, Amin Aminzadeh Gohari
The capacity region for two classes of product broadcast channels. 1544-1548 - Marios Gatzianas
Capacity-achieving encoding for the broadcast erasure channel with multiple users. 1549-1553 - Arun Padakandla, Sandeep S. Pradhan:
Nested linear codes achieve Marton's inner bound for general broadcast channels. 1554-1558 - Hon Fah Chong, Ying-Chang Liang
Capacity region of a class of deterministic K-receiver broadcast channels with degraded message sets. 1559-1563 - Arkadii G. D'yachkov, Julia Volkova, Nikita Polyanskii
DNA codes for generalized stem similarity. 1564-1568 - Young-Sik Kim
New construction of DNA codes with constant-GC contents from binary sequences with ideal autocorrelation. 1569-1573 - Hiroshi Kamabe:
Outfix-free and intercode constraints for DNA sequences. 1574-1578 - Victor Buttigieg, Johann A. Briffa
Codebook and marker sequence design for synchronization-correcting codes. 1579-1583 - Adel Javanmard, Andrea Montanari:
Localization from incomplete noisy distance measurements. 1584-1588 - Rami R. Hagege, Joseph M. Francos:
Universal manifold embedding for geometric deformations estimation. 1589-1593 - Marat V. Burnashev, Aslan Tchamkerten:
Estimating a Gaussian random walk first-passage time from noisy or delayed observations. 1594-1597 - Jayakrishnan Unnikrishnan
Model-fitting in the presence of outliers. 1598-1602 - Tarik Kaced:
Almost-perfect secret sharing. 1603-1607 - Po-Hsiang Lai, Joseph A. O'Sullivan
Toward optimal trade-off between identification and secrecy-key binding using linear codes. 1608-1612 - Siu-Wai Ho
Error-free perfect-secrecy systems. 1613-1617 - Sudeep Kamath, Urs Niesen, Piyush Gupta:
The capacity per unit energy of large wireless networks. 1618-1622 - Andrés Altieri, Leonardo Rey Vega
Cooperative strategies for interference-limited wireless networks. 1623-1627 - Mohit Thakur, Nadia Fawaz
On the geometry of wireless network multicast in 2-D. 1628-1632 - Sreeram Kannan, Adnan Raja, Pramod Viswanath:
Local phy + global flow: A layering principle for wireless networks. 1633-1637 - Xiaojie Zhang, Paul H. Siegel:
Adaptive cut generation for improved linear programming decoding of binary linear codes. 1638-1642 - Eirik Rosnes, Michael Helmling, Alexandre Graell i Amat
Pseudocodewords of linear programming decoding of 3-dimensional turbo codes. 1643-1647 - Michael Chertkov
Polytope of correct (linear programming) decoding and low-weight pseudo-codewords. 1648-1652 - Mayur Punekar, Mark F. Flanagan
Trellis-based check node processing for low-complexity nonbinary LP decoding. 1653-1657 - Stojan Z. Denic:
Robust incremental redundancy hybrid ARQ coding for channels with unknown interference. 1658-1662 - Ralf R. Müller:
On random CDMA with constant envelope. 1663-1667 - Nir Weinberger, Meir Feder:
Universal decoding over Gaussian fading channels - metric calculation and performance evaluation. 1668-1672 - Jiening Zhan, Uri Erez, Michael Gastpar, Bobak Nazer:
Mitigating interference with integer-forcing architectures. 1673-1677 - Kittipong Kittichokechai
Secure source coding with action-dependent side information. 1678-1682 - Yeow-Khiang Chia, Tsachy Weissman:
Cascade and Triangular source coding with causal side information. 1683-1687 - Ebrahim MolavianJazi, J. Nicholas Laneman:
Source-channel coding tradeoff in multiple antenna multiple access channels. 1688-1692 - Jun Chen, Jia Wang:
Vector Gaussian multiple description coding with individual and central distortion constraints. 1693-1697 - Adnan Raja, Pramod Viswanath:
Compress-and-forward scheme for a relay network: Approximate optimality and connection to algebraic flows. 1698-1702 - Shirin Saeedi Bidokhti, Christina Fragouli:
Degraded two-message multicast over graphs. 1703-1707 - Chih-Chun Wang, Jaemin Han:
Common information of random linear network coding over a 1-hop broadcast packet erasure channel. 1708-1712 - Brett Hern, Krishna R. Narayanan:
Multilevel coding schemes for compute-and-forward. 1713-1717 - Alon Shalev Housfater, Teng Joon Lim
Mean-variance optimal linear precoders for random MISO broadcast channels. 1718-1722 - Yuval Avner, Benjamin M. Zaidel, Shlomo Shamai
On vector perturbation precoding for the MIMO Gaussian broadcast channel. 1723-1727 - Junyoung Nam, Giuseppe Caire, Jeongseok Ha:
Block triangularization: A new linear precoding strategy for Gaussian MIMO BC. 1728-1732 - Yang Li, Aria Nosratinia
Broadcasting on the Grassmannian: Enhancing the multiplexing gain. 1733-1737 - Hongchao Zhou, Jehoshua Bruck
Linear extractors for extracting randomness from noisy sources. 1738-1742 - Aria Ghasemian Sahebi, S. Sandeep Pradhan:
On the capacity of Abelian group codes over discrete memoryless channels. 1743-1747 - Ravi Teja Sukhavasi, Babak Hassibi:
Linear error correcting codes with anytime reliability. 1748-1752 - Arya Mazumdar, Alexander Barg:
Channels with intermittent errors. 1753-1757 - Thomas M. Cover:
On the St. Petersburg paradox. 1758-1761 - Paul Cuff, Thomas M. Cover, Gowtham Kumar, Lei Zhao:
A lattice of gambles. 1762-1766 - Jihad Fahs, Ibrahim C. Abou-Faycal:
On the detrimental effect of assuming a linear model for non-linear AWGN channels. 1767-1771 - Andrew R. Barron, Antony Joseph:
Analysis of fast sparse superposition codes. 1772-1776 - Mitsugu Iwamoto, Kazuo Ohta:
Security notions for information theoretically secure encryptions. 1777-1781 - Ye Wang, Prakash Ishwar
On unconditionally secure multi-party sampling from scratch1. 1782-1786 - Son Hoang Dau
Index coding and error correction. 1787-1791 - Gérard D. Cohen, Carlos Munuera
The average radius of codes: Survey and new results. 1792-1795 - Jeongho Jeon, Anthony Ephremides:
The stability region of random multiple access under stochastic energy harvesting. 1796-1800 - Hassan Halabian, Ioannis Lambadaris, Chung-Horng Lung:
On the stability region of multi-queue multi-server queueing systems with stationary channel distribution. 1801-1805 - Fatemeh Hamidi-Sepehr, Yi Cai, Henry D. Pfister
Queueing behavior of the Gilbert-Elliott channel: BCH codes and Poisson arrivals. 1806-1810 - Vineeth Bala Sukumaran, Utpal Mukherji:
Queueing delay - error probability tradeoff for point-to-point channels with fixed length block codes. 1811-1815 - Pablo M. Olmos, Rüdiger L. Urbanke:
Scaling behavior of convolutional LDPC ensembles over the BEC. 1816-1820 - Jian-Jia Weng, Mu-Chen Wu, Chung-Hsuan Wang, Yi-Sheng Su, Tsung-Cheng Wu:
Dynamic scheduling-aided decoding strategies for LDPC convolutional codes with rational parity-check matrices. 1821-1825 - Michael Lentmaier, Maria Mellado Prenda, Gerhard P. Fettweis:
Efficient message passing scheduling for terminated LDPC convolutional codes. 1826-1830 - Konstantin Kondrashov, Victor V. Zyablov
On the lower bound of the free distance of partial unit memory codes based on LDPC Codes. 1831-1835 - Yair Yona, Meir Feder:
The fundamental limits of infinite constellations in MIMO fading channels. 1836-1840 - Qiuliang Xie, Jian Song, Fang Yang, Zhixing Yang:
Near-capacity BICM-ID for MIMO channels. 1841-1845 - G. R. Jithamithra, B. Sundar Rajan:
Minimizing the complexity of fast sphere decoding of STBCs. 1846-1850 - Victoria Kostina, Sergey Loyka:
Performance analysis of coded V-BLAST with optimum power and rate allocation. 1851-1855 - Milad Sefidgaran, Aslan Tchamkerten:
Computing a function of correlated Sources: A rate region. 1856-1860 - Shizheng Li, Aditya Ramamoorthy:
Algebraic codes for Slepian-Wolf code design. 1861-1865 - Rajiv Soundararajan, Sriram Vishwanath:
Multi-terminal source coding through a relay. 1866-1870 - Jin Meng, En-Hui Yang, Zhen Zhang:
Tree interactive encoding and decoding: Conditionally Φ-mixing sources. 1871-1875 - Or Ordentlich, Jiening Zhan, Uri Erez, Michael Gastpar, Bobak Nazer:
Practical code design for compute-and-forward. 1876-1880 - Young-Han Kim, Sung Hoon Lim
Relaying via hybrid coding. 1881-1885 - Ahmad Abu Al Haija, Mai Vu:
A half-duplex cooperative scheme with partial decode-forward relaying. 1886-1890 - Rafael F. Wyrembelski, Holger Boche:
How to achieve privacy in bidirectional relay networks. 1891-1895 - Ehsan Ardestanizadeh, Paolo Minero, Massimo Franceschetti:
LQG control approach to Gaussian broadcast channels with feedback. 1896-1900 - Lei Zhang, Dongning Guo:
Wireless peer-to-peer mutual broadcast via sparse recovery. 1901-1905 - Tharaka Samarasinghe
Vector broadcast channels: Optimal threshold selection problem. 1906-1910 - Sreeram Kannan, Adnan Raja, Pramod Viswanath:
Approximately optimal broadcasting-cum-multicasting in wireless networks. 1911-1915 - Felice Manganiello
On conjugacy classes of subgroups of the general linear group and cyclic orbit codes. 1916-1920 - Mostafa Esmaeili, Morteza Esmaeili, T. Aaron Gulliver
High rate fibonacci polynomial codes. 1921-1924 - Navin Kashyap, Andrew Thangaraj
On the treewidth of MDS and Reed-Muller codes. 1925-1929 - Prasad Krishnan, B. Sundar Rajan:
Network-error correcting codes using small fields. 1930-1934 - Tarik Kaced, Andrei E. Romashchenko
On essentially conditional information inequalities. 1935-1939 - Ashok Kumar Moses, Rajesh Sundaresan:
Further results on geometric properties of a family of relative entropies. 1940-1944 - Naresh Sharma, Smarajit Das, Siddharth Muthukrishnan:
Entropy power inequality for a family of discrete random variables. 1945-1949 - Chao Tian:
Inequalities for entropies of sets of subsets of random variables. 1950-1954 - Lifeng Lai, Yingbin Liang, Wenliang Du, Shlomo Shamai
Secret sharing via noisy broadcast channels. 1955-1959 - Mahdi Jafari Siavoshani, Shaunak Mishra, Suhas N. Diggavi, Christina Fragouli:
Group secret key agreement over state-dependent wireless broadcast channels. 1960-1964 - Ryutaroh Matsumoto
Secure multiplex coding with a common message. 1965-1969 - Somayeh Salimi, Mahmoud Salmasizadeh, Mohammad Reza Aref:
Key agreement over multiple access channel using feedback channel. 1970-1974 - I-Hong Hou, Piyush Gupta:
Distributed resource allocation for proportional fairness in multi-band wireless systems. 1975-1979 - Vahid Pourahmadi, Abolfazl S. Motahari, Amir K. Khandani:
Degrees of freedom of two-user MIMO networks with random medium access control mechanism. 1980-1984 - Radhika Gowaikar, Christopher Lott, Rashid Attar, Donna Ghosh, Kambiz Azarian, Amin Jafarian:
Distributed scheduling for wireless networks. 1985-1989 - Randa Zakhour, Stephen V. Hanly
Min-max fair coordinated beamforming via large systems analysis. 1990-1994 - Dung Viet Nguyen, Bane Vasic, Michael W. Marcellin:
Two-bit bit flipping decoding of LDPC codes. 1995-1999 - Henk Wymeersch
Uniformly reweighted belief propagation: A factor graph approach. 2000-2004 - Nicholas Kalouptsidis, Nicholas Kolokotronis
Fast decoding of regular LDPC codes using greedy approximation algorithms. 2005-2009 - Ryuhei Mori
Connection between annealed free energy and belief propagation on random factor graph ensembles. 2010-2014 - An Liu, Youjian Liu
Polite water-filling for the boundary of the capacity/achievable regions of MIMO MAC/BC/interference networks. 2015-2019 - Erwin Riegler, Veniamin I. Morgenshtern
Noncoherent SIMO pre-log via resolution of singularities. 2020-2024 - Lakshmi Prasad Natarajan, B. Sundar Rajan:
Distributed STBCs with full-diversity partial interference cancellation decoding. 2025-2029 - Laura Luzzi, Frédérique E. Oggier:
A family of fast-decodable MIDO codes from crossed-product algebras over ℚ. 2030-2034 - Yeow-Khiang Chia, Himanshu Asnani, Tsachy Weissman:
Multi-terminal source coding with action dependent side information. 2035-2039 - Thomas A. Courtade, Richard D. Wesel:
Multiterminal source coding with an entropy-based distortion measure. 2040-2044 - Chen Avin
Efficient distributed source coding for multiple receivers via matrix sparsification. 2045-2049 - Jun Chen, Jia Wang:
On the vector Gaussian CEO problem. 2050-2054 - Silas L. Fong
Practical network coding on three-node point-to-point relay networks. 2055-2059 - Neevan Ramalingam, Zhengdao Wang
SUperposition Noisy Network Coding. 2060-2064 - Majid Nasiri Khormuji, Mikael Skoglund:
Noisy analog network coding for the two-way relay channel. 2065-2069 - Tao Yang, Ingmar Land, Tao Huang
Distance properties and performance of physical layer network coding with binary linear codes for Gaussian two-way relay channels. 2070-2074 - Shraga I. Bross, Yossef Steinberg
The state-dependent interference channel with states available at a cribbing encoder and one receiver. 2075-2079 - Hideki Yagi, H. Vincent Poor
Multi-level rate-splitting for synchronous and asynchronous interference channels. 2080-2084 - Jörg Bühler, Gerhard Wunder:
On interference alignment and the deterministic capacity for cellular channels with weak symmetric cross links. 2085-2089 - Bernd Bandemer, Abbas El Gamal:
Communication with disturbance constraints. 2090-2094 - Farzad Farnoud
Decomposing permutations via cost-constrained transpositions. 2095-2099 - Min-Zheng Shieh
Computing the ball size of frequency permutations under chebyshev distance. 2100-2104 - Nikolaos Makriyannis
Some constructions of maximal witness codes. 2105-2109 - Chiranjib Choudhuri, Young-Han Kim, Urbashi Mitra:
Causal state amplification. 2110-2114 - Yang Gao, Ertem Tuncel
Separate source-channel coding for broadcasting correlated Gaussians. 2115-2119 - Daniel Zahavi, Ron Dabora:
Capacity theorems for the fading interference channel with a relay and feedback links. 2120-2124 - Amir Ahmadi-Javid:
An information-theoretic approach to constructing coherent risk measures. 2125-2127 - Amit Berman
Constrained Flash memory programming. 2128-2132 - Moshe Schwartz
Quasi-cross lattice tilings with applications to flash memory. 2133-2137 - Riki Suzuki, Tadashi Wadayama:
Layered Index-less Indexed Flash Codes for improving average performance. 2138-2142 - Hongchao Zhou, Anxiao Jiang, Jehoshua Bruck
Error-correcting schemes with dynamic thresholds in nonvolatile memories. 2143-2147 - Yajun Mei:
Quickest detection in censoring sensor networks. 2148-2152 - Shreeshankar Bodas, Devavrat Shah:
Fast averaging. 2153-2157 - Claus Pedersen, Troels Pedersen, Bernard H. Fleury:
A variational message passing algorithm for sensor self-localization in wireless networks. 2158-2162 - Chinmoy Kundu, Sumit Kundu, Gianluigi Ferrari
Distributed detection using MRC with censored sensors and rayleigh faded communications. 2163-2167 - Sundeep Rangan:
Generalized approximate message passing for estimation with random linear mixing. 2168-2172 - Erman Ayday, Faramarz Fekri
Application of belief propagation to trust and reputation management. 2173-2177 - Ali Al-Bashabsheh, Yongyi Mao
Normal factor graphs: A diagrammatic approach to linear algebra. 2178-2182 - Pascal O. Vontobel:
A factor-graph approach to Lagrangian and Hamiltonian dynamics. 2183-2187 - Parthajit Mohapatra, Chandra R. Murthy
On the generalized degrees of freedom of the K-user symmetric MIMO Gaussian interference channel. 2188-2192 - Sanjay Karmakar, Mahesh K. Varanasi:
Capacity of the MIMO interference channel to within a constant gap. 2193-2197 - Sanjay Karmakar, Mahesh K. Varanasi:
The generalized degrees of freedom of the MIMO interference channel. 2198-2202 - Chinmay S. Vaze, Mahesh K. Varanasi:
The degrees of freedom region of the MIMO interference channel with delayed CSIT. 2203-2207 - Craig Wilson, Venugopal V. Veeravalli:
A convergent version of Max SINR for the MIMO interference channel. 2208-2212 - Onur Güngör, Onur Ozan Koyluoglu, Hesham El Gamal, Can Emre Koksal:
Proactive source coding. 2213-2217 - András György
Near-optimal rates for limited-delay universal lossy source coding. 2218-2222 - Ting-Yi Wu, Po-Ning Chen
On the construction and MAP decoding of optimal variable-length error-correcting codes. 2223-2227 - Claudio Weidmann:
Characterizing compressibility with Lorenz curves. 2228-2232 - Jan Østergaard
Incremental refinement using a Gaussian test channel. 2233-2237 - Lawrence Ong
The finite field multi-way relay channel with correlated sources: The three-user case. 2238-2242 - Sang Joon Kim, Besma Smida
Lattice strategies for a multi-pair bi-directional relay network. 2243-2247 - Silas L. Fong
Feedback enlarges capacity region of two-way relay channel. 2248-2252 - Tao Yang, Xiaojun Yuan, Ping Li
A new eigen-direction alignment algorithm for physical-layer network coding in MIMO two-way relay channels. 2253-2257 - Sirin Nitinawarat:
On maximal error capacity regions of Symmetric Gaussian Multiple-Access Channels. 2258-2262 - Jun Muramatsu
Construction of multiple access channel codes based on hash property. 2263-2267 - Himanshu Asnani, Haim H. Permuter
Multiple access channel with partial and controlled cribbing encoders. 2268-2272 - Lóránt Farkas, Tamás Kói
Capacity regions of discrete asynchronous multiple access channels. 2273-2277 - Vinay A. Vaishampayan
On the capacity of a hybrid broadcast multiple access system for WDM networks. 2278-2282 - Woomyoung Park, Alexander Barg:
The ordered Hamming metric and ordered symmetric channels. 2283-2287 - Natalia Silberstein, Tuvi Etzion:
Codes and designs related to lifted MRD codes. 2288-2292 - Rachit Agarwal:
Combinatorial lower bound for list decoding of codes on finite-field Grassmannian. 2293-2297 - Renaud-Alexandre Pitaval, Olav Tirkkonen
Density and bounds for Grassmannian codes with chordal distance. 2298-2302 - Ilya Dumer
Soft-decision list decoding of Reed-Muller codes with linear complexity. 2303-2307 - Samet Oymak, M. Amin Khajehnejad, Babak Hassibi:
Subspace expanders and matrix rank minimization. 2308-2312 - Yudong Chen, Ali Jalali, Sujay Sanghavi, Constantine Caramanis
Low-rank matrix recovery from errors and erasures. 2313-2317 - Samet Oymak, Karthik Mohan, Maryam Fazel, Babak Hassibi:
A simplified approach to recovery conditions for low rank matrices. 2318-2322 - Samet Oymak, Babak Hassibi:
Tight recovery thresholds and robustness analysis for nuclear norm minimization. 2323-2327 - Antonia M. Tulino
Support recovery with sparsely sampled free random matrices. 2328-2332 - Anxiao Jiang, Hongchao Zhou, Zhiying Wang
Patterned cells for phase change memories. 2333-2337 - Sameer Pawar, Nima Noorshams, Salim Y. El Rouayheb, Kannan Ramchandran:
DRESS codes for the storage cloud: Simple randomized constructions. 2338-2342 - Artyom Sharov, Ron M. Roth:
Bounds and constructions for granular media coding. 2343-2347 - Yuval Cassuto, Simon Litsyn:
Symbol-pair codes: Algebraic constructions and asymptotic bounds. 2348-2352 - Qian Guo
On systematic encoding for Blaum-Roth codes. 2353-2357 - Jubin Jose, Sriram Vishwanath:
Network control: A rate-distortion perspective. 2358-2362 - Ramachandran Rajesh
Information capacity of energy harvesting sensor nodes. 2363-2367 - Ka-Hung Hui, Tianyi Li, Dongning Guo, Randall A. Berry
Exploiting peer-to-peer state exchange for distributed medium access control. 2368-2372 - Vijay G. Subramanian
Delay performance of CSMA in networks with bounded degree conflict graphs. 2373-2377 - An Liu, Youjian Liu
Polite water-filling for weighted sum-rate maximization in MIMO B-MAC networks under multiple linear constraints. 2378-2382 - Shiva Kumar Planjery, Bane Vasic, David Declercq:
Decimation-enhanced finite alphabet iterative decoders for LDPC codes on the BSC. 2383-2387 - Daniele Capirone, Alberto Tarable:
Optimal and suboptimal receivers for maximal-rate root-LDPC codes over MIMO block-fading channels. 2388-2392 - Vishwambhar Rathi, Rüdiger L. Urbanke, Mattias Andersson, Mikael Skoglund:
Rate-equivocation optimal spatially coupled LDPC codes for the BEC wiretap channel. 2393-2397 - Pablo M. Olmos, Juan José Murillo-Fuentes
Capacity achieving LDPC ensembles for the TEP decoder in erasure channels. 2398-2402 - Stefano Rini, Daniela Tuninetti
A new capacity result for the Z-Gaussian cognitive interference channel. 2403-2407 - Hsuan-Yi Chu, Hsuan-Jung Su
On the capacity region of the cognitive interference channel with unidirectional destination cooperation. 2408-2412 - Goochul Chung, Sriram Vishwanath:
Capacity of a class of overlay cognitive MAC radios. 2413-2417 - Ezio Biglieri:
Effect of uncertainties in modeling interferences in coherent and energy detectors for spectrum sensing. 2418-2421 - Takahiro Ota, Hiroyoshi Morita, Hirotada Fukae:
On the dynamic construction of an antidictionary with linear complexity. 2422-2426 - Rudolf Mathar, Anke Schmeink:
A bio-inspired approach to condensing information. 2427-2431 - Pulkit Grover
The "source-simplification" aspect of signaling. 2432-2436 - Anatoly Khina
Physical-layer MIMO relaying. 2437-2441 - Erdem Koyuncu
The necessity of relay selection for beamforming in amplify-and-forward networks. 2442-2446 - Sha Yao, Mikael Skoglund, Tùng T. Kim, H. Vincent Poor
Half-duplex relaying based on quantize-and-forward. 2447-2451 - Anatoly Khina
Modulation for MIMO networks with several users. 2452-2456 - Anas Chaaban, Aydin Sezgin
The capacity region of the linear shift deterministic Y-channel. 2457-2461 - I-Hsiang Wang, Sudeep U. Kamath, David N. C. Tse:
Two unicast information flows over linear deterministic networks. 2462-2466 - Mustafa El-Halabi, Tie Liu, Costas N. Georghiades
Secret writing on dirty paper: A deterministic view. 2467-2471 - Caner Nazaroglu
Wireless network simplification: The Gaussian N-relay diamond network. 2472-2476 - Cecilio Pimentel
Minimal trellis for systematic recursive convolutional encoders. 2477-2481 - Masato Tajima, Koji Okino, Takashi Miyagoshi:
Simultaneous code/error-trellis reduction for convolutional codes using shifted code/error-subsequences. 2482-2486 - Antonia Wachter, Vladimir Sidorenko
Partial Unit Memory codes based on Gabidulin codes. 2487-2491 - Qifu Tyler Sun, Sidharth Jaggi, Shuo-Yen Robert Li:
Delay invariant convolutional network codes. 2492-2496 - Hayato Takahashi
Some limits to nonparametric estimation for ergodic processes. 2497-2498 - Farid Movahedi Naini, Olivier Dousse, Patrick Thiran, Martin Vetterli
Population size estimation using a few individuals as agents. 2499-2503 - Arian Shoari, Alireza Seyedi:
Target localization with binary observations: Effect of censoring non-detecting sensors. 2504-2508 - Boris Ryabko, Daniil Ryabko:
Confidence sets in time-series filtering. 2509-2511 - Christoph Bunte, Amos Lapidoth:
Computing the capacity of rewritable memories. 2512-2516 - Ryan Gabrys, Lara Dolecek:
Characterizing capacity achieving write once memory codes for multilevel flash memories. 2517-2521 - Anxiao Jiang, Hongchao Zhou, Jehoshua Bruck
Variable-level cells for nonvolatile memories. 2522-2526 - Lele Wang, Young-Han Kim:
Sum-capacity of multiple-write noisy memory. 2527-2531 - Anthony Fanous, Anthony Ephremides:
Transmission control of two-user slotted ALOHA over Gilbert-Elliott channel: Stability and delay analysis. 2532-2536 - Güner D. Çelik, Sem C. Borst, Phil Whiting, Eytan H. Modiano:
Variable frame based Max-Weight algorithms for networks with switchover delay. 2537-2541 - Siddhartha Banerjee, Piyush Gupta, Sanjay Shakkottai:
Towards a queueing-based framework for in-network function computation. 2542-2546 - Florin Ciucu:
On the scaling of non-asymptotic capacity in multi-access networks with bursty traffic. 2547-2551 - Aravind R. Iyengar, Paul H. Siegel, Rüdiger L. Urbanke, Jack K. Wolf:
Windowed decoding of spatially coupled codes. 2552-2556 - Hans Kurzweil, Mathis Seidl, Johannes B. Huber:
Reduced-complexity collaborative decoding of interleaved Reed-Solomon and Gabidulin codes. 2557-2561 - Shrinivas Kudekar, Kenta Kasai:
Threshold saturation on channels with memory via spatial coupling. 2562-2566 - Arvind Yedla, Henry D. Pfister
Universality for the noisy Slepian-Wolf problem via spatial coupling. 2567-2571 - Adrian Agustin
Weighted sum rate maximization for the MIMO X channel through MMSE precoding. 2572-2576 - Liangbin Li, Hamid Jafarkhani
When Alamouti codes meet interference alignment: Transmission schemes for two-user X channel. 2577-2581 - Hossein Najafi, Mehdi Torbatian, Mohamed Oussama Damen:
Interference alignment over asynchronous X networks. 2582-2586 - Wolfgang Kreitmeier, Tamás Linder:
Scalar quantization with Rényi entropy constraint. 2587-2591 - Tobias Koch
Asymmetric quantizers are better at low SNR. 2592-2596 - Emrah Akyol
A necessary and sufficient condition for transform optimality in source coding. 2597-2601 - Georg Zeitler, Andrew C. Singer
Low-precision A/d conversion for maximum information rate in channels with memory. 2602-2606 - Caijun Zhong
Ergodic sum rate analysis of Rayleigh product MIMO channels with linear MMSE receiver. 2607-2611 - Miguel R. D. Rodrigues:
On the constrained capacity of multi-antenna fading coherent channels with discrete inputs. 2612-2616 - Sreeram Kannan, Pramod Viswanath:
Multiple-unicast in fading wireless networks: A separation scheme is approximately optimal. 2617-2621 - Ivana Maric, Andrea J. Goldsmith:
Diversity-multiplexing tradeoff in a MIMO Gaussian interference channel with a relay. 2622-2626 - Stefano Rini, Daniela Tuninetti
Capacity to within 3 bits for a class of Gaussian Interference Channels with a Cognitive Relay. 2627-2631 - Stefano Rini, Daniela Tuninetti
The capacity of the interference channel with a cognitive relay in strong interference. 2632-2636 - Dong-Sup Jin, Jong-Seon No, Dong-Joon Shin:
Interference alignment aided by relays for the quasi-static X channel. 2637-2641 - Chen Feng
Lattice network coding via signal codes. 2642-2646 - Shenghao Yang, Raymond W. Yeung:
Coding for a network coded fountain. 2647-2651 - Rathinakumar Appuswamy, Massimo Franceschetti, Nikhil Karamchandani, Kenneth Zeger:
Linear coding for network computing. 2652-2655 - Danilo Silva
On network error correction under a secret key model. 2656-2660 - Matthew Malloy, Robert D. Nowak:
Sequential analysis in high-dimensional multiple testing and sparse recovery. 2661-2665 - Mohammad Naghshvar, Tara Javidi
Performance bounds for active sequential hypothesis testing. 2666-2670 - Evgueni A. Haroutunian, Aram Yessayan:
On reliability approach to multiple hypotheses testing and to identification of probability distributions of two stochastically related objects. 2671-2675 - Alexander G. Tartakovsky
Nearly minimax changepoint detection procedures. 2676-2680 - Morgan Barbier, Paulo S. L. M. Barreto:
Key reduction of McEliece's cryptosystem using list decoding. 2681-2685 - Konstantinos Limniotis
Constructing Boolean functions in odd number of variables with maximum algebraic immunity. 2686-2690 - Oscar Moreno, Andrew Z. Tirkel
Multi-dimensional arrays for watermarking. 2691-2695 - Marcel Fernandez, Grigory Kabatiansky, José Moreira:
Almost separating and almost secure frameproof codes. 2696-2700 - Ephraim Zehavi
Bargaining Solution for Partial Orthogonal transmission over frequency selective interference channel. 2701-2705 - Srinivas Yerramalli, Rahul Jain
Coalition games for transmitter cooperation in wireless networks. 2706-2710 - Gaurav S. Kasbekar, Saswati Sarkar:
Spectrum pricing games with arbitrary bandwidth availability probabilities. 2711-2715 - Jie Gao, Sergiy A. Vorobyov, Hai Jiang
Mixed strategy Nash equilibrium in two-user resource allocation games. 2716-2720 - Milos Ivkovic, Ashish Raj:
Global estimation of anatomical connection strength in diffusion MRI tractography by message-passing. 2721-2725 - Jiadong Wang, Lara Dolecek, Zhengya Zhang
Absorbing set spectrum approach for practical code design. 2726-2730 - Valerio Bioglio
An optimal partial decoding algorithm for rateless codes. 2731-2735 - Nikolaos Thomos
Degree distribution optimization in Raptor network coding. 2736-2740 - Peyman Razaghi, Giuseppe Caire:
A nonlinear approach to interference alignment. 2741-2745 - Jonathan Starr, Omar El Ayach, Robert W. Heath Jr.
Interference alignment with per-antenna power constraints. 2746-2750 - Tiangao Gou, Syed Ali Jafar
Aligned interference neutralization and the degrees of freedom of the 2 × 2 × 2 interference channel. 2751-2755 - Hamed Maleki, Syed Ali Jafar
Retrospective interference alignment. 2756-2760 - Shun Watanabe
The rate-distortion function for product of two sources with side-information at decoders. 2761-2765 - Yang Yang, Zixiang Xiong:
Distributed compression of linear functions: Partial sum-rate tightness and gap to optimal sum-rate. 2766-2770 - Michael Luby, Mohammad Amin Shokrollahi:
Slepian-Wolf type problems on the erasure channel. 2771-2775 - David L. Neuhoff, Sandeep S. Pradhan:
Information rates of densely sampled Gaussian data. 2776-2780 - Arun Pachai Kannu, Philip Schniter:
On communication over unknown sparse frequency-selective block-fading channels. 2781-2785 - A. Taufiq Asyhari
Nearest neighbour decoding and pilot-aided channel estimation in stationary Gaussian flat-fading channels. 2786-2790 - Peter Jung:
On the Szegö-asymptotics for doubly-dispersive Gaussian channels. 2791-2795 - Jakob Hoydis, Mérouane Debbah, Mari Kobayashi:
Asymptotic moments for interference mitigation in correlated fading channels. 2796-2800 - Abdellatif Zaidi, Pablo Piantanida, Shlomo Shamai
Multiple access channel with states known noncausally at one encoder and only strictly causally at the other encoder. 2801-2805 - Min Li
Leveraging strictly causal state information at the encoders for multiple access channels. 2806-2810 - Uria Basher, Avihay Shirazi, Haim H. Permuter
Multiple-access channel with delayed state information via directed information. 2811-2815 - Shrinivas Kudekar, Kenta Kasai:
Spatially coupled codes over the multiple access channel. 2816-2820 - Roope Vehkalahti
A general framework for constructing fast-decodable asymmetric space-time codes. 2821-2825 - Teja Damodaram Bavirisetti, B. Sundar Rajan:
Maximum rate of 3- and 4-real-symbol ML decodable unitary weight STBCs. 2826-2830 - Roope Vehkalahti
An algebraic look into MAC-DMT of lattice space-time codes. 2831-2835 - Joakim Jaldén
The complexity of sphere decoding perfect codes under a vanishing gap to ML performance. 2836-2840 - Tareq Y. Al-Naffouri, Ahmed Abdul Quadeer
Impulsive noise estimation and cancellation in DSL using orthogonal clustering. 2841-2845 - Fabian Lim, Aleksandar Kavcic:
Computing reliability distributions of windowed max-log-map (MLM) detectors : ISI channels. 2846-2850 - Chih-Hong Wang, Alex S. Leong, Subhrakanti Dey
On diversity orders of distortion outage for coherent multi-access channels. 2851-2855 - Soummya Kar
Distributed detection in noisy sensor networks. 2856-2860 - Vinod M. Prabhakaran, Manoj Prabhakaran:
Assisted common information: Further results. 2861-2865 - Sheng Yang, Pablo Piantanida, Mari Kobayashi, Shlomo Shamai
On the secrecy degrees of freedom of multi-antenna wiretap channels with delayed CSIT. 2866-2870 - Ninoslav Marina
Improved rate-equivocation regions for secure cooperative communication. 2871-2875 - Himanshu Tyagi, Prakash Narayan, Piyush Gupta:
When is a function securely computable? 2876-2880 - Pradeep Chathuranga Weeraddana, Marian Codreanu
Optimal MaxWeight scheduling in a multihop wireless network via branch and bound. 2881-2885 - Fatih Mehmet Ozcelik, Hakan Erkal, Elif Uysal-Biyikoglu
Optimal offline packet scheduling on an energy harvesting broadcast link. 2886-2890 - Hazer Inaltekin
Optimality of binary power-control in a single cell via majorization. 2891-2895 - Albert Guillen i Fabregas
Extremes of random coding error exponents. 2896-2898 - Alfonso Martinez
Random-coding bounds for threshold decoders: Error exponent and saddlepoint approximation. 2899-2903 - Xiao Ma, Jia Liu, Baoming Bai:
New techniques for upper-bounding the MLD performance of binary linear codes. 2904-2908 - Xiaojun Yuan, Li Ping
Achievable rates of MIMO-ISI systems with linear precoding and iterative LMMSE detection. 2909-2913 - Jun Tong
Precoder design and convergence analysis of MIMO systems with Krylov subspace receivers. 2914-2918 - K. Pavan Srinath, B. Sundar Rajan:
A low ML-decoding complexity, full-diversity, full-rate MIMO precoder. 2919-2923 - Dzevdan Kapetanovic, Hei Victor Cheng
Optimal lattices for MIMO precoding. 2924-2928 - Xuechen Chen, Ertem Tuncel
Zero-delay joint source-channel coding for the Gaussian Wyner-Ziv problem. 2929-2933 - Roy Timo, Alex J. Grant
Rate-distortion functions for source coding with complementary side information. 2934-2938 - Behzad Ahmadi, Osvaldo Simeone
Robust coding for lossy computing with receiver-side observation costs. 2939-2943 - Ravi Tandon, Soheil Mohajer, H. Vincent Poor
Cascade source coding with erased side information. 2944-2948 - Saif Khan Mohammed, Emanuele Viterbo
Modulation diversity in fading channels with quantized receiver. 2949-2953 - Ioanna Ioannou, Charalambos D. Charalambous
Outage probability under channel distribution uncertainty. 2954-2958 - Yury Polyanskiy, Sergio Verdú:
Scalar coherent fading channel: Dispersion analysis. 2959-2963 - Amin Jafarian, Sriram Vishwanath:
The two-user Gaussian fading broadcast channel. 2964-2968 - Roy D. Yates, Jing Lei:
Gaussian fading broadcast channels with CSI only at the receivers: An improved constant gap. 2969-2973 - Deli Qiao, Mustafa Cenk Gursoy, Senem Velipasalar:
Effective capacity region and optimal power control for fading broadcast channels. 2974-2978 - Mustapha Amara, Dirk T. M. Slock
Recursive stream selection for CF MU-MIMO BC precoder design. 2979-2983 - George V. Moustakides:
Optimum joint detection and estimation. 2984-2988 - Christian Schlegel, Dmitri V. Truhachev:
Multiple access demodulation in the lifted signal graph with spatial coupling. 2989-2993 - Lionel Fillatre:
Constrained epsilon-equalizer test for multiple hypothesis testing. 2994-2998 - Shrinivas Kudekar, Jason K. Johnson, Michael Chertkov
Linear programming based detectors for two-dimensional intersymbol interference channels. 2999-3003 - Ohad Elishco
Capacity of the Ising channel with feedback. 3004-3008 - Guangyue Han:
Limit theorems for the sample entropy of hidden Markov chains. 3009-3013 - Antonio Galves
Gibbs models with a variable range of interactions on triangle grid. 3014-3016
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-10-31 20:21 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: