Abstract is missing.
- List decoding of polar codesIdo Tal, Alexander Vardy. 1-5 [doi]
- Polar codes with mixed kernelsNoam Presman, Ofer Shapira, Simon Litsyn. 6-10 [doi]
- On the construction of polar codesRamtin Pedarsani, Seyed Hamed Hassani, Ido Tal, Emre Telatar. 11-15 [doi]
- A practical approach to polar codesAli Eslami, Hossein Pishro-Nik. 16-20 [doi]
- Interference alignment and Degrees of Freedom region of cellular sigma channelHuarui Yin, Lei Ke, Zhengdao Wang. 21-25 [doi]
- Interference alignment in multi-carrier interference networksChangxin Shi, Randall A. Berry, Michael L. Honig. 26-30 [doi]
- When is n-pairs information a multicommodity flow?Girish N. Nair. 31-35 [doi]
- Degrees of freedom region for an interference network with general message demandsLei Ke, Aditya Ramamoorthy, Zhengdao Wang, Huarui Yin. 36-40 [doi]
- Fixed-length lossy compression in the finite blocklength regime: Discrete memoryless sourcesVictoria Kostina, Sergio Verdú. 41-45 [doi]
- On distortion bounds for dependent sources over wireless networksShirin Jalali, Michelle Effros. 46-50 [doi]
- Covering point patternsAmos Lapidoth, Andreas Malär, Ligong Wang. 51-55 [doi]
- Characterization of a part of the rate distortion region for the gaussian distributed source codingYasutada Oohama. 56-60 [doi]
- About the reliability function of symmetric channel under list decodingVladimir Blinovsky. 61-63 [doi]
- Zero-error communication via quantum channels and a quantum Lovász θ-functionRunyao Duan, Simone Severini, Andreas Winter. 64-68 [doi]
- Bounds for threshold and majority group testingRudolf Ahlswede, Christian Deppe, Vladimir Lebedev. 69-73 [doi]
- Analog network coding in the generalized high-SNR regimeBinyue Liu, Ning Cai. 74-78 [doi]
- Network Simplification: The Gaussian diamond network with multiple antennasCaner Nazaroglu, B. Javad Ebrahimi, Ayfer Özgür, Christina Fragouli. 79-83 [doi]
- On achievable rate regions of the asymmetric AWGN two-way relay channelLawrence Ong, Christopher M. Kellett, Sarah J. Johnson. 84-88 [doi]
- Approximate capacity of the general gaussian parallel relay networkNicolas Schrammar, Mattias Andersson, Mikael Skoglund. 89-93 [doi]
- An achievable rate region for imperfectly-known two-way relay fading channelsJunwei Zhang, Mustafa Cenk Gursoy. 94-98 [doi]
- Universal quantum state mergingIgor Bjelakovic, Holger Boche, Gisbert Janssen. 99-103 [doi]
- Zero-error subspaces of quantum channelsSamuel L. Braunstein, David W. Kribs, Manas K. Patra. 104-108 [doi]
- Constructing quantum network coding schemes from classical nonlinear protocolsHirotada Kobayashi, Francois Le Gall, Harumichi Nishimura, Martin Rötteler. 109-113 [doi]
- The free space optical interference channelSaikat Guha, Ivan Savov, Mark M. Wilde. 114-118 [doi]
- On the role of diversity in sparsity estimationGalen Reeves, Michael Gastpar. 119-123 [doi]
- Minimum variance estimation for the sparse signal in noise modelSebastian Schmutzhard, Alexander Jung, Franz Hlawatsch. 124-128 [doi]
- p-balls: Minimax mean square errorDavid L. Donoho, Iain Johnstone, Arian Maleki, Andrea Montanari. 129-133 [doi]
- Least favorable compressed sensing problems for first-order methodsArian Maleki, Richard G. Baraniuk. 134-138 [doi]
- LP decodable permutation codes based on linearly constrained permutation matricesTadashi Wadayama, Manabu Hagiwara. 139-143 [doi]
- Sidon sequences and doubly periodic two-dimensional synchronization patternsTuvi Etzion. 144-148 [doi]
- Low complexity two-dimensional weight-constrained codesErik Ordentlich, Ron M. Roth. 149-153 [doi]
- Asymptotic enumeration of binary matrices with bounded row and column weightsErik Ordentlich, Farzad Parvaresh, Ron M. Roth. 154-158 [doi]
- To feed or not to feed backHimanshu Asnani, Haim H. Permuter, Tsachy Weissman. 159-163 [doi]
- Equivalence between reliable feedback communication and nonlinear filter stabilitySiva K. Gorantla, Todd P. Coleman. 164-168 [doi]
- Bounds on the achievable rate of noisy feedback Gaussian channels under linear feedback coding schemeChong Li, Nicola Elia. 169-173 [doi]
- The information theoretic characterization of the capacity of channels with noisy feedbackChong Li, Nicola Elia. 174-178 [doi]
- Binary polar code kernels from code decompositionsNoam Presman, Ofer Shapira, Simon Litsyn. 179-183 [doi]
- Polarization and randomness extractionEmmanuel Abbe. 184-188 [doi]
- Polarization in the presence of memoryEren Sasoglu. 189-193 [doi]
- Polar coding schemes for the AWGN channelEmmanuel Abbe, Andrew R. Barron. 194-198 [doi]
- The degrees of freedom region of the two-user MIMO broadcast channel with delayed CSITChinmay S. Vaze, Mahesh K. Varanasi. 199-203 [doi]
- On the degrees of freedom of the cognitive broadcast channelMohammad Shahmohammadi, Onur Ozan Koyluoglu, Tamer M. S. Khattab, Hesham El Gamal. 204-208 [doi]
- On the degrees of freedom of three-user MIMO broadcast channel with delayed CSITMohammad Javad Abdoli, Akbar Ghasemi, Amir K. Khandani. 209-213 [doi]
- Sum degrees-of-freedom of two-unicast wireless networksIlan Shomorony, Amir Salman Avestimehr. 214-218 [doi]
- Prediction of priors for communication over arbitrarily varying channelsYuval Lomnitz, Meir Feder. 219-223 [doi]
- Finite-memory least squares universal prediction of individual continuous sequencesRonen Dar, Meir Feder. 224-228 [doi]
- Universal communication over modulo-additive individual noise sequence channelsYuval Lomnitz, Meir Feder. 229-233 [doi]
- Network flows for functionsVirag Shah, Bikash Kumar Dey, D. Manjunath. 234-238 [doi]
- Proactive multicasting with predictable demandsJohn Tadrous, Atilla Eryilmaz, Hesham El Gamal. 239-243 [doi]
- On the complementary Index Coding problemMohammad Asad R. Chaudhry, Zakia Asad, Alex Sprintson, Michael Langberg. 244-248 [doi]
- On file sharing over a wireless social networkYi-Ting Chen, Constantine Caramanis, Sanjay Shakkottai. 249-253 [doi]
- Worst-case linear transmit strategies with limited relay information in Gaussian relay networksSteven Corroy, Rudolf Mathar. 254-258 [doi]
- The approximate capacity of the Gaussian N-relay diamond networkUrs Niesen, Suhas N. Diggavi. 259-263 [doi]
- Relay-aided interference neutralization for the multiuser uplink-downlink asymmetric settingJinyuan Chen, Petros Elia, Raymond Knopp. 264-268 [doi]
- Channel capacities of parallel and serial modulo-sum relay networksYouvaraj T. Sagar, Jie Yang 0021, Hyuck M. Kwon. 269-273 [doi]
- On quantum limit of optical communications: Concatenated codes and joint-detection receiversSaikat Guha, Zachary Dutton, Jeffrey H. Shapiro. 274-278 [doi]
- Adaptively correcting quantum errors with entanglementYuichiro Fujiwara, Min-Hsiu Hsieh. 279-283 [doi]
- On capacity of optical channels with coherent detectionHye Won Chung, Saikat Guha, Lizhong Zheng. 284-288 [doi]
- The entropy gain of quantum channelsAlexander S. Holevo. 289-292 [doi]
- Equivalence between minimal generative model graphs and directed information graphsChristopher J. Quinn, Negar Kiyavash, Todd P. Coleman. 293-297 [doi]
- Deinterleaving Markov processes: The finite-memory switch caseGadiel Seroussi, Wojciech Szpankowski, Marcelo J. Weinberger. 298-302 [doi]
- Necessary conditions for consistent set-based graphical model selectionDivyanshu Vats, José M. F. Moura. 303-307 [doi]
- Generating probability distributions using multivalued stochastic relay circuitsDavid Lee, Jehoshua Bruck. 308-312 [doi]
- High-rate maximum runlength constrained coding schemes using nibble replacementKees A. Schouhamer Immink. 313-316 [doi]
- Balanced runlength limited codes using Knuth's algorithmKees A. Schouhamer Immink, Jos H. Weber, Hendrik C. Ferreira. 317-320 [doi]
- Constant weight codes: An approach based on Knuth's balancing methodVitaly Skachek, Kees A. Schouhamer Immink. 321-325 [doi]
- Majority group testing with density testsRudolf Ahlswede, Christian Deppe, Vladimir Lebedev. 326-330 [doi]
- On the capacity of a channel with action-dependent state and reversible inputKittipong Kittichokechai, Tobias J. Oechtering, Mikael Skoglund. 331-335 [doi]
- On the optimal power allocation for additive color noise parallel channels with limited access constraintShih-Wei Wang, Po-Ning Chen, Chung-Hsuan Wang, Wen-Chieh Chang. 336-340 [doi]
- On the capacity of multiplicative finite-field matrix channelsRoberto W. Nobrega, Bartolomeu F. Uchôa Filho, Danilo Silva. 341-345 [doi]
- Achievable rates for channels with deletions and insertionsRamji Venkataramanan, Sekhar Tatikonda, Kannan Ramchandran. 346-350 [doi]
- Asymptotic estimation of error fraction corrected by binary LDPC codePavel Rybin, Victor V. Zyablov. 351-355 [doi]
- Near concavity of the growth rate for coupled LDPC chainsSeyed Hamed Hassani, Nicolas Macris, Ryuhei Mori. 356-360 [doi]
- A reliability-based computation method for the weight distribution of LDPC codes using the probabilistic algorithmMasanori Hirotomo, Masami Mohri, Masakatu Morii. 361-365 [doi]
- A transform approach for computing the ranks of parity-check matrices of quasi-cyclic LDPC codesQiuju Diao, Qin Huang, Shu Lin, Khaled A. S. Abdel-Ghaffar. 366-370 [doi]
- Joint pilot and precoder design for optimal throughputAdriano Pastore, Michael Joham, Javier Rodríguez Fonollosa. 371-375 [doi]
- Interference focusing for simplified optical fiber models with dispersionHassan Ghozlan, Gerhard Kramer. 376-379 [doi]
- Modeling and information rates for synchronization error channelsAravind R. Iyengar, Paul H. Siegel, Jack K. Wolf. 380-384 [doi]
- Bounds on rate distortion with feed forward for stationary and ergodic sourcesIddo Naiss, Haim H. Permuter. 385-389 [doi]
- Stochastic interpretation of universal portfolio and generalized target classesMariko Tsurusaki, Jun-ichi Takeuchi. 390-394 [doi]
- A strong converse in source coding for super-source networksWei-Hsin Gu, Michelle Effros. 395-399 [doi]
- Algebraic computation of pattern maximum likelihoodJayadev Acharya, Hirakendu Das, Alon Orlitsky, Shengjun Pan. 400-404 [doi]
- A graph theoretical approach for network coding in wireless body area networksEimear Byrne, Akiko Manada, Stevan Jovica Marinkovic, Emanuel M. Popovici. 405-409 [doi]
- Deterministic algorithm for the cooperative data exchange problemNebojsa Milosavljevic, Sameer Pawar, Salim Y. El Rouayheb, Michael Gastpar, Kannan Ramchandran. 410-414 [doi]
- Inverse compute-and-forward: Extracting messages from simultaneously transmitted equationsYiwei Song, Natasha Devroye, Bobak Nazer. 415-419 [doi]
- Joint source-network coding for large-scale sensor networksSusana B. Cruz, Gerhard Maierbacher, João Barros. 420-424 [doi]
- Rate-limited transmitter-cooperation in Wyner's asymmetric interference networkShlomo Shamai, Michele A. Wigger. 425-429 [doi]
- Interference, cooperation and connectivity - A degrees of freedom perspectiveChenwei Wang, Syed Ali Jafar, Shlomo Shamai, Michele A. Wigger. 430-434 [doi]
- Interference networks with point-to-point codesFrançois Baccelli, Abbas El Gamal, David Tse. 435-439 [doi]
- On completing the degrees of freedom characterization of MIMO interference networks with No CSITChinmay S. Vaze, Mahesh K. Varanasi. 440-444 [doi]
- Entanglement boosts quantum turbo codesMark M. Wilde, Min-Hsiu Hsieh. 445-449 [doi]
- Examples of minimal-memory, non-catastrophic quantum convolutional encodersMark M. Wilde, Monireh Houshmand, Saied Hosseini-Khayat. 450-454 [doi]
- Quantum Gilbert-Varshamov bound through symplectic self-orthogonal codesLingfei Jin, Chaoping Xing. 455-458 [doi]
- Optimal quantization for compressive sensing under message passing reconstructionUlugbek Kamilov, Vivek K. Goyal, Sundeep Rangan. 459-463 [doi]
- A game theoretic approach to expander-based compressive sensingSina Jafarpour, Volkan Cevher, Robert E. Schapire. 464-468 [doi]
- Explicit matrices for sparse approximationM. Amin Khajehnejad, Arash Saber Tehrani, Alexandros G. Dimakis, Babak Hassibi. 469-473 [doi]
- Density evolution analysis of node-based verification-based algorithms in compressed sensingYaser Eftekhari, Anoosheh Heidarzadeh, Amir H. Banihashemi, Ioannis Lambadaris. 474-478 [doi]
- Analysis of alternative metrics for the PAPR problem in OFDM transmissionGerhard Wunder. 479-483 [doi]
- On the EVM of sequencesIgal Kotzer, Smadar Har-Nevo, Sasha Sodin, Simon Litsyn. 484-488 [doi]
- Improved lower bound for quasi-complementary sequence setZi-Long Liu, Yong Liang Guan, Wai Ho Mow. 489-493 [doi]
- On the relative abundance of nonbinary sequences with perfect autocorrelationsSerdar Boztas, Udaya Parampalli. 494-498 [doi]
- A new bound on the capacity of the binary deletion channel with high deletion probabilitiesMarco Dalai. 499-502 [doi]
- On the equivalence of Shannon capacity and stable capacity in networks with memoryless channelsHongyi Yao, Tracey Ho, Michelle Effros. 503-507 [doi]
- Channel coding theorem for the number of guesses in decodingHirosuke Yamamoto, Keishi Okudera. 508-512 [doi]
- Capacity of Gaussian channels with duty cycle and power constraintsLei Zhang, Dongning Guo. 513-517 [doi]
- Array-code ensembles -or- two-dimensional LDPC codesYuval Cassuto, Mohammad Amin Shokrollahi. 518-522 [doi]
- Linear growing minimum distance of ultra-sparse non-binary cluster-LDPC codesValentin Savin, David Declercq. 523-527 [doi]
- Partially-regular LDPC codes with linear encoding complexity and improved thresholdsDmitri K. Zigangirov, Kamil Sh. Zigangirov, Daniel J. Costello Jr.. 528-532 [doi]
- Block-triangularization of parity check matrices for efficient encoding of linear codesTomoharu Shibuya. 533-537 [doi]
- Mismatched CSI outage exponents of block-fading channelsA. Taufiq Asyhari, Albert Guillen i Fabregas. 538-542 [doi]
- MIMO performance under covariance matrix feedbackRajesh T. Krishnamachari, Mahesh K. Varanasi. 543-547 [doi]
- Distortion exponent in fading MIMO channels with time-varying side informationInaki Estella Aguerri, Deniz Gündüz. 548-552 [doi]
- On imperfect CSI for the downlink of a two-tier networkSalam Akoum, Marios Kountouris, Robert W. Heath Jr.. 553-557 [doi]
- The multiplexing gain of a two-cell MIMO channel with unequal CSIPaul de Kerret, David Gesbert. 558-562 [doi]
- Multi-user privacy: The Gray-Wyner system and generalized common informationRavi Tandon, Lalitha Sankar, H. Vincent Poor. 563-567 [doi]
- Malleable coding with fixed segment reuseJulius Kusuma, Lav R. Varshney, Vivek K. Goyal. 568-572 [doi]
- Secure lossy transmission of vector Gaussian sourcesErsen Ekrem, Sennur Ulukus. 573-577 [doi]
- Minimal public communication for maximum rate secret key generationHimanshu Tyagi. 578-582 [doi]
- Efficient file synchronization: A distributed source coding approachNan Ma, Kannan Ramchandran, David Tse. 583-587 [doi]
- Computing bounds on network capacity regions as a polytope reconstruction problemAnthony Kim, Muriel Médard. 588-592 [doi]
- A dispersion theorem for communication networks based on term setsSøren Riis, Maximilien Gadouleau. 593-597 [doi]
- Beyond the cut-set bound: Uncertainty computations in network coding with correlated sourcesAmin Aminzadeh Gohari, Shenghao Yang, Sidharth Jaggi. 598-602 [doi]
- Max-flow min-cut theorem for Rényi entropy in communication networksMaximilien Gadouleau, Søren Riis. 603-607 [doi]
- An algebraic mincut-maxflow theoremSe-Yong Park, Anant Sahai. 608-612 [doi]
- Construction of strongly secure wiretap channel code based on hash propertyJun Muramatsu, Shigeki Miyake. 613-617 [doi]
- Secrecy when the eavesdropper controls its channel statesXiang He, Aylin Yener. 618-622 [doi]
- The secrecy capacity region of a special class of multiple access channelsNan Liu, Wei Kang. 623-627 [doi]
- Wiretap channels: Roles of rate splitting and channel prefixingOmur Ozel, Sennur Ulukus. 628-632 [doi]
- Achieving secrecy: Capacity vs. resolvabilityMatthieu R. Bloch. 633-637 [doi]
- Spatially coupled quasi-cyclic quantum LDPC codesManabu Hagiwara, Kenta Kasai, Hideki Imai, Kohichi Sakaniwa. 638-642 [doi]
- A construction of quantum LDPC codes from Cayley graphsAlain Couvreur, Nicolas Delfosse, Gilles Zémor. 643-647 [doi]
- t + 1Sagarmoy Dutta, Piyush P. Kurur. 648-652 [doi]
- Non-binary quasi-cyclic quantum LDPC codesKenta Kasai, Manabu Hagiwara, Hideki Imai, Kohichi Sakaniwa. 653-657 [doi]
- Compressive MUSIC with optimized partial support for joint sparse recoveryJongmin Kim, Ok Kyun Lee, Jong Chul Ye. 658-662 [doi]
- Frame coherence and sparse signal processingDustin G. Mixon, Waheed U. Bajwa, A. Robert Calderbank. 663-667 [doi]
- Support-Predicted Modified-CS for recursive robust principal components' PursuitChenlu Qiu, Namrata Vaswani. 668-672 [doi]
- Sparse principal component of a rank-deficient matrixMegasthenis Asteris, Dimitris S. Papailiopoulos, George N. Karystinos. 673-677 [doi]
- General constructions of deterministic (S)RIP matrices for compressive samplingArya Mazumdar, Alexander Barg. 678-682 [doi]
- n-1 over 2Sung-Tai Choi, Tae-Hyung Lim, Jong-Seon No, Habong Chung. 683-687 [doi]
- vAlex J. Burrage, Ana Salagean, Raphael C.-W. Phan. 688-692 [doi]
- Constructions of bent functions on the minimal distance from the quadratic bent functionNikolay Kolomeec. 693-697 [doi]
- 16-QAM Golay complementary sequences with new sequence lengthsYen-Wen Huang, Ying Li. 698-702 [doi]
- r Niho exponentsClaude Carlet, Tor Helleseth, Alexander Kholosha, Sihem Mesnager. 703-707 [doi]
- Mutual information, relative entropy, and estimation in the Poisson channelRami Atar, Tsachy Weissman. 708-712 [doi]
- A memoryless channel coding methodology for infinite-memory queuing timing channelsChristopher Li, Tong Cheng, Todd P. Coleman. 713-717 [doi]
- An additive exponential noise channel with a transmission deadlineYiLin Tsai, Christopher Rose, Ruochen Song, I. Saira Mian. 718-722 [doi]
- Capacity of discrete molecular diffusion channelsArash Einolghozati, Mohsen Sardari, Ahmad Beirami, Faramarz Fekri. 723-727 [doi]
- Gaussian multiple access channel with compact antenna arraysMichel T. Ivrlac, Josef A. Nossek. 728-731 [doi]
- Some voltage graph-based LDPC tailbiting codes with large girthIrina E. Bocharova, Florian Hug, Rolf Johannesson, Boris D. Kudryashov, Roman V. Satyukov. 732-736 [doi]
- A simple method to construct LDPC codes based on projective planesSergei Kovalev, Victor Y. Krachkovsky. 737-741 [doi]
- Interleaved LDPC codes, reduced-complexity inner decoder and an iterative decoder for the Davey-MacKay constructionXiaopeng Jiao, Marc Andre Armand. 742-746 [doi]
- Spatially-coupled MacKay-Neal codes and Hsu-Anastasopoulos codesKenta Kasai, Kohichi Sakaniwa. 747-751 [doi]
- Wideband slope in interference channels with imperfect CSI at transmittersMinqi Shen, Anders Høst-Madsen. 752-756 [doi]
- On the generalized degrees of freedom region of the MIMO interference channel with no CSITChinmay S. Vaze, Sanjay Karmakar, Mahesh K. Varanasi. 757-761 [doi]
- On the throughput of wireless interference networks with limited feedbackHamed Farhadi, Chao Wang, Mikael Skoglund. 762-766 [doi]
- On the degrees of freedom of X channel with delayed CSITAkbar Ghasemi, Abolfazl S. Motahari, Amir K. Khandani. 767-770 [doi]
- Bounds for joint source-channel coding at high SNRSergey Tridenski, Ram Zamir. 771-775 [doi]
- An achievable rate region for distributed source coding and dispersive information routingKumar Viswanatha, Emrah Akyol, Kenneth Rose. 776-780 [doi]
- Joint source-channel coding via hybrid codingPaolo Minero, Sung-Hoon Lim, Young Han Kim. 781-785 [doi]
- Communicating remote Gaussian sources over Gaussian multiple access channelsAmos Lapidoth, I.-Hsiang Wang. 786-790 [doi]
- Opportunities for network coding: To wait or not to waitYu-Pin Hsu, Navid Abedini, Solairaja Ramasamy, Natarajan Gautam, Alex Sprintson, Srinivas Shakkottai. 791-795 [doi]
- Energy-delay considerations in coded packet flowsDaniel E. Lucani, Jörg Kliewer. 796-800 [doi]
- Analysis of overlapped chunked codes with small chunks over line networksAnoosheh Heidarzadeh, Amir H. Banihashemi. 801-805 [doi]
- Index coding with outerplanar side informationYossi Berliner, Michael Langberg. 806-810 [doi]
- Accessible capacity of secondary users over the Gaussian interference channelXiujie Huang, Xiao Ma, Lei Lin, Baoming Bai. 811-815 [doi]
- Cooperation in multiple access channels in the presence of partial state informationHaim H. Permuter, Shlomo Shamai, Anelia Somekh-Baruch. 816-820 [doi]
- On throughput and delay scaling with cooperative spectrum sharingYang Han, See Ho Ting, Mehul Motani, Ashish Pandharipande. 821-825 [doi]
- Cooperative computation in wireless networksMatthew S. Nokleby, Behnaam Aazhang. 826-830 [doi]
- Erasure-only list decoding of Reed-Solomon and BCH codes with applications to their product codesYingquan Wu. 831-834 [doi]
- On the decoding complexity of cyclic codes up to the BCH boundDavide Schipani, Michele Elia, Joachim Rosenthal. 835-839 [doi]
- Minimal list decoding of Reed-Solomon codes using a parameterization of Gröbner basesMortuza Ali, Margreta Kuijper. 840-844 [doi]
- Optimal threshold-based multi-trial error/erasure decoding with the Guruswami-Sudan algorithmChristian Senger, Vladimir Sidorenko, Martin Bossert, Victor V. Zyablov. 845-849 [doi]
- Neural pre-coding increases the pattern retrieval capacity of Hopfield and Bidirectional Associative MemoriesAmir Hesam Salavati, K. Raj Kumar, Mohammad Amin Shokrollahi, Wulfram Gerstnery. 850-854 [doi]
- Information theoretic limits on learning stochastic differential equationsJosé Bento, Morteza Ibrahimi, Andrea Montanari. 855-859 [doi]
- Radial Basis Function Networks with optimal kernelsAdam Krzyzak. 860-863 [doi]
- Combined waveform-cepstral representation for robust speech recognitionMatthew Ager, Zoran Cvetkovic, Peter Sollich. 864-868 [doi]
- Constructions of rank modulation codesArya Mazumdar, Alexander Barg, Gilles Zémor. 869-873 [doi]
- Generalized Gray codes for local rank modulationEyal En Gad, Michael Langberg, Moshe Schwartz, Jehoshua Bruck. 874-878 [doi]
- On the labeling problem of permutation group codes under the infinity metricItzhak Tamo, Moshe Schwartz. 879-883 [doi]
- Compressed encoding for rank modulationEyal En Gad, Anxiao Jiang, Jehoshua Bruck. 884-888 [doi]
- An improvement to the Haroutunian bound for anytime coding systemsHari Palaiyanur, Anant Sahai. 889-893 [doi]
- On Rényi measures and hypothesis testingOfer Shayevitz. 894-898 [doi]
- Random-coding joint source-channel boundsAdrià Tauste Campo, Gonzalo Vazquez-Vilar, Albert Guillen i Fabregas, Alfonso Martinez. 899-902 [doi]
- Maximization of the information divergence from an exponential family and criticalityFrantisek Matús, Johannes Rauh. 903-907 [doi]
- Design of irregular quasi-cyclic protograph codes with low error floorsReza Asvadi, Amir H. Banihashemi, Mahmoud Ahmadian-Attari. 908-912 [doi]
- Enumerators for protograph-based ensembles of nonbinary LDPC codesDariush Divsalar, Lara Dolecek. 913-917 [doi]
- Protograph design with multiple edges for regular QC LDPC codes having large girthHosung Park, Seokbeom Hong, Jong-Seon No, Dong-Joon Shin. 918-922 [doi]
- Double-Hamming based QC LDPC codes with large minimum distanceIrina E. Bocharova, Florian Hug, Rolf Johannesson, Boris D. Kudryashov. 923-927 [doi]
- Efficient beamforming algorithms for MIMO multicast with application-layer codingMichal Kaliszan, Emmanuel Pollakis, Slawomir Stanczak. 928-932 [doi]
- Coordination limits in MIMO networksAli Tajer, Xiaodong Wang, H. Vincent Poor. 933-937 [doi]
- SINR distribution of MIMO MMSE receiverAris L. Moustakas. 938-942 [doi]
- Encoding of multivariate stimuli with MIMO neural circuitsAurel A. Lazar, Eftychios A. Pnevmatikakis. 943-947 [doi]
- Cliff effect suppression through multiple-descriptions with split personalitySilvija Kokalj-Filipovic, Emina Soljanin, Yang Gao. 948-952 [doi]
- Compression with graphical constraints: An interactive browserAmin Karbasi, Morteza Zadimoghaddam. 953-957 [doi]
- Energy-optimized lossless compression: Rate-variability tradeoffYihong Wu, Erik Ordentlich, Marcelo J. Weinberger. 958-962 [doi]
- Delay-optimal scheduling for cooperative networksYing Cui, Vincent K. N. Lau, Edmund M. Yeh. 963-967 [doi]
- The capacity region of a class of 3-receiver broadcast channels with two eavesdroppersSadaf Salehkalaibar, Mohammad Reza Aref. 968-972 [doi]
- On equivalence for networks of noisy channels under byzantine attacksMayank Bakshi, Michelle Effros, Tracey Ho. 973-977 [doi]
- The hidden flow of informationChung Chan. 978-982 [doi]
- On secure Index Coding with Side InformationSon Hoang Dau, Vitaly Skachek, Yeow Meng Chee. 983-987 [doi]
- Coding theorems for random access communication over compound channelZheng Wang, Jie Luo 0001. 988-992 [doi]
- The arbitrarily varying multiple-access channel with conferencing encodersMoritz Wiese, Holger Boche. 993-997 [doi]
- Implicit communication in multiple-access settingsGireeja Ranade, Anant Sahai. 998-1002 [doi]
- Improving the MAC error exponent using distributed structureEli Haim, Yuval Kochman, Uri Erez. 1003-1007 [doi]
- Solving the key equation for Hermitian codes with a division algorithmSabine Kampf, Martin Bossert, Irene I. Bouw. 1008-1012 [doi]
- A concatenated coding scheme based on folded Reed-Solomon codesPeter Trifonov, Moon Ho Lee. 1013-1016 [doi]
- Efficient decoding of some classes of binary cyclic codes beyond the Hartmann-Tzeng boundAlexander Zeh, Antonia Wachter, Sergey Bezzateev. 1017-1021 [doi]
- On a fast decoding of multipoint codes from algebraic curvesMasaya Fujisawa, Shojiro Sakata. 1022-1026 [doi]
- Mixture density estimation via Hilbert space embedding of measuresBharath K. Sriperumbudur. 1027-1030 [doi]
- Efficient computation of normalized maximum likelihood coding for Gaussian mixtures with its applications to optimal clusteringSo Hirai, Kenji Yamanishi. 1031-1035 [doi]
- Selecting the rank of truncated SVD by maximum approximation capacityMario Frank, Joachim M. Buhmann. 1036-1040 [doi]
- Discrete denoising of heterogeneous two-dimensional dataTaesup Moon, Tsachy Weissman, Jae-Young Kim. 1041-1045 [doi]
- Nonuniform codes for correcting asymmetric errorsHongchao Zhou, Anxiao Jiang, Jehoshua Bruck. 1046-1050 [doi]
- Reed-Muller codes, elementary symmetric functions and asymmetric error correctionLuca G. Tallini, Bella Bose. 1051-1055 [doi]
- On codes that correct asymmetric errors with graded magnitude distributionEitan Yaakobi, Paul H. Siegel, Alexander Vardy, Jack K. Wolf. 1056-1060 [doi]
- On L1-distance error control codesLuca G. Tallini, Bella Bose. 1061-1065 [doi]
- On reliability of content identification from databases based on noisy queriesGautam Dasarathy, Stark C. Draper. 1066-1070 [doi]
- Error exponents in asynchronous communicationDa Wang, Venkat Chandar, Sae-Young Chung, Gregory W. Wornell. 1071-1075 [doi]
- Constrained Wyner-Ziv codingAmos Lapidoth, Andreas Malär, Michele A. Wigger. 1076-1080 [doi]
- The degrees of freedom of compute-and-forwardUrs Niesen, Phil Whiting. 1081-1085 [doi]
- Trapping sets of structured LDPC codesQin Huang, Qiuju Diao, Shu Lin, Khaled A. S. Abdel-Ghaffar. 1086-1090 [doi]
- An efficient algorithm for finding dominant trapping sets of irregular LDPC codesMehdi Karimi, Amir H. Banihashemi. 1091-1095 [doi]
- Exact free distance and trapping set growth rates for LDPC convolutional codesDavid G. M. Mitchell, Ali Emre Pusane, Michael Lentmaier, Daniel J. Costello Jr.. 1096-1100 [doi]
- Analysis of stopping constellation distribution for irregular non-binary LDPC code ensembleTakayuki Nozaki, Kenta Kasai, Kohichi Sakaniwa. 1101-1105 [doi]
- Decoding by embedding: Correct decoding radius and DMT optimalityCong Ling, Shuiyin Liu, Laura Luzzi, Damien Stehlé. 1106-1110 [doi]
- Streaming data over fading wireless channels: The diversity-multiplexing tradeoffAshish Khisti, Stark C. Draper. 1111-1115 [doi]
- Improving the DMT performances of MIMO linear receiversTi-wen Tang, Min-Kun Chen, Hsiao-feng Lu. 1116-1120 [doi]
- The diversity of MMSE receiver over frequency-selective MIMO channelAhmed Hesham Mehana, Aria Nosratinia. 1121-1125 [doi]
- Data compression in multiterminal statistical inference - linear-threshold encodingShun-ichi Amari. 1126-1130 [doi]
- Lossless coding with generalized criteriaThemistoklis Charalambous, Charalambos D. Charalambous, Farzad Rezaei. 1131-1135 [doi]
- Joint source-channel coding with correlated interferenceYu-Chih Huang, Krishna R. Narayanan. 1136-1140 [doi]
- Secure lossy source-channel wiretapping with side information at the receiving terminalsJoffrey Villard, Pablo Piantanida, Shlomo Shamai. 1141-1145 [doi]
- Network localized error correction: For non-coherent codingNing Cai. 1146-1150 [doi]
- One packet suffices - Highly efficient packetized Network Coding With finite memoryBernhard Haeupler, Muriel Médard. 1151-1155 [doi]
- Localized dimension growth in random network coding: A convolutional approachWangmei Guo, Ning Cai, Xiaomeng Shi, Muriel Médard. 1156-1160 [doi]
- Generation of innovative and sparse encoding vectors for broadcast systems with feedbackHo Yuet Kwan, Kenneth W. Shum, Chi Wan Sung. 1161-1165 [doi]
- K-user interference channels: General outer bound and sum-capacity for certain Gaussian channelsDaniela Tuninetti. 1166-1170 [doi]
- On the capacity of the K-user cyclic Gaussian interference channelLei Zhou, Wei Yu. 1171-1175 [doi]
- An alternative to decoding interference or treating interference as Gaussian noiseKamyar Moshksar, Akbar Ghasemi, Amir K. Khandani. 1176-1180 [doi]
- The capacity region of the symmetric Gaussian interference channel with common information to within a constant gapChinmay S. Vaze, Mahesh K. Varanasi. 1181-1185 [doi]
- Use of Gray codes for optimizing the search of (shortened) cyclic single burst-correcting codesL. Javier García-Villalba, José René Fuentes Cortez, Ana Lucila Sandoval Orozco, Mario Blaum. 1186-1189 [doi]
- On irreducible polynomial remainder codesJiun-Hung Yu, Hans-Andrea Loeliger. 1190-1194 [doi]
- Rank minimization over finite fieldsVincent Y. F. Tan, Laura Balzano, Stark C. Draper. 1195-1199 [doi]
- The discrete Fourier transform over a finite field with reduced multiplicative complexitySergei V. Fedorenko. 1200-1204 [doi]
- k-nearest neighbor estimation of entropies with confidenceKumar Sricharan, Raviv Raich, Alfred O. Hero. 1205-1209 [doi]
- Statistical decision by using quantized observationsRémi Cogranne, Cathel Zitzmann, Lionel Fillatre, Florent Retraint, Igor Nikiforov, Philippe Cornu. 1210-1214 [doi]
- A new method for variable elimination in systems of inequationsFarhad Shirani Chaharsooghi, Mohammad Javad Emadi, Mahdi Zamanighomi, Mohammad Reza Aref. 1215-1219 [doi]
- Shannon meets Blackwell and Le Cam: Channels, codes, and statistical experimentsMaxim Raginsky. 1220-1224 [doi]
- Permutation code: Optimal exact-repair of a single failed node in MDS code based distributed storage systemsViveck R. Cadambe, Cheng Huang, Jin Li. 1225-1229 [doi]
- Distributed storage codes through Hadamard designsDimitris S. Papailiopoulos, Alexandros G. Dimakis. 1230-1234 [doi]
- Enabling node repair in any erasure code for distributed storageK. V. Rashmi, Nihar B. Shah, P. Vijay Kumar. 1235-1239 [doi]
- MDS array codes with optimal rebuildingItzhak Tamo, Zhiying Wang, Jehoshua Bruck. 1240-1244 [doi]
- Secrecy games on the one-sided interference channelJianwei Xie, Sennur Ulukus. 1245-1249 [doi]
- A potential function view of information theoretic interference gamesSuvarup Saha, Randall A. Berry. 1250-1254 [doi]
- Information theoretic analysis of side channel information leakage in FCFS schedulersXun Gong, Negar Kiyavash, Parv Venkitasubramaniam. 1255-1259 [doi]
- A non-linear model of limit order book dynamicsNikita D. Vvedenskaya, Yuri M. Suhov, Vladimir Belitsky. 1260-1262 [doi]
- Efficient methods for bounding the fractional distance of LDPC codes and obtaining fundamental polytopes of nonbinary and generalized codesDavid Burshtein, Idan Goldenberg. 1263-1267 [doi]
- On concentration of measures for LDPC code ensemblesIgal Sason, Ronen Eshel. 1268-1272 [doi]
- List decoding of product codes by the MinSum algorithmAlexander Barg, Gilles Zémor. 1273-1277 [doi]
- The approximate maximum-likelihood certificateIdan Goldenberg, David Burshtein. 1278-1282 [doi]
- On error correction capability of bit-flipping algorithm for LDPC codesWen-Yao Chen, Chung-Chin Lu. 1283-1286 [doi]
- Tradeoff analysis of delay-power-CSIT quality of generalized dynamic backpressure algorithm for energy efficient OFDM systemsVincent K. N. Lau, Chung Ha Koh. 1287-1291 [doi]
- Vector broadcast channels: Optimality of threshold feedback policiesTharaka Samarasinghe, Hazer Inaltekin, Jamie S. Evans. 1292-1296 [doi]
- Space-time linear precoding and iterative LMMSE detection for MIMO channels without CSITXiaojun Yuan, Li Ping. 1297-1301 [doi]
- Performance of hybrid codebook techniques for MISO downlink channels with limited feedbackSungkyu Jung, Kyeongjun Ko, Jungwoo Lee. 1302-1306 [doi]
- Asymptotic analysis of downlink multi-cell systems with partial CSITSubhash Lakshminarayana, Mérouane Debbah, Mohamad Assaad. 1307-1311 [doi]
- Combinatorial Message Sharing for a refined multiple descriptions achievable regionKumar Viswanatha, Emrah Akyol, Kenneth Rose. 1312-1316 [doi]
- Analysis of a Block Arithmetic Coding: Discrete divide and conquer recurrencesMichael Drmota, Wojciech Szpankowski. 1317-1321 [doi]
- Codes for unordered sets of wordsYuriy A. Reznik. 1322-1326 [doi]
- Coding theorems on the worst-case redundancy of fixed-length coding for a general sourceHiroki Koga, Mitsuharu Arimura, Ken-ichi Iwata. 1327-1331 [doi]
- Training over sparse multipath channels in the low SNR regimeElchanan Zwecher, Dana Porrat. 1332-1336 [doi]
- On the capacity of 2-user 1-hop relay erasure networks - The union of feedback, scheduling, opportunistic routing, and network codingWei-Cheng Kuo, Chih-Chun Wang. 1337-1341 [doi]
- On computing the capacity of relay networks in polynomial timeFarzad Parvaresh, Raúl H. Etkin. 1342-1346 [doi]
- On the capacity of the noncausal relay channelLele Wang, Mohammad Naghshvar. 1347-1351 [doi]
- On the transmission of correlated sources over relay channelsSadaf Salehkalaibar, Mohammad Reza Aref. 1352-1356 [doi]
- Hash-and-forward relaying for two-way relay channelErhan Yilmaz, Raymond Knopp. 1357-1361 [doi]
- Degrees of freedom of the interference channel: A general formulaYihong Wu, Shlomo Shamai, Sergio Verdú. 1362-1366 [doi]
- On the degrees of freedom of rank deficient interference channelsSung Ho Chae, Sae-Young Chung. 1367-1371 [doi]
- (n, K)-user interference channels: Degrees of freedomAli Tajer, Xiaodong Wang. 1372-1376 [doi]
- Degrees of freedom of cooperative interference networksV. Sreekanth Annapureddy, Aly El Gamal, Venugopal V. Veeravalli. 1377-1381 [doi]
- On the sum capacity of K-user cascade Gaussian Z-interference channelYuanpeng Liu, Elza Erkip. 1382-1386 [doi]
- Average error exponent of undetected error probability of binary matrix ensemblesKazushi Mimura, Tadashi Wadayama, Toshiyuki Tanaka, Yoshiyuki Kabashima. 1387-1391 [doi]
- Beating the Gilbert-Varshamov bound for online channelsIshay Haviv, Michael Langberg. 1392-1396 [doi]
- Upper and lower bounds on the minimum distance of expander codesAlexey Frolov, Victor V. Zyablov. 1397-1401 [doi]
- Is Unequal Error Protection useful?Ozgun Y. Bursalioglu, Giuseppe Caire. 1402-1406 [doi]
- The dispersion of infinite constellationsAmir Ingber, Ram Zamir, Meir Feder. 1407-1411 [doi]
- Compressive identification of linear operatorsReinhard Heckel, Helmut Bölcskei. 1412-1416 [doi]
- MultiPass lasso algorithms for sparse signal recoveryYuzhe Jin, Bhaskar D. Rao. 1417-1421 [doi]
- Sparse signal recovery from sparsely corrupted measurementsChristoph Studer, Patrick Kuppinger, Graeme Pope, Helmut Bölcskei. 1422-1426 [doi]
- Summary based structures with improved sublinear recovery for compressed sensingM. Amin Khajehnejad, Juhwan Yoo, Animashree Anandkumar, Babak Hassibi. 1427-1431 [doi]
- Generating functional analysis of iterative algorithms for compressed sensingKazushi Mimura. 1432-1436 [doi]
- Optimal-cost repair in multi-hop distributed storage systemsMajid Gerami, Ming Xiao, Mikael Skoglund. 1437-1441 [doi]
- Exact minimum-repair-bandwidth cooperative regenerating codes for distributed storage systemsKenneth W. Shum, Yuchong Hu. 1442-1446 [doi]
- Distributed storage allocations for optimal delayDerek Leong, Alexandros G. Dimakis, Tracey Ho. 1447-1451 [doi]
- Securing dynamic distributed storage systems from malicious nodesSameer Pawar, Salim Y. El Rouayheb, Kannan Ramchandran. 1452-1456 [doi]
- Update efficient codes for distributed storageAnkit Singh Rawat, Sriram Vishwanath, Abhishek Bhowmick, Emina Soljanin. 1457-1461 [doi]
- Special session on information theory and neuroscience at ISIT 2011Todd P. Coleman, Aurel A. Lazar. 1462-1463 [doi]
- Bilayer LDPC convolutional codes for half-duplex relay channelsZhongwei Si, Ragnar Thobaben, Mikael Skoglund. 1464-1468 [doi]
- Block-Markov LDPC scheme for half- and full-duplex erasure relay channelMarina Ivashkina, Iryna Andriyanova, Pablo Piantanida, Charly Poulliat. 1469-1473 [doi]
- Spatially coupled LDPC codes for decode-and-forward in erasure relay channelHironori Uchikawa, Kenta Kasai, Kohichi Sakaniwa. 1474-1478 [doi]
- Soft decode-and-forward using LDPC coding in half-duplex relay channelsMarwan H. Azmi, Jun Li 0004, Jinhong Yuan, Robert A. Malaney. 1479-1483 [doi]
- Partial group decoding for interference channelsAli Tajer, H. Vincent Poor, Xiaodong Wang. 1484-1488 [doi]
- Improvement of BP-based CDMA multiuser detection by spatial couplingKeigo Takeuchi, Toshiyuki Tanaka, Tsutomu Kawabata. 1489-1493 [doi]
- On the sum-capacity with successive decoding in interference channelsYue Zhao, Chee-Wei Tan, Amir Salman Avestimehr, Suhas N. Diggavi, Gregory J. Pottie. 1494-1498 [doi]
- The Gaussian multiple access diamond channelWei Kang, Nan Liu. 1499-1503 [doi]
- Results on the redundancy of universal compression for finite-length sequencesAhmad Beirami, Faramarz Fekri. 1504-1508 [doi]
- Limiting distribution of Lempel Ziv'78 redundancyPhilippe Jacquet, Wojciech Szpankowski. 1509-1513 [doi]
- On instability of the ergodic limit theorems with respect to small violations of algorithmic randomnessVladimir V. V'yugin. 1514-1518 [doi]
- The universality and linearity of compression by substring enumerationDanny Dubé, Hidetoshi Yokoo. 1519-1523 [doi]
- On the asymptotic error probability of composite relay channelsArash Behboodi, Pablo Piantanida. 1524-1528 [doi]
- Capacity of less noisy relay channelsSi-Hyeon Lee, Sae-Young Chung. 1529-1533 [doi]
- On the maximum achievable rates in the decode-forward diamond channelMahdi Zamani, Amir K. Khandani. 1534-1538 [doi]
- Interference mitigation in femto-macro coexistence with two-way relay channelKiran T. Gowda, David Gesbert, Erhan Yilmaz. 1539-1543 [doi]
- The capacity region for two classes of product broadcast channelsYanlin Geng, Amin Aminzadeh Gohari, Chandra Nair, Yuanming Yu. 1544-1548 [doi]
- Capacity-achieving encoding for the broadcast erasure channel with multiple usersMarios Gatzianas, Leonidas Georgiadis, Leandros Tassiulas. 1549-1553 [doi]
- Nested linear codes achieve Marton's inner bound for general broadcast channelsArun Padakandla, Sandeep S. Pradhan. 1554-1558 [doi]
- Capacity region of a class of deterministic K-receiver broadcast channels with degraded message setsHon-Fah Chong, Ying-Chang Liang. 1559-1563 [doi]
- DNA codes for generalized stem similarityArkadii G. D'yachkov, Julia Volkova, Nikita Polyanskii. 1564-1568 [doi]
- New construction of DNA codes with constant-GC contents from binary sequences with ideal autocorrelationYoung-Sik Kim, Sang-Hyo Kim. 1569-1573 [doi]
- Outfix-free and intercode constraints for DNA sequencesHiroshi Kamabe. 1574-1578 [doi]
- Codebook and marker sequence design for synchronization-correcting codesVictor Buttigieg, Johann A. Briffa. 1579-1583 [doi]
- Localization from incomplete noisy distance measurementsAdel Javanmard, Andrea Montanari. 1584-1588 [doi]
- Universal manifold embedding for geometric deformations estimationRami Hagege, Joseph M. Francos. 1589-1593 [doi]
- Estimating a Gaussian random walk first-passage time from noisy or delayed observationsMarat V. Burnashev, Aslan Tchamkerten. 1594-1597 [doi]
- Model-fitting in the presence of outliersJayakrishnan Unnikrishnan. 1598-1602 [doi]
- Almost-perfect secret sharingTarik Kaced. 1603-1607 [doi]
- Toward optimal trade-off between identification and secrecy-key binding using linear codesPo-Hsiang Lai, Joseph A. O'Sullivan. 1608-1612 [doi]
- Error-free perfect-secrecy systemsSiu-Wai Ho, Terence Chan, Chinthani Uduwerelle. 1613-1617 [doi]
- The capacity per unit energy of large wireless networksSudeep Kamath, Urs Niesen, Piyush Gupta. 1618-1622 [doi]
- Cooperative strategies for interference-limited wireless networksAndres Altieri, Leonardo Rey Vega, Cecilia G. Galarza, Pablo Piantanida. 1623-1627 [doi]
- On the geometry of wireless network multicast in 2-DMohit Thakur, Nadia Fawaz, Muriel Médard. 1628-1632 [doi]
- Local phy + global flow: A layering principle for wireless networksSreeram Kannan, Adnan Raja, Pramod Viswanath. 1633-1637 [doi]
- Adaptive cut generation for improved linear programming decoding of binary linear codesXiaojie Zhang, Paul H. Siegel. 1638-1642 [doi]
- Pseudocodewords of linear programming decoding of 3-dimensional turbo codesEirik Rosnes, Michael Helmling, Alexandre Graell i Amat. 1643-1647 [doi]
- Polytope of correct (linear programming) decoding and low-weight pseudo-codewordsMichael Chertkov, Mikhail G. Stepanov. 1648-1652 [doi]
- Trellis-based check node processing for low-complexity nonbinary LP decodingMayur Punekar, Mark F. Flanagan. 1653-1657 [doi]
- Robust incremental redundancy hybrid ARQ coding for channels with unknown interferenceStojan Z. Denic. 1658-1662 [doi]
- On random CDMA with constant envelopeRalf R. Müller. 1663-1667 [doi]
- Universal decoding over Gaussian fading channels - metric calculation and performance evaluationNir Weinberger, Meir Feder. 1668-1672 [doi]
- Mitigating interference with integer-forcing architecturesJiening Zhan, Uri Erez, Michael Gastpar, Bobak Nazer. 1673-1677 [doi]
- Secure source coding with action-dependent side informationKittipong Kittichokechai, Tobias J. Oechtering, Mikael Skoglund. 1678-1682 [doi]
- Cascade and Triangular source coding with causal side informationYeow-Khiang Chia, Tsachy Weissman. 1683-1687 [doi]
- Source-channel coding tradeoff in multiple antenna multiple access channelsEbrahim MolavianJazi, J. Nicholas Laneman. 1688-1692 [doi]
- Vector Gaussian multiple description coding with individual and central distortion constraintsJun Chen, Jia Wang. 1693-1697 [doi]
- Compress-and-forward scheme for a relay network: Approximate optimality and connection to algebraic flowsAdnan Raja, Pramod Viswanath. 1698-1702 [doi]
- Degraded two-message multicast over graphsShirin Saeedi Bidokhti, Christina Fragouli. 1703-1707 [doi]
- Common information of random linear network coding over a 1-hop broadcast packet erasure channelChih-Chun Wang, Jaemin Han. 1708-1712 [doi]
- Multilevel coding schemes for compute-and-forwardBrett Hern, Krishna R. Narayanan. 1713-1717 [doi]
- Mean-variance optimal linear precoders for random MISO broadcast channelsAlon Shalev Housfater, Teng Joon Lim. 1718-1722 [doi]
- On vector perturbation precoding for the MIMO Gaussian broadcast channelYuval Avner, Benjamin M. Zaidel, Shlomo Shamai. 1723-1727 [doi]
- Block triangularization: A new linear precoding strategy for Gaussian MIMO BCJunyoung Nam, Giuseppe Caire, Jeongseok Ha. 1728-1732 [doi]
- Broadcasting on the Grassmannian: Enhancing the multiplexing gainYang Li, Aria Nosratinia. 1733-1737 [doi]
- Linear extractors for extracting randomness from noisy sourcesHongchao Zhou, Jehoshua Bruck. 1738-1742 [doi]
- On the capacity of Abelian group codes over discrete memoryless channelsAria Ghasemian Sahebi, S. Sandeep Pradhan. 1743-1747 [doi]
- Linear error correcting codes with anytime reliabilityRavi Teja Sukhavasi, Babak Hassibi. 1748-1752 [doi]
- Channels with intermittent errorsArya Mazumdar, Alexander Barg. 1753-1757 [doi]
- On the St. Petersburg paradoxThomas M. Cover. 1758-1761 [doi]
- A lattice of gamblesPaul Cuff, Thomas M. Cover, Gowtham Kumar, Lei Zhao. 1762-1766 [doi]
- On the detrimental effect of assuming a linear model for non-linear AWGN channelsJihad Fahs, Ibrahim C. Abou-Faycal. 1767-1771 [doi]
- Analysis of fast sparse superposition codesAndrew R. Barron, Antony Joseph. 1772-1776 [doi]
- Security notions for information theoretically secure encryptionsMitsugu Iwamoto, Kazuo Ohta. 1777-1781 [doi]
- On unconditionally secure multi-party sampling from scratch1Ye Wang, Prakash Ishwar. 1782-1786 [doi]
- Index coding and error correctionSon Hoang Dau, Vitaly Skachek, Yeow Meng Chee. 1787-1791 [doi]
- The average radius of codes: Survey and new resultsGérard D. Cohen, Carlos Munuera, Patrick Solé. 1792-1795 [doi]
- The stability region of random multiple access under stochastic energy harvestingJeongho Jeon, Anthony Ephremides. 1796-1800 [doi]
- On the stability region of multi-queue multi-server queueing systems with stationary channel distributionHassan Halabian, Ioannis Lambadaris, Chung-Horng Lung. 1801-1805 [doi]
- Queueing behavior of the Gilbert-Elliott channel: BCH codes and Poisson arrivalsFatemeh Hamidi-Sepehr, Yi Cai, Henry D. Pfister, Jean-François Chamberland. 1806-1810 [doi]
- Queueing delay - error probability tradeoff for point-to-point channels with fixed length block codesVineeth Bala Sukumaran, Utpal Mukherji. 1811-1815 [doi]
- Scaling behavior of convolutional LDPC ensembles over the BECPablo M. Olmos, Rüdiger L. Urbanke. 1816-1820 [doi]
- Dynamic scheduling-aided decoding strategies for LDPC convolutional codes with rational parity-check matricesJian-Jia Weng, Mu-Chen Wu, Chung-Hsuan Wang, Yi-Sheng Su, Tsung-Cheng Wu. 1821-1825 [doi]
- Efficient message passing scheduling for terminated LDPC convolutional codesMichael Lentmaier, Maria Mellado Prenda, Gerhard Fettweis. 1826-1830 [doi]
- On the lower bound of the free distance of partial unit memory codes based on LDPC CodesKonstantin Kondrashov, Victor V. Zyablov. 1831-1835 [doi]
- The fundamental limits of infinite constellations in MIMO fading channelsYair Yona, Meir Feder. 1836-1840 [doi]
- Near-capacity BICM-ID for MIMO channelsQiuliang Xie, Jian Song, Fang Yang, Zhixing Yang. 1841-1845 [doi]
- Minimizing the complexity of fast sphere decoding of STBCsG. R. Jithamithra, B. Sundar Rajan. 1846-1850 [doi]
- Performance analysis of coded V-BLAST with optimum power and rate allocationVictoria Kostina, Sergey Loyka. 1851-1855 [doi]
- Computing a function of correlated Sources: A rate regionMilad Sefidgaran, Aslan Tchamkerten. 1856-1860 [doi]
- Algebraic codes for Slepian-Wolf code designShizheng Li, Aditya Ramamoorthy. 1861-1865 [doi]
- Multi-terminal source coding through a relayRajiv Soundararajan, Sriram Vishwanath. 1866-1870 [doi]
- Tree interactive encoding and decoding: Conditionally Φ-mixing sourcesJin Meng, En-Hui Yang, Zhen Zhang. 1871-1875 [doi]
- Practical code design for compute-and-forwardOr Ordentlich, Jiening Zhan, Uri Erez, Michael Gastpar, Bobak Nazer. 1876-1880 [doi]
- Relaying via hybrid codingYoung Han Kim, Sung-Hoon Lim, Paolo Minero. 1881-1885 [doi]
- A half-duplex cooperative scheme with partial decode-forward relayingAhmad Abu Al Haija, Mai Vu. 1886-1890 [doi]
- How to achieve privacy in bidirectional relay networksRafael F. Wyrembelski, Holger Boche. 1891-1895 [doi]
- LQG control approach to Gaussian broadcast channels with feedbackEhsan Ardestanizadeh, Paolo Minero, Massimo Franceschetti. 1896-1900 [doi]
- Wireless peer-to-peer mutual broadcast via sparse recoveryLei Zhang, Dongning Guo. 1901-1905 [doi]
- Vector broadcast channels: Optimal threshold selection problemTharaka Samarasinghe, Hazer Inaltekin, Jamie S. Evans. 1906-1910 [doi]
- Approximately optimal broadcasting-cum-multicasting in wireless networksSreeram Kannan, Adnan Raja, Pramod Viswanath. 1911-1915 [doi]
- On conjugacy classes of subgroups of the general linear group and cyclic orbit codesFelice Manganiello, Anna-Lena Trautmann, Joachim Rosenthal. 1916-1920 [doi]
- High rate fibonacci polynomial codesMostafa Esmaeili, Morteza Esmaeili, T. Aaron Gulliver. 1921-1924 [doi]
- On the treewidth of MDS and Reed-Muller codesNavin Kashyap, Andrew Thangaraj. 1925-1929 [doi]
- Network-error correcting codes using small fieldsKrishnan Prasad, B. Sundar Rajan. 1930-1934 [doi]
- On essentially conditional information inequalitiesTarik Kaced, Andrei E. Romashchenko. 1935-1939 [doi]
- Further results on geometric properties of a family of relative entropiesAshok Kumar Moses, Rajesh Sundaresan. 1940-1944 [doi]
- Entropy power inequality for a family of discrete random variablesNaresh Sharma, Smarajit Das, Siddharth Muthukrishnan. 1945-1949 [doi]
- Inequalities for entropies of sets of subsets of random variablesChao Tian. 1950-1954 [doi]
- Secret sharing via noisy broadcast channelsLifeng Lai, Yingbin Liang, Wenliang Du, Shlomo Shamai. 1955-1959 [doi]
- Group secret key agreement over state-dependent wireless broadcast channelsMahdi Jafari Siavoshani, Shaunak Mishra, Suhas N. Diggavi, Christina Fragouli. 1960-1964 [doi]
- Secure multiplex coding with a common messageRyutaroh Matsumoto, Masahito Hayashi. 1965-1969 [doi]
- Key agreement over multiple access channel using feedback channelSomayeh Salimi, Mahmoud Salmasizadeh, Mohammad Reza Aref. 1970-1974 [doi]
- Distributed resource allocation for proportional fairness in multi-band wireless systemsI-Hong Hou, Piyush Gupta. 1975-1979 [doi]
- Degrees of freedom of two-user MIMO networks with random medium access control mechanismVahid Pourahmadi, Abolfazl S. Motahari, Amir K. Khandani. 1980-1984 [doi]
- Distributed scheduling for wireless networksRadhika Gowaikar, Christopher Lott, Rashid Attar, Donna Ghosh, Kambiz Azarian, Amin Jafarian. 1985-1989 [doi]
- Min-max fair coordinated beamforming via large systems analysisRanda Zakhour, Stephen V. Hanly. 1990-1994 [doi]
- Two-bit bit flipping decoding of LDPC codesDung Viet Nguyen, Bane V. Vasic, Michael W. Marcellin. 1995-1999 [doi]
- Uniformly reweighted belief propagation: A factor graph approachHenk Wymeersch, Federico Penna, Vladimir Savic. 2000-2004 [doi]
- Fast decoding of regular LDPC codes using greedy approximation algorithmsNicholas Kalouptsidis, Nicholas Kolokotronis. 2005-2009 [doi]
- Connection between annealed free energy and belief propagation on random factor graph ensemblesRyuhei Mori. 2010-2014 [doi]
- Polite water-filling for the boundary of the capacity/achievable regions of MIMO MAC/BC/interference networksAn Liu, Youjian Liu, Haige Xiang, Wu Luo. 2015-2019 [doi]
- Noncoherent SIMO pre-log via resolution of singularitiesErwin Riegler, Veniamin I. Morgenshtern, Giuseppe Durisi, Shaowei Lin, Bernd Sturmfels, Helmut Bölcskei. 2020-2024 [doi]
- Distributed STBCs with full-diversity partial interference cancellation decodingLakshmi Prasad Natarajan, B. Sundar Rajan. 2025-2029 [doi]
- A family of fast-decodable MIDO codes from crossed-product algebras over ℚLaura Luzzi, Frédérique E. Oggier. 2030-2034 [doi]
- Multi-terminal source coding with action dependent side informationYeow-Khiang Chia, Himanshu Asnani, Tsachy Weissman. 2035-2039 [doi]
- Multiterminal source coding with an entropy-based distortion measureThomas A. Courtade, Richard D. Wesel. 2040-2044 [doi]
- Efficient distributed source coding for multiple receivers via matrix sparsificationChen Avin, Michael Borokhovich, Asaf Cohen, Zvi Lotker. 2045-2049 [doi]
- On the vector Gaussian CEO problemJun Chen, Jia Wang. 2050-2054 [doi]
- Practical network coding on three-node point-to-point relay networksSilas L. Fong, Mingxi Fan, Raymond W. Yeung. 2055-2059 [doi]
- SUperposition Noisy Network CodingNeevan Ramalingam, Zhengdao Wang. 2060-2064 [doi]
- Noisy analog network coding for the two-way relay channelMajid Nasiri Khormuji, Mikael Skoglund. 2065-2069 [doi]
- Distance properties and performance of physical layer network coding with binary linear codes for Gaussian two-way relay channelsTao Yang, Ingmar Land, Tao Huang, Jinhong Yuan, Zhuo Chen. 2070-2074 [doi]
- The state-dependent interference channel with states available at a cribbing encoder and one receiverShraga I. Bross, Yossef Steinberg. 2075-2079 [doi]
- Multi-level rate-splitting for synchronous and asynchronous interference channelsHideki Yagi, H. Vincent Poor. 2080-2084 [doi]
- On interference alignment and the deterministic capacity for cellular channels with weak symmetric cross linksJörg Bühler, Gerhard Wunder. 2085-2089 [doi]
- Communication with disturbance constraintsBernd Bandemer, Abbas El Gamal. 2090-2094 [doi]
- Decomposing permutations via cost-constrained transpositionsFarzad Farnoud, Olgica Milenkovic. 2095-2099 [doi]
- Computing the ball size of frequency permutations under chebyshev distanceMin-Zheng Shieh, Shi-Chun Tsai. 2100-2104 [doi]
- Some constructions of maximal witness codesNikolaos Makriyannis, Bertrand Meyer 0002. 2105-2109 [doi]
- Causal state amplificationChiranjib Choudhuri, Young Han Kim, Urbashi Mitra. 2110-2114 [doi]
- Separate source-channel coding for broadcasting correlated GaussiansYang Gao 0003, Ertem Tuncel. 2115-2119 [doi]
- Capacity theorems for the fading interference channel with a relay and feedback linksDaniel Zahavi, Ron Dabora. 2120-2124 [doi]
- An information-theoretic approach to constructing coherent risk measuresAmir Ahmadi-Javid. 2125-2127 [doi]
- Constrained Flash memory programmingAmit Berman, Yitzhak Birk. 2128-2132 [doi]
- Quasi-cross lattice tilings with applications to flash memoryMoshe Schwartz. 2133-2137 [doi]
- Layered Index-less Indexed Flash Codes for improving average performanceRiki Suzuki, Tadashi Wadayama. 2138-2142 [doi]
- Error-correcting schemes with dynamic thresholds in nonvolatile memoriesHongchao Zhou, Anxiao Jiang, Jehoshua Bruck. 2143-2147 [doi]
- Quickest detection in censoring sensor networksYajun Mei. 2148-2152 [doi]
- Fast averagingShreeshankar Bodas, Devavrat Shah. 2153-2157 [doi]
- A variational message passing algorithm for sensor self-localization in wireless networksClaus Pedersen, Troels Pedersen, Bernard H. Fleury. 2158-2162 [doi]
- Distributed detection using MRC with censored sensors and rayleigh faded communicationsChinmoy Kundu, Sumit Kundu, GianLuigi Ferrari, Riccardo Raheli. 2163-2167 [doi]
- Generalized approximate message passing for estimation with random linear mixingSundeep Rangan. 2168-2172 [doi]
- Application of belief propagation to trust and reputation managementErman Ayday, Faramarz Fekri. 2173-2177 [doi]
- Normal factor graphs: A diagrammatic approach to linear algebraAli Al-Bashabsheh, Yongyi Mao, Pascal O. Vontobel. 2178-2182 [doi]
- A factor-graph approach to Lagrangian and Hamiltonian dynamicsPascal O. Vontobel. 2183-2187 [doi]
- On the generalized degrees of freedom of the K-user symmetric MIMO Gaussian interference channelParthajit Mohapatra, Chandra R. Murthy. 2188-2192 [doi]
- Capacity of the MIMO interference channel to within a constant gapSanjay Karmakar, Mahesh K. Varanasi. 2193-2197 [doi]
- The generalized degrees of freedom of the MIMO interference channelSanjay Karmakar, Mahesh K. Varanasi. 2198-2202 [doi]
- The degrees of freedom region of the MIMO interference channel with delayed CSITChinmay S. Vaze, Mahesh K. Varanasi. 2203-2207 [doi]
- A convergent version of Max SINR for the MIMO interference channelCraig Wilson, Venugopal V. Veeravalli. 2208-2212 [doi]
- Proactive source codingOnur Güngör 0002, Onur Ozan Koyluoglu, Hesham El Gamal, Can Emre Koksal. 2213-2217 [doi]
- Near-optimal rates for limited-delay universal lossy source codingAndrás György, Gergely Neu. 2218-2222 [doi]
- On the construction and MAP decoding of optimal variable-length error-correcting codesTing-Yi Wu, Po-Ning Chen, Fady Alajaji, Yunghsiang Sam Han. 2223-2227 [doi]
- Characterizing compressibility with Lorenz curvesClaudio Weidmann. 2228-2232 [doi]
- Incremental refinement using a Gaussian test channelJan Østergaard, Ram Zamir. 2233-2237 [doi]
- The finite field multi-way relay channel with correlated sources: The three-user caseLawrence Ong, Roy Timo, Gottfried Lechner, Sarah J. Johnson, Christopher M. Kellett. 2238-2242 [doi]
- Lattice strategies for a multi-pair bi-directional relay networkSang Joon Kim, Besma Smida, Natasha Devroye. 2243-2247 [doi]
- Feedback enlarges capacity region of two-way relay channelSilas L. Fong, Raymond W. Yeung. 2248-2252 [doi]
- A new eigen-direction alignment algorithm for physical-layer network coding in MIMO two-way relay channelsTao Yang, Xiaojun Yuan, Ping Li, Iain B. Collings, Jinhong Yuan. 2253-2257 [doi]
- On maximal error capacity regions of Symmetric Gaussian Multiple-Access ChannelsSirin Nitinawarat. 2258-2262 [doi]
- Construction of multiple access channel codes based on hash propertyJun Muramatsu, Shigeki Miyake. 2263-2267 [doi]
- Multiple access channel with partial and controlled cribbing encodersHimanshu Asnani, Haim H. Permuter. 2268-2272 [doi]
- Capacity regions of discrete asynchronous multiple access channelsLóránt Farkas, Tamás Kói. 2273-2277 [doi]
- On the capacity of a hybrid broadcast multiple access system for WDM networksVinay A. Vaishampayan, Chao Tian, Mark D. Feuer. 2278-2282 [doi]
- The ordered Hamming metric and ordered symmetric channelsWoomyoung Park, Alexander Barg. 2283-2287 [doi]
- Codes and designs related to lifted MRD codesNatalia Silberstein, Tuvi Etzion. 2288-2292 [doi]
- Combinatorial lower bound for list decoding of codes on finite-field GrassmannianRachit Agarwal 0001. 2293-2297 [doi]
- Density and bounds for Grassmannian codes with chordal distanceRenaud-Alexandre Pitaval, Olav Tirkkonen, Steven D. Blostein. 2298-2302 [doi]
- Soft-decision list decoding of Reed-Muller codes with linear complexityIlya Dumer, Grigory Kabatiansky, Cédric Tavernier. 2303-2307 [doi]
- Subspace expanders and matrix rank minimizationSamet Oymak, M. Amin Khajehnejad, Babak Hassibi. 2308-2312 [doi]
- Low-rank matrix recovery from errors and erasuresYudong Chen, Ali Jalali, Sujay Sanghavi, Constantine Caramanis. 2313-2317 [doi]
- A simplified approach to recovery conditions for low rank matricesSamet Oymak, Karthik Mohan, Maryam Fazel, Babak Hassibi. 2318-2322 [doi]
- Tight recovery thresholds and robustness analysis for nuclear norm minimizationSamet Oymak, Babak Hassibi. 2323-2327 [doi]
- Support recovery with sparsely sampled free random matricesAntonia Maria Tulino, Giuseppe Caire, Shlomo Shamai, Sergio Verdú. 2328-2332 [doi]
- Patterned cells for phase change memoriesAnxiao Jiang, Hongchao Zhou, Zhiying Wang, Jehoshua Bruck. 2333-2337 [doi]
- DRESS codes for the storage cloud: Simple randomized constructionsSameer Pawar, Nima Noorshams, Salim Y. El Rouayheb, Kannan Ramchandran. 2338-2342 [doi]
- Bounds and constructions for granular media codingArtyom Sharov, Ron M. Roth. 2343-2347 [doi]
- Symbol-pair codes: Algebraic constructions and asymptotic boundsYuval Cassuto, Simon Litsyn. 2348-2352 [doi]
- On systematic encoding for Blaum-Roth codesQian Guo, Haibin Kan. 2353-2357 [doi]
- Network control: A rate-distortion perspectiveJubin Jose, Sriram Vishwanath. 2358-2362 [doi]
- Information capacity of energy harvesting sensor nodesRamachandran Rajesh, Vinod Sharma, Pramod Viswanath. 2363-2367 [doi]
- Exploiting peer-to-peer state exchange for distributed medium access controlKa-Hung Hui, Tianyi Li, Dongning Guo, Randall A. Berry. 2368-2372 [doi]
- Delay performance of CSMA in networks with bounded degree conflict graphsVijay G. Subramanian, Murat Alanyali. 2373-2377 [doi]
- Polite water-filling for weighted sum-rate maximization in MIMO B-MAC networks under multiple linear constraintsAn Liu, Youjian Liu, Vincent K. N. Lau, Haige Xiang, Wu Luo. 2378-2382 [doi]
- Decimation-enhanced finite alphabet iterative decoders for LDPC codes on the BSCShiva Kumar Planjery, Bane V. Vasic, David Declercq. 2383-2387 [doi]
- Optimal and suboptimal receivers for maximal-rate root-LDPC codes over MIMO block-fading channelsDaniele Capirone, Alberto Tarable. 2388-2392 [doi]
- Rate-equivocation optimal spatially coupled LDPC codes for the BEC wiretap channelVishwambhar Rathi, Rüdiger L. Urbanke, Mattias Andersson, Mikael Skoglund. 2393-2397 [doi]
- Capacity achieving LDPC ensembles for the TEP decoder in erasure channelsPablo M. Olmos, Juan José Murillo-Fuentes, Fernando Pérez-Cruz. 2398-2402 [doi]
- A new capacity result for the Z-Gaussian cognitive interference channelStefano Rini, Daniela Tuninetti, Natasha Devroye. 2403-2407 [doi]
- On the capacity region of the cognitive interference channel with unidirectional destination cooperationHsuan-Yi Chu, Hsuan-Jung Su. 2408-2412 [doi]
- Capacity of a class of overlay cognitive MAC radiosGoochul Chung, Sriram Vishwanath. 2413-2417 [doi]
- Effect of uncertainties in modeling interferences in coherent and energy detectors for spectrum sensingEzio Biglieri. 2418-2421 [doi]
- On the dynamic construction of an antidictionary with linear complexityTakahiro Ota, Hiroyoshi Morita, Hirotada Fukae. 2422-2426 [doi]
- A bio-inspired approach to condensing informationRudolf Mathar, Anke Schmeink. 2427-2431 [doi]
- The "source-simplification" aspect of signalingPulkit Grover, Anant Sahai. 2432-2436 [doi]
- Physical-layer MIMO relayingAnatoly Khina, Yuval Kochman, Uri Erez. 2437-2441 [doi]
- The necessity of relay selection for beamforming in amplify-and-forward networksErdem Koyuncu, Hamid Jafarkhani. 2442-2446 [doi]
- Half-duplex relaying based on quantize-and-forwardSha Yao, Mikael Skoglund, Tùng T. Kim, H. Vincent Poor. 2447-2451 [doi]
- Modulation for MIMO networks with several usersAnatoly Khina, Ayal Hitron, Uri Erez. 2452-2456 [doi]
- The capacity region of the linear shift deterministic Y-channelAnas Chaaban, Aydin Sezgin. 2457-2461 [doi]
- Two unicast information flows over linear deterministic networksI-Hsiang Wang, Sudeep U. Kamath, David N. C. Tse. 2462-2466 [doi]
- Secret writing on dirty paper: A deterministic viewMustafa El-Halabi, Tie Liu, Costas N. Georghiades, Shlomo Shamai. 2467-2471 [doi]
- Wireless network simplification: The Gaussian N-relay diamond networkCaner Nazaroglu, Ayfer Özgür, Christina Fragouli. 2472-2476 [doi]
- Minimal trellis for systematic recursive convolutional encodersCecilio Pimentel, Richard Demo Souza, Bartolomeu F. Uchôa Filho, Isaac Benchimol. 2477-2481 [doi]
- Simultaneous code/error-trellis reduction for convolutional codes using shifted code/error-subsequencesMasato Tajima, Koji Okino, Takashi Miyagoshi. 2482-2486 [doi]
- Partial Unit Memory codes based on Gabidulin codesAntonia Wachter, Vladimir Sidorenko, Martin Bossert, Victor V. Zyablov. 2487-2491 [doi]
- Delay invariant convolutional network codesQifu Tyler Sun, Sidharth Jaggi, Shuo-Yen Robert Li. 2492-2496 [doi]
- Some limits to nonparametric estimation for ergodic processesHayato Takahashi. 2497-2498 [doi]
- Population size estimation using a few individuals as agentsFarid Movahedi Naini, Olivier Dousse, Patrick Thiran, Martin Vetterli. 2499-2503 [doi]
- Target localization with binary observations: Effect of censoring non-detecting sensorsArian Shoari, Alireza Seyedi. 2504-2508 [doi]
- Confidence sets in time-series filteringBoris Ryabko, Daniil Ryabko. 2509-2511 [doi]
- Computing the capacity of rewritable memoriesChristoph Bunte, Amos Lapidoth. 2512-2516 [doi]
- Characterizing capacity achieving write once memory codes for multilevel flash memoriesRyan Gabrys, Lara Dolecek. 2517-2521 [doi]
- Variable-level cells for nonvolatile memoriesAnxiao Jiang, Hongchao Zhou, Jehoshua Bruck. 2522-2526 [doi]
- Sum-capacity of multiple-write noisy memoryLele Wang, Young Han Kim. 2527-2531 [doi]
- Transmission control of two-user slotted ALOHA over Gilbert-Elliott channel: Stability and delay analysisAnthony Fanous, Anthony Ephremides. 2532-2536 [doi]
- Variable frame based Max-Weight algorithms for networks with switchover delayGüner D. Çelik, Sem C. Borst, Phil Whiting, Eytan Modiano. 2537-2541 [doi]
- Towards a queueing-based framework for in-network function computationSiddhartha Banerjee, Piyush Gupta, Sanjay Shakkottai. 2542-2546 [doi]
- On the scaling of non-asymptotic capacity in multi-access networks with bursty trafficFlorin Ciucu. 2547-2551 [doi]
- Windowed decoding of spatially coupled codesAravind R. Iyengar, Paul H. Siegel, Rüdiger L. Urbanke, Jack K. Wolf. 2552-2556 [doi]
- Reduced-complexity collaborative decoding of interleaved Reed-Solomon and Gabidulin codesHans Kurzweil, Mathis Seidl, Johannes B. Huber. 2557-2561 [doi]
- Threshold saturation on channels with memory via spatial couplingShrinivas Kudekar, Kenta Kasai. 2562-2566 [doi]
- Universality for the noisy Slepian-Wolf problem via spatial couplingArvind Yedla, Henry D. Pfister, Krishna R. Narayanan. 2567-2571 [doi]
- Weighted sum rate maximization for the MIMO X channel through MMSE precodingAdrian Agustin, Josep Vidal. 2572-2576 [doi]
- When Alamouti codes meet interference alignment: Transmission schemes for two-user X channelLiangbin Li, Hamid Jafarkhani, Syed Ali Jafar. 2577-2581 [doi]
- Interference alignment over asynchronous X networksHossein Najafi, Mehdi Torbatian, Mohamed Oussama Damen. 2582-2586 [doi]
- Scalar quantization with Rényi entropy constraintWolfgang Kreitmeier, Tamás Linder. 2587-2591 [doi]
- Asymmetric quantizers are better at low SNRTobias Koch, Amos Lapidoth. 2592-2596 [doi]
- A necessary and sufficient condition for transform optimality in source codingEmrah Akyol, Kenneth Rose. 2597-2601 [doi]
- Low-precision A/d conversion for maximum information rate in channels with memoryGeorg Zeitler, Andrew C. Singer, Gerhard Kramer. 2602-2606 [doi]
- Ergodic sum rate analysis of Rayleigh product MIMO channels with linear MMSE receiverCaijun Zhong, Tharmalingam Ratnarajah. 2607-2611 [doi]
- On the constrained capacity of multi-antenna fading coherent channels with discrete inputsMiguel R. D. Rodrigues. 2612-2616 [doi]
- Multiple-unicast in fading wireless networks: A separation scheme is approximately optimalSreeram Kannan, Pramod Viswanath. 2617-2621 [doi]
- Diversity-multiplexing tradeoff in a MIMO Gaussian interference channel with a relayIvana Maric, Andrea J. Goldsmith. 2622-2626 [doi]
- Capacity to within 3 bits for a class of Gaussian Interference Channels with a Cognitive RelayStefano Rini, Daniela Tuninetti, Natasha Devroye. 2627-2631 [doi]
- The capacity of the interference channel with a cognitive relay in strong interferenceStefano Rini, Daniela Tuninetti, Natasha Devroye, Andrea Goldsmith. 2632-2636 [doi]
- Interference alignment aided by relays for the quasi-static X channelDong-Sup Jin, Jong-Seon No, Dong-Joon Shin. 2637-2641 [doi]
- Lattice network coding via signal codesChen Feng, Danilo Silva, Frank R. Kschischang. 2642-2646 [doi]
- Coding for a network coded fountainShenghao Yang, Raymond W. Yeung. 2647-2651 [doi]
- Linear coding for network computingRathinakumar Appuswamy, Massimo Franceschetti, Nikhil Karamchandani, Kenneth Zeger. 2652-2655 [doi]
- On network error correction under a secret key modelDanilo Silva. 2656-2660 [doi]
- Sequential analysis in high-dimensional multiple testing and sparse recoveryMatthew Malloy, Robert Nowak. 2661-2665 [doi]
- Performance bounds for active sequential hypothesis testingMohammad Naghshvar, Tara Javidi. 2666-2670 [doi]
- On reliability approach to multiple hypotheses testing and to identification of probability distributions of two stochastically related objectsEvgueni A. Haroutunian, Aram Yessayan. 2671-2675 [doi]
- Nearly minimax changepoint detection proceduresAlexander G. Tartakovsky, Moshe Pollak. 2676-2680 [doi]
- Key reduction of McEliece's cryptosystem using list decodingMorgan Barbier, Paulo S. L. M. Barreto. 2681-2685 [doi]
- Constructing Boolean functions in odd number of variables with maximum algebraic immunityKonstantinos Limniotis, Nicholas Kolokotronis, Nicholas Kalouptsidis. 2686-2690 [doi]
- Multi-dimensional arrays for watermarkingOscar Moreno, Andrew Z. Tirkel. 2691-2695 [doi]
- Almost separating and almost secure frameproof codesMarcel Fernandez, Grigory Kabatiansky, José Moreira. 2696-2700 [doi]
- Bargaining Solution for Partial Orthogonal transmission over frequency selective interference channelEphraim Zehavi, Amir Leshem. 2701-2705 [doi]
- Coalition games for transmitter cooperation in wireless networksSrinivas Yerramalli, Rahul Jain, Urbashi Mitra. 2706-2710 [doi]
- Spectrum pricing games with arbitrary bandwidth availability probabilitiesGaurav S. Kasbekar, Saswati Sarkar. 2711-2715 [doi]
- Mixed strategy Nash equilibrium in two-user resource allocation gamesJie Gao, Sergiy A. Vorobyov, Hai Jiang. 2716-2720 [doi]
- Global estimation of anatomical connection strength in diffusion MRI tractography by message-passingMilos Ivkovic, Ashish Raj. 2721-2725 [doi]
- Absorbing set spectrum approach for practical code designJiadong Wang, Lara Dolecek, Zhengya Zhang, Richard D. Wesel. 2726-2730 [doi]
- An optimal partial decoding algorithm for rateless codesValerio Bioglio, Marco Grangetto, Rossano Gaeta, Matteo Sereno. 2731-2735 [doi]
- Degree distribution optimization in Raptor network codingNikolaos Thomos, Pascal Frossard. 2736-2740 [doi]
- A nonlinear approach to interference alignmentPeyman Razaghi, Giuseppe Caire. 2741-2745 [doi]
- Interference alignment with per-antenna power constraintsJonathan Starr, Omar El Ayach, Robert W. Heath Jr.. 2746-2750 [doi]
- Aligned interference neutralization and the degrees of freedom of the 2 × 2 × 2 interference channelTiangao Gou, Syed Ali Jafar, Sang-Woon Jeon, Sae-Young Chung. 2751-2755 [doi]
- Retrospective interference alignmentHamed Maleki, Syed Ali Jafar, Shlomo Shamai. 2756-2760 [doi]
- The rate-distortion function for product of two sources with side-information at decodersShun Watanabe. 2761-2765 [doi]
- Distributed compression of linear functions: Partial sum-rate tightness and gap to optimal sum-rateYang Yang, Zixiang Xiong. 2766-2770 [doi]
- Slepian-Wolf type problems on the erasure channelMichael Luby, Mohammad Amin Shokrollahi. 2771-2775 [doi]
- Information rates of densely sampled Gaussian dataDavid L. Neuhoff, Sandeep S. Pradhan. 2776-2780 [doi]
- On communication over unknown sparse frequency-selective block-fading channelsArun Pachai Kannu, Philip Schniter. 2781-2785 [doi]
- Nearest neighbour decoding and pilot-aided channel estimation in stationary Gaussian flat-fading channelsA. Taufiq Asyhari, Tobias Koch, Albert Guillen i Fabregas. 2786-2790 [doi]
- On the Szegö-asymptotics for doubly-dispersive Gaussian channelsPeter Jung. 2791-2795 [doi]
- Asymptotic moments for interference mitigation in correlated fading channelsJakob Hoydis, Mérouane Debbah, Mari Kobayashi. 2796-2800 [doi]
- Multiple access channel with states known noncausally at one encoder and only strictly causally at the other encoderAbdellatif Zaidi, Pablo Piantanida, Shlomo Shamai. 2801-2805 [doi]
- Leveraging strictly causal state information at the encoders for multiple access channelsMin Li, Osvaldo Simeone, Aylin Yener. 2806-2810 [doi]
- Multiple-access channel with delayed state information via directed informationUria Basher, Avihay Shirazi, Haim H. Permuter. 2811-2815 [doi]
- Spatially coupled codes over the multiple access channelShrinivas Kudekar, Kenta Kasai. 2816-2820 [doi]
- A general framework for constructing fast-decodable asymmetric space-time codesRoope Vehkalahti, Camilla Hollanti. 2821-2825 [doi]
- Maximum rate of 3- and 4-real-symbol ML decodable unitary weight STBCsTeja Damodaram Bavirisetti, B. Sundar Rajan. 2826-2830 [doi]
- An algebraic look into MAC-DMT of lattice space-time codesRoope Vehkalahti, Hsiao-feng Lu. 2831-2835 [doi]
- The complexity of sphere decoding perfect codes under a vanishing gap to ML performanceJoakim Jalden, Petros Elia. 2836-2840 [doi]
- Impulsive noise estimation and cancellation in DSL using orthogonal clusteringTareq Y. Al-Naffouri, Ahmed Abdul Quadeer, Giuseppe Caire. 2841-2845 [doi]
- Computing reliability distributions of windowed max-log-map (MLM) detectors : ISI channelsFabian Lim, Aleksandar Kavcic. 2846-2850 [doi]
- On diversity orders of distortion outage for coherent multi-access channelsChih-Hong Wang, Alex S. Leong, Subhrakanti Dey. 2851-2855 [doi]
- Distributed detection in noisy sensor networksSoummya Kar, Ravi Tandon, H. Vincent Poor, Shuguang Cui. 2856-2860 [doi]
- Assisted common information: Further resultsVinod M. Prabhakaran, Manoj Prabhakaran. 2861-2865 [doi]
- On the secrecy degrees of freedom of multi-antenna wiretap channels with delayed CSITSheng Yang, Pablo Piantanida, Mari Kobayashi, Shlomo Shamai. 2866-2870 [doi]
- Improved rate-equivocation regions for secure cooperative communicationNinoslav Marina, Hideki Yagi, H. Vincent Poor. 2871-2875 [doi]
- When is a function securely computable?Himanshu Tyagi, Prakash Narayan, Piyush Gupta. 2876-2880 [doi]
- Optimal MaxWeight scheduling in a multihop wireless network via branch and boundPradeep Chathuranga Weeraddana, Marian Codreanu, Matti Latva-aho, Anthony Ephremides. 2881-2885 [doi]
- Optimal offline packet scheduling on an energy harvesting broadcast linkFatih Mehmet Ozcelik, Hakan Erkal, Elif Uysal-Biyikoglu. 2886-2890 [doi]
- Optimality of binary power-control in a single cell via majorizationHazer Inaltekin, Stephen V. Hanly. 2891-2895 [doi]
- Extremes of random coding error exponentsAlbert Guillen i Fabregas, Ingmar Land, Alfonso Martinez. 2896-2898 [doi]
- Random-coding bounds for threshold decoders: Error exponent and saddlepoint approximationAlfonso Martinez, Albert Guillen i Fabregas. 2899-2903 [doi]
- New techniques for upper-bounding the MLD performance of binary linear codesXiao Ma, Jia Liu, Baoming Bai. 2904-2908 [doi]
- Achievable rates of MIMO-ISI systems with linear precoding and iterative LMMSE detectionXiaojun Yuan, Li Ping, Aleksandar Kavcic. 2909-2913 [doi]
- Precoder design and convergence analysis of MIMO systems with Krylov subspace receiversJun Tong, Peter J. Schreier, Steven R. Weller. 2914-2918 [doi]
- A low ML-decoding complexity, full-diversity, full-rate MIMO precoderK. Pavan Srinath, B. Sundar Rajan. 2919-2923 [doi]
- Optimal lattices for MIMO precodingDzevdan Kapetanovic, Hei Victor Cheng, Wai Ho Mow, Fredrik Rusek. 2924-2928 [doi]
- Zero-delay joint source-channel coding for the Gaussian Wyner-Ziv problemXuechen Chen, Ertem Tuncel. 2929-2933 [doi]
- Rate-distortion functions for source coding with complementary side informationRoy Timo, Alex J. Grant, Gerhard Kramer. 2934-2938 [doi]
- Robust coding for lossy computing with receiver-side observation costsBehzad Ahmadi, Osvaldo Simeone. 2939-2943 [doi]
- Cascade source coding with erased side informationRavi Tandon, Soheil Mohajer, H. Vincent Poor. 2944-2948 [doi]
- Modulation diversity in fading channels with quantized receiverSaif Khan Mohammed, Emanuele Viterbo, Yi Hong, Ananthanarayanan Chockalingam. 2949-2953 [doi]
- Outage probability under channel distribution uncertaintyIoanna Ioannou, Charalambos D. Charalambous, Sergey Loyka. 2954-2958 [doi]
- Scalar coherent fading channel: Dispersion analysisYury Polyanskiy, Sergio Verdú. 2959-2963 [doi]
- The two-user Gaussian fading broadcast channelAmin Jafarian, Sriram Vishwanath. 2964-2968 [doi]
- Gaussian fading broadcast channels with CSI only at the receivers: An improved constant gapRoy D. Yates, Jing Lei. 2969-2973 [doi]
- Effective capacity region and optimal power control for fading broadcast channelsDeli Qiao, Mustafa Cenk Gursoy, Senem Velipasalar. 2974-2978 [doi]
- Recursive stream selection for CF MU-MIMO BC precoder designMustapha Amara, Dirk T. M. Slock, Yi Yuan-Wu. 2979-2983 [doi]
- Optimum joint detection and estimationGeorge V. Moustakides. 2984-2988 [doi]
- Multiple access demodulation in the lifted signal graph with spatial couplingChristian Schlegel, Dmitri V. Truhachev. 2989-2993 [doi]
- Constrained epsilon-equalizer test for multiple hypothesis testingLionel Fillatre. 2994-2998 [doi]
- Linear programming based detectors for two-dimensional intersymbol interference channelsShrinivas Kudekar, Jason K. Johnson, Michael Chertkov. 2999-3003 [doi]
- Capacity of the Ising channel with feedbackOhad Elishco, Haim H. Permuter. 3004-3008 [doi]
- Limit theorems for the sample entropy of hidden Markov chainsGuangyue Han. 3009-3013 [doi]
- Gibbs models with a variable range of interactions on triangle gridAntonio Galves, Eugène Pechersky, Anatoly Yambartsev. 3014-3016 [doi]