Table of Contents

• Data processing lower bounds for scalar lossy source codes with side information at the decoderAvraham Reani, Neri Merhav. 1-5 [doi]
• Graph-based code design for quadratic-Gaussian Wyner-Ziv problem with arbitrary side informationYi-Peng Wei, Shih-Chun Lin, Yu-Hsiu Lin, Hsuan-Jung Su. 6-10 [doi]
• Source coding with delayed side informationOsvaldo Simeone, Haim H. Permuter. 11-15 [doi]
• A compression algorithm using mis-aligned side-informationNan Ma, Kannan Ramchandran, David N. C. Tse. 16-20 [doi]
• Construction of MIMO MAC codes achieving the pigeon hole boundToni Ernvall, Roope Vehkalahti. 21-25 [doi]
• On the sum-capacity of Gaussian MAC with peak constraintBabak Mamandipoor, Kamyar Moshksar, Amir K. Khandani. 26-30 [doi]
• Expurgation for discrete multiple-access channels via linear codesEli Haim, Yuval Kochman, Uri Erez. 31-35 [doi]
• Simpler achievable rate regions for multiaccess with finite blocklengthEbrahim MolavianJazi, J. Nicholas Laneman. 36-40 [doi]
• On two unicast wireless networks with destination-to-source feedbackI-Hsiang Wang. 41-45 [doi]
• On degrees of freedom of layered two unicast networks with delayed CSITI-Hsiang Wang, Suhas N. Diggavi. 46-50 [doi]
• On the sum secure degrees of freedom of two-unicast layered wireless networksJianwei Xie, Sennur Ulukus. 51-55 [doi]
• Approximate ergodic capacity of a class of fading 2-user 2-hop networksSang-Woon Jeon, Chien-Yi Wang, Michael Gastpar. 56-60 [doi]
• Broadcast channels with confidential messages by randomness constrained stochastic encoderShun Watanabe, Yasutada Oohama. 61-65 [doi]
• Secrecy is cheap if the adversary must reconstructCurt Schieler, Paul Cuff. 66-70 [doi]
• Imperfect secrecy in wiretap channel IIFan Cheng, Raymond W. Yeung, Kenneth W. Shum. 71-75 [doi]
• Strong secrecy in compound broadcast channels with confidential messagesRafael F. Wyrembelski, Holger Boche. 76-80 [doi]
• Burst list decoding of interleaved Reed-Solomon codesTom Kolan, Ron M. Roth. 81-85 [doi]
• List decoding algorithms based on Gröbner bases for general one-point AG codesOlav Geil, Ryutaroh Matsumoto, Diego Ruano. 86-90 [doi]
• An algorithm for list decoding number field codesJean-François Biasse, Guillaume Quintin. 91-95 [doi]
• A lifting decoding scheme and its application to interleaved linear codesGuillaume Quintin. 96-100 [doi]
• Translation association schemes, poset metrics, and the shape enumerator of codesAlexander Barg, Marcelo Firer. 101-105 [doi]
• On the uncertainty of information retrieval in associative memoriesEitan Yaakobi, Jehoshua Bruck. 106-110 [doi]
• On q-ary antipodal matchings and applicationsErik Ordentlich, Ron M. Roth, Gadiel Seroussi. 111-115 [doi]
• Optimal family of q-ary codes obtained from a substructure of generalised Hadamard matricesCarl Bracken, Yeow Meng Chee, Punarbasu Purkayastha. 116-119 [doi]
• High-rate sparse superposition codes with iteratively optimal estimatesAndrew R. Barron, Sanghee Cho. 120-124 [doi]
• The capacity of the multi-MMSE constrained Gaussian channelRonit Bustin, Shlomo Shamai (Shitz). 125-129 [doi]
• Expurgated infinite constellations at finite dimensionsAmir Ingber, Ram Zamir. 130-134 [doi]
• The capacity loss of dense constellationsTobias Koch, Alfonso Martinez, Albert Guillen i Fabregas. 135-139 [doi]
• On optimum strategies for minimizing the exponential moments of a loss functionNeri Merhav. 140-144 [doi]
• On the equivalence between Stein identity and de Bruijn identitySangwoo Park, Erchin Serpedin, Khalid A. Qaraqe. 145-149 [doi]
• Minimization of entropy functionals revisitedImre Csiszár, Frantisek Matús. 150-154 [doi]
• Shannon entropy convergence results in the countable infinite caseJorge F. Silva, Patricio Parada. 155-159 [doi]
• Sphere packing bound for quantum channelsMarco Dalai. 160-164 [doi]
• Stabilizer codes over Frobenius ringsSushma Nadella, Andreas Klappenecker. 165-169 [doi]
• Nice nearringsAndreas Klappenecker. 170-173 [doi]
• A general formula of rate-distortion functions for source coding with side information at many decodersTetsunao Matsuta, Tomohiko Uyematsu. 174-178 [doi]
• On the Heegard-Berger problem with common reconstruction constraintsBehzad Ahmadi, Ravi Tandon, Osvaldo Simeone, H. Vincent Poor. 179-183 [doi]
• Distributed and cascade lossy source coding with a side information "vending machine"Behzad Ahmadi, Osvaldo Simeone. 184-188 [doi]
• Information masking and amplification: The source coding settingThomas A. Courtade. 189-193 [doi]
• Multiple description coding based compress-and-forward for the broadcast relay channelSeçkin Anil Yildirim, Melda Yuksel. 194-198 [doi]
• Broadcast correlated Gaussians: The vector-scalar caseLin Song, Jun Chen, Chao Tian. 199-203 [doi]
• Quadratic Gaussian source broadcast with individual bandwidth mismatchesLouis Tan, Ashish Khisti, Emina Soljanin. 204-208 [doi]
• The broadcast approach under mixed delay constraintsKfir M. Cohen, Avi Steiner, Shlomo Shamai (Shitz). 209-213 [doi]
• Is Gaussian noise the worst-case additive noise in wireless networks?Ilan Shomorony, Amir Salman Avestimehr. 214-218 [doi]
• Optimized flow allocation for anonymous communication in multipath wireless networksChouchang Yang, Basel Alomair, Radha Poovendran. 219-223 [doi]
• Can geographic routing scale when nodes are mobile?Dinesh Ramasamy, Upamanyu Madhow. 224-228 [doi]
• An asymptotically optimal push-pull method for multicasting over a random networkVasuki Narasimha Swamy, Rajesh Sundaresan, Pramod Viswanath. 229-233 [doi]
• Broadcasting over fading wiretap channelsYingbin Liang, Lifeng Lai, H. Vincent Poor, Shlomo Shamai (Shitz). 234-238 [doi]
• On the ergodic secret message capacity of the wiretap channel with finite-rate feedbackZouheir Rezki, Ashish Khisti, Mohamed-Slim Alouini. 239-243 [doi]
• Capacity region of non-degraded wiretap channel with noiseless feedbackBin Dai, A. J. Han Vinck, Yuan Luo, Zhuojun Zhuang. 244-248 [doi]
• An achievable region for the Wiretap multiple-access channel with common messageMoritz Wiese, Holger Boche. 249-253 [doi]
• Projected subcodes of the second order binary Reed-Muller codeMatthieu Legeay, Pierre Loidreau. 254-258 [doi]
• Spherically punctured biorthogonal codesIlya Dumer, Olga Kapralova. 259-263 [doi]
• Multiplicative secret sharing schemes from Reed-Muller type codesIwan M. Duursma, Jiashun Shen. 264-268 [doi]
• Partial permutation decoding for abelian codesJosé Joaquín Bernal, Juan Jacobo Simón. 269-273 [doi]
• On embedding conditions of shifts of finite type into the Fibonacci-Dyck shiftHiroshi Fujisaki. 274-278 [doi]
• Approximately counting the number of constrained arrays via the sum-product algorithmFarzad Parvaresh, Pascal O. Vontobel. 279-283 [doi]
• On codes for structured burstsLuis Alfonso Lastras-Montaño, Mario Blaum. 284-288 [doi]
• Erasure coding for real-time streamingDerek Leong, Tracey Ho. 289-293 [doi]
• On the capacity of additive white alpha-stable noise channelsJihad Fahs, Ibrahim C. Abou-Faycal. 294-298 [doi]
• Bounds on the capacity of the additive inverse Gaussian noise channelHui-Ting Chang, Stefan M. Moser. 299-303 [doi]
• Achievable rates of Gaussian channels with realistic duty cycle and power constraintsHui Li, Dongning Guo. 304-308 [doi]
• An efficient algorithm to calculate BICM capacityGeorg Böcherer, Fabian Altenbach, Alex Alvarado, Steven Corroy, Rudolf Mathar. 309-313 [doi]
• Quantization effect on second moment of log-likelihood ratio and its application to decentralized sequential detectionYan Wang, Yajun Mei. 314-318 [doi]
• The sufficiency principle for decentralized data reductionGe Xu, Biao Chen. 319-323 [doi]
• Nonparametric decentralized detection based on weighted count kernelJiayao Hu, Yingbin Liang, Eric P. Xing. 324-328 [doi]
• Distributed estimation in multi-agent networksLalitha Sankar, H. Vincent Poor. 329-333 [doi]
• Quantum polar codes for arbitrary channelsMark M. Wilde, Joseph M. Renes. 334-338 [doi]
• A construction of quantum codes via a class of classical polynomial codesLingfei Jin, Chaoping Xing. 339-342 [doi]
• Quantum LDPC codes obtained by non-binary constructionsIryna Andriyanova, Denise Maurice, Jean-Pierre Tillich. 343-347 [doi]
• Improved quantum hypergraph-product LDPC codesAlexandr Kovalev, Leonid P. Pryadko. 348-352 [doi]
• On real-time and causal secure source codingYonatan Kaspi, Neri Merhav. 353-357 [doi]
• Rate-distortion behavior at low distortion for densely sampled Gaussian dataDavid L. Neuhoff, S. Sandeep Pradhan. 358-362 [doi]
• Pointwise lossy source coding theorem for sources with memoryBarlas Oguz, Venkat Anantharam. 363-367 [doi]
• Gaussian rate-distortion via sparse linear regression over compact dictionariesRamji Venkataramanan, Antony Joseph, Sekhar Tatikonda. 368-372 [doi]
• Lossy source coding via spatially coupled LDGM ensemblesVahid Aref, Nicolas Macris, Rüdiger L. Urbanke, Marc Vuffray. 373-377 [doi]
• On three-receiver more capable channelsChandra Nair, Lingxiao Xia. 378-382 [doi]
• The capacity region of some classes of parallel degraded broadcast channels with three receivers and three-degraded message setsHon-Fah Chong, Ying-Chang Liang. 383-387 [doi]
• Broadcast capacity regions with three receivers and message cognitionTobias J. Oechtering, Michele A. Wigger, Roy Timo. 388-392 [doi]
• Three-receiver broadcast channels with side informationSaeed Hajizadeh, Ghosheh Abed Hodtani. 393-397 [doi]
• Is non-unique decoding necessary?Shirin Saeedi Bidokhti, Vinod M. Prabhakaran, Suhas N. Diggavi. 398-402 [doi]
• Blind compute-and-forwardChen Feng, Danilo Silva, Frank R. Kschischang. 403-407 [doi]
• Rateless coded hybrid amplify/decode-forward cooperation for wireless multicastTalha A. Khan, Momin Uppal, Anders Høst-Madsen, Zixiang Xiong. 408-412 [doi]
• Dynamic QMF for half-duplex relay networksAyfer Özgür, Suhas N. Diggavi. 413-417 [doi]
• Joint optimization of the transmit covariance and the relay precoder in general Gaussian amplify-and-forward relay channelsRamy H. Gohary, Halim Yanikomeroglu. 418-422 [doi]
• Layered quantize-forward for the two-way relay channelHieu T. Do, Tobias J. Oechtering, Mikael Skoglund. 423-427 [doi]
• Broadcasting private messages securelyLászló Czap, Vinod M. Prabhakaran, Suhas N. Diggavi, Christina Fragouli. 428-432 [doi]
• On private broadcasting over independent parallel channelsAshish Khisti, Tie Liu. 433-437 [doi]
• Degraded broadcast channel with noncausal side information, confidential messages and noiseless feedbackBin Dai, Jiehua Hong, A. J. Han Vinck, Yuan Luo, Zhuojun Zhuang. 438-442 [doi]
• On optimal signaling over secure MIMO channelsSergey Loyka, Charalambos D. Charalambous. 443-447 [doi]
• Square root law for communication with low probability of detection on AWGN channelsBoulat A. Bash, Dennis Goeckel, Don Towsley. 448-452 [doi]
• Spatially coupled ensembles universally achieve capacity under belief propagationShrinivas Kudekar, Tom Richardson, Rüdiger L. Urbanke. 453-457 [doi]
• How to prove the Maxwell conjecture via spatial coupling - A proof of conceptAndrei Giurgiu, Nicolas Macris, Rüdiger L. Urbanke. 458-462 [doi]
• Spatially-coupled binary MacKay-Neal codes for channels with non-binary inputs and affine subspace outputsKenta Kasai, Takayuki Nozaki, Kohichi Sakaniwa. 463-467 [doi]
• Improving spatially coupled LDPC codes by connecting chainsDmitri V. Truhachev, David G. M. Mitchell, Michael Lentmaier, Daniel J. Costello Jr.. 468-472 [doi]
• Distance spectrum estimation of LDPC convolutional codesHua Zhou, David G. M. Mitchell, Norbert Goertz, Daniel J. Costello Jr.. 473-477 [doi]
• Spatially-coupled random access on graphsGianluigi Liva, Enrico Paolini, Michael Lentmaier, Marco Chiani. 478-482 [doi]
• Biff (Bloom filter) codes: Fast error correction for large data setsMichael Mitzenmacher, George Varghese. 483-487 [doi]
• Distributed rateless coding with cooperative sourcesMahyar Shirvanimoghaddam, Yonghui Li, Branka Vucetic. 488-492 [doi]
• On matching short LDPC codes with spectrally-efficient modulationStefan Nowak, Ruediger Kays. 493-497 [doi]
• On the power transfer of error-control codes for RFID communicationsGuang Yang, Eirik Rosnes, Angela I. Barbero, Øyvind Ytrehus. 498-502 [doi]
• A characterization of the number of subsequences obtained via the deletion channelYuvalal Liron, Michael Langberg. 503-507 [doi]
• Adaptive synchronization marker for insertion/deletion/substitution error correctionMasato Inoue, Haruhiko Kaneko. 508-512 [doi]
• A coloring approach to constructing deletion correcting codes from constant weight subgraphsDaniel Cullina, Ankur A. Kulkarni, Negar Kiyavash. 513-517 [doi]
• Directed information on abstract spaces: Properties and extremum problemsCharalambos D. Charalambous, Photios Stavrou. 518-522 [doi]
• Universal estimation of directed information via sequential probability assignmentsJiantao Jiao, Haim H. Permuter, Lei Zhao, Young Han Kim, Tsachy Weissman. 523-527 [doi]
• Lossy common information of two dependent random variablesKumar Viswanatha, Emrah Akyol, Kenneth Rose. 528-532 [doi]
• 2-statisticsPeter Harremoës, Gábor E. Tusnády. 533-537 [doi]
• Application of information-type divergences to constructing multiple-priors and variational preferencesAmir Ahmadi-Javid. 538-540 [doi]
• The ultimate limits of optical communication efficiency with photon-counting receiversSam Dolinar, Baris I. Erkmen, Bruce E. Moision, Kevin M. Birnbaum, Dariush Divsalar. 541-545 [doi]
• Polar coding to achieve the Holevo capacity of a pure-loss optical channelSaikat Guha, Mark M. Wilde. 546-550 [doi]
• Explicit capacity-achieving receivers for optical communication and quantum readingMark M. Wilde, Saikat Guha, Si-Hui Tan, Seth Lloyd. 551-555 [doi]
• Quantum M-ary phase shift keyingRanjith Nair, Brent J. Yen, Saikat Guha, Jeffrey H. Shapiro, Stefano Pirandola. 556-560 [doi]
• On lossless universal compression of distributed identical sourcesAhmad Beirami, Faramarz Fekri. 561-565 [doi]
• Polar coding for the Slepian-Wolf problem based on monotone chain rulesErdal Arikan. 566-570 [doi]
• On the vector Gaussian L-terminal CEO problemJia Wang, Jun Chen. 571-575 [doi]
• An outer bound for the vector Gaussian CEO problemErsen Ekrem, Sennur Ulukus. 576-580 [doi]
• On Marton's inner bound for broadcast channelsAmin Aminzadeh Gohari, Chandra Nair, Venkat Anantharam. 581-585 [doi]
• The capacity region of the two-receiver vector Gaussian broadcast channel with private and common messagesYanlin Geng, Chandra Nair. 586-590 [doi]
• The state-dependent semideterministic broadcast channelAmos Lapidoth, Ligong Wang. 591-595 [doi]
• The degraded broadcast channel with action-dependent statesYossef Steinberg, Tsachy Weissman. 596-600 [doi]
• Percolation in directed random geometric graphsOlivier Dousse. 601-605 [doi]
• Power optimization on a network: The effects of randomnessAris L. Moustakas, Nicholas Bambos. 606-610 [doi]
• Cooperation versus interference in large wireless relay networksAndres Altieri, Leonardo Rey Vega, Cecilia G. Galarza, Pablo Piantanida. 611-615 [doi]
• Interference and throughput in Aloha-based ad hoc networks with isotropic node distributionRalph Tanbourgi, Holger Jäkel, Leonid Chaichenets, Friedrich Jondral. 616-620 [doi]
• Capacity achieving linear codes with random binary sparse generating matrices over the Binary Symmetric ChannelA. Makhdoumi Kakhaki, H. Karkeh Abadi, Pedram Pad, Hamid Saeedi, Farokh Marvasti, Kasra Alishahi. 621-625 [doi]
• Nested lattice codes for arbitrary continuous sources and channelsAria Ghasemian Sahebi, S. Sandeep Pradhan. 626-630 [doi]
• Codes over non-Abelian groups: Point-to-point communications and computation over MACAria Ghasemian Sahebi, S. Sandeep Pradhan. 631-635 [doi]
• Efficient decoding of permutation codes obtained from distance preserving mapsYeow Meng Chee, Punarbasu Purkayastha. 636-640 [doi]
• Observability, controllability and local reducibility of linear codes on graphsG. David Forney Jr., Heide Gluesing-Luerssen. 641-645 [doi]
• Reducing complexity of tail-biting trellisesHeide Gluesing-Luerssen, G. David Forney Jr.. 646-650 [doi]
• A graphical revisit of the Krawtchouk transformYongyi Mao, Terence H. Chan. 651-655 [doi]
• A factor-graph representation of probabilities in quantum mechanicsHans-Andrea Loeliger, Pascal O. Vontobel. 656-660 [doi]
• Importance of symbol equity in coded modulation for power line communicationsYeow Meng Chee, Han Mao Kiah, Punarbasu Purkayastha, Chengmin Wang. 661-665 [doi]
• Optimal equitable symbol weight codes for power line communicationsYeow Meng Chee, Han Mao Kiah, Alan C. H. Ling, Chengmin Wang. 666-670 [doi]
• Codes for locating objects in sensor networksVille Junnila, Tero Laihonen, Aline Parreau. 671-675 [doi]
• New lower bounds for identifying codes in infinite gridsVille Junnila, Tero Laihonen. 676-680 [doi]
• Improved upper bounds on the capacity of binary channels with causal adversariesBikash Kumar Dey, Sidharth Jaggi, Michael Langberg, Anand D. Sarwate. 681-685 [doi]
• Finding the capacity of a quantized binary-input DMCBrian M. Kurkoski, Hideki Yagi. 686-690 [doi]
• On the capacity of binary input symmetric q-ary output channels with synchronization errorsMojtaba Rahmati, Tolga M. Duman. 691-695 [doi]
• Mutual information and relative entropy over the Binomial and Negative Binomial channelsCamilo G. Taborda, Fernando Pérez-Cruz. 696-700 [doi]
• Pointwise relations between information and estimation in Gaussian noiseKartik Venkat, Tsachy Weissman. 701-705 [doi]
• Estimation with a helper who knows the interferenceYeow-Khiang Chia, Rajiv Soundararajan, Tsachy Weissman. 706-710 [doi]
• Rate distortion codes for the collective estimation from independent noisy observationsTatsuto Murayama, Peter Davis. 711-715 [doi]
• Mismatched MMSE estimation of multivariate Gaussian sourcesInaki Esnaola, Antonia Maria Tulino, H. Vincent Poor. 716-720 [doi]
• Classical codes for quantum broadcast channelsIvan Savov, Mark M. Wilde. 721-725 [doi]
• Capacities of classical compound quantum wiretap and classical quantum compound wiretap channelsMinglai Cai, Ning Cai, Christian Deppe. 726-730 [doi]
• Partial decode-forward for quantum relay channelsIvan Savov, Mark M. Wilde, Mai Vu. 731-735 [doi]
• Achieving the Han-Kobayashi inner bound for the quantum interference channelPranab Sen. 736-740 [doi]
• On symmetric L1 distance error control codes and elementary symmetric functionsLuca G. Tallini, Bella Bose. 741-745 [doi]
• On symmetric/asymmetric Lee distance error control codes and elementary symmetric functionsLuca G. Tallini, Bella Bose. 746-750 [doi]
• New constructions of codes for asymmetric channels via concatenationMarkus Grassl, Peter W. Shor, Graeme Smith, John A. Smolin, Bei Zeng. 751-755 [doi]
• The effect of zero-rate encoders in the multi-terminal source coding problemBadri N. Vellambi. 756-760 [doi]
• Multiterminal source coding under logarithmic lossThomas A. Courtade, Tsachy Weissman. 761-765 [doi]
• On cooperation in multi-terminal computation and rate distortionMilad Sefidgaran, Aslan Tchamkerten. 766-770 [doi]
• Polynomials and computing functions of correlated sourcesSheng Huang, Mikael Skoglund. 771-775 [doi]
• An upper bound on relaying over capacityFeng Xue. 776-780 [doi]
• Buffer-aided relaying in a three node networkNikola Zlatanov, Robert Schober, Lutz Lampe. 781-785 [doi]
• The capacity region of restricted multi-way relay channels with deterministic uplinksLawrence Ong, Sarah J. Johnson. 786-790 [doi]
• The finite field multi-way relay channel with correlated sources: Beyond three usersLawrence Ong, Roy Timo, Sarah J. Johnson. 791-795 [doi]
• Reliable versus unreliable transmission for energy efficient transmission in relay networksAnders Høst-Madsen, Nan Jiang, Yang Yang, Zixiang Xiong. 796-800 [doi]
• Bounds on the minimum energy-per-bit for bursty traffic in diamond networksIlan Shomorony, Raúl H. Etkin, Farzad Parvaresh, Amir Salman Avestimehr. 801-805 [doi]
• Impact of channel and source variations on the energy efficiency under QoS constraintsMustafa Ozmen, Mustafa Cenk Gursoy. 806-810 [doi]
• Energy efficient greedy link scheduling and power control in wireless networksArun Sridharan, Changhee Joo, Can Emre Koksal. 811-815 [doi]
• Second-order achievable rates in random number generation for mixed sourcesRyo Nomura, Te Sun Han. 816-820 [doi]
• Moderate deviations analysis of binary hypothesis testingIgal Sason. 821-825 [doi]
• The log-volume of optimal constant-composition codes for memoryless channels, within O(1) bitsPierre Moulin. 826-830 [doi]
• Finite blocklength coding for multiple access channelsYen-Wei Huang, Pierre Moulin. 831-835 [doi]
• Hyper-bent functions via Dillon-like exponentsSihem Mesnager, Jean-Pierre Flori. 836-840 [doi]
• New classes of generalized boolean bent functions over Z4Nian Li, Xiaohu Tang, Tor Helleseth. 841-845 [doi]
• An optimal sampling technique for distinguishing random S-boxesPaul Stankovski, Martin Hell. 846-850 [doi]
• Cross-recurrence property of m-sequencesFarhad Hemmati. 851-854 [doi]
• Channel capacity under general nonuniform samplingYuxin Chen, Yonina C. Eldar, Andrea J. Goldsmith. 855-859 [doi]
• Continuous time channels with interferenceIoana Ivan, Michael Mitzenmacher, Justin Thaler, Henry Yuen. 860-864 [doi]
• On establishing the Shannon ordering for discrete memoryless channelsYuan Zhang, Cihan Tepedelenlioglu. 865-869 [doi]
• Ergodic capacity ordering of fading channelsAdithya Rajan, Cihan Tepedelenlioglu. 870-874 [doi]
• Penalized maximum likelihood methods for finite memory estimators of infinite memory processesZsolt Talata. 875-879 [doi]
• Piecewise constant predictionErik Ordentlich, Marcelo J. Weinberger, Yihong Wu. 880-884 [doi]
• Efficient tracking of large classes of expertsAndrás György, Tamás Linder, Gábor Lugosi. 885-889 [doi]
• Precise evaluation of leaked information with universal2 privacy amplification in the presence of quantum attackerMasahito Hayashi. 890-894 [doi]
• Quantum wiretap channel with non-uniform random number and its exponent of leaked informationMasahito Hayashi. 895-899 [doi]
• Entanglement cost of quantum channelsMario Berta, Matthias Christandl, Fernando G. S. L. Brandão, Stephanie Wehner. 900-904 [doi]
• Mutually unbiased bases as submodules and subspacesJoanne L. Hall, Jan Stovicek. 905-909 [doi]
• A simple technique for bounding the redundancy of source coding with side informationShigeaki Kuzuoka. 910-914 [doi]
• The dispersion of Slepian-Wolf codingVincent Y. F. Tan, Oliver Kosut. 915-919 [doi]
• Moderate-deviations of lossy source coding for discrete and Gaussian sourcesVincent Y. F. Tan. 920-924 [doi]
• Relations between redundancy patterns of the Shannon code and wave diffraction patterns of partially disordered mediaNeri Merhav. 925-929 [doi]
• Code design for very noisy relay channelsPuripong Suthisopapan, Kenta Kasai, Anupap Meesomboon, Virasit Imtawil, Kohichi Sakaniwa. 930-934 [doi]
• Algebraic fast-decodable relay codes for distributed communicationsCamilla Hollanti, Nadya Markin. 935-939 [doi]
• Superposition of binary and Gaussian codebooks to relay data in diamond networksFarzad Parvaresh, Raúl H. Etkin. 940-944 [doi]
• Erasure-correcting vs. erasure-detecting codes for the full-duplex binary erasure relay channelMarina Ivashkina, Iryna Andriyanova, Pablo Piantanida, Charly Poulliat. 945-949 [doi]
• Wireless information transfer with opportunistic energy harvestingLiang Liu, Rui Zhang, Kee Chaing Chua. 950-954 [doi]
• Optimal save-then-transmit protocol for energy harvesting wireless transmittersShixin Luo, Rui Zhang 0006, Teng Joon Lim. 955-959 [doi]
• On optimal online policies in energy harvesting systems for compound poisson energy arrivalsPatrick Mitran. 960-964 [doi]
• Energy cooperation in energy harvesting wireless communicationsBerk Gurakan, Omur Ozel, Jing Yang 0002, Sennur Ulukus. 965-969 [doi]
• Dynamic intrusion detection in resource-constrained cyber networksKeqin Liu, Qing Zhao. 970-974 [doi]
• A Byzantine attack defender: The Conditional Frequency CheckXiaofan He, Huaiyu Dai, Peng Ning. 975-979 [doi]
• Distributed ranking in networks with limited memory and communicationKyomin Jung, Bo Young Kim, Milan Vojnovic. 980-984 [doi]
• Degree-guided map-reduce task assignment with data locality constraintQiaomin Xie, Yi Lu. 985-989 [doi]
• Trade-offs between instantaneous and total capacity in multi-cell flash memoriesEyal En Gad, Anxiao Jiang, Jehoshua Bruck. 990-994 [doi]
• Optimized cell programming for flash memories with quantizersMinghai Qin, Eitan Yaakobi, Paul H. Siegel. 995-999 [doi]
• Tackling intracell variability in TLC Flash through tensor product codesRyan Gabrys, Eitan Yaakobi, Laura M. Grupp, Steven Swanson, Lara Dolecek. 1000-1004 [doi]
• Coding strategies for the uniform noise rewritable channel with hidden stateRamji Venkataramanan, Sekhar Tatikonda, Luis Alfonso Lastras-Montaño, Michele Franceschini. 1005-1009 [doi]
• Meeting the Levenshtein bound with equality by weighted-correlation complementary setZi-Long Liu, Yong Liang Guan. 1010-1013 [doi]
• 2k+1Ji-Youp Kim, Sung-Tai Choi, Tae-Hyung Lim, Jong-Seon No, Habong Chung. 1014-1018 [doi]
• Large zero periodic autocorrelation zone of Golay sequencesGuang Gong, Fei Huo, Yang Yang. 1019-1023 [doi]
• Large zero odd periodic autocorrelation zone of Golay sequences and QAM Golay sequencesYang Yang, Fei Huo, Guang Gong. 1024-1028 [doi]
• Linear information coupling problemsShao-Lun Huang, Lizhong Zheng. 1029-1033 [doi]
• Cut-set bound for generalized networksSilas L. Fong, Raymond W. Yeung, Gerhard Kramer. 1034-1038 [doi]
• Cut-set bound for generalized networks with positive delaySilas L. Fong, Raymond W. Yeung. 1039-1043 [doi]
• Achievability proof via output statistics of random binningMohammad Hossein Yassaee, Mohammad Reza Aref, Amin Gohari. 1044-1048 [doi]
• Constrained probabilityJan C. Willems. 1049-1053 [doi]
• Estimation of the entropy on the basis of its polynomial representationMartin Vinck, Francesco Paolo Battaglia, Vladimir B. Balakirsky, A. J. Han Vinck, Cyriel M. A. Pennartz. 1054-1058 [doi]
• q-Gaussian based Smoothed Functional algorithms for stochastic optimizationDebarghya Ghoshdastidar, Ambedkar Dukkipati, Shalabh Bhatnagar. 1059-1063 [doi]
• Multi-level error-resilient neural networksAmir Hesam Salavati, Amin Karbasi. 1064-1068 [doi]
• Work recoverable from two-particle informationLev B. Levitin, Tommaso Toffoli. 1069-1071 [doi]
• Entropy rate calculations of algebraic measuresKaty Marchand, Jaideep Mulherkar, Bruno Nachtergaele. 1072-1076 [doi]
• Necessary and sufficient conditions for minimax strategy in quantum signal detectionKentaro Kato. 1077-1081 [doi]
• Planar difference functionsJoanne L. Hall, Asha Rao, Diane Donovan. 1082-1086 [doi]
• Results on the fundamental gain of memory-assisted universal source codingAhmad Beirami, Mohsen Sardari, Faramarz Fekri. 1087-1091 [doi]
• On fast and memory-efficient construction of an antidictionary arrayHirotada Fukae, Takahiro Ota, Hiroyoshi Morita. 1092-1096 [doi]
• Information spectrum approach to overflow probability of variable-length codes with conditional cost functionRyo Nomura, Toshiyasu Matsushima. 1097-1101 [doi]
• Bounds on estimated Markov orders of individual sequencesLuciana Vitale, Alvaro Martín, Gadiel Seroussi. 1102-1106 [doi]
• Variable-length extractorsHongchao Zhou, Jehoshua Bruck. 1107-1111 [doi]
• Simple schedules for half-duplex networksSiddhartha Brahma, Ayfer Özgür, Christina Fragouli. 1112-1116 [doi]
• Reducibility of joint relay positioning and flow optimization problemMohit Thakur, Nadia Fawaz, Muriel Médard. 1117-1121 [doi]
• Wireless network-level partial relay cooperationNikolaos Pappas, Jeongho Jeon, Anthony Ephremides, Apostolos Traganitis. 1122-1126 [doi]
• Wireless MIMO switching with MMSE relayingFanggang Wang, Soung Chang Liew, Dongning Guo. 1127-1131 [doi]
• Spectral efficiency limits in pilot-assisted cooperative communicationsAngel E. Lozano, Jeffrey G. Andrews, Robert W. Heath Jr.. 1132-1136 [doi]
• Pilot contamination precoding in multi-cell large scale antenna systemsAlexei E. Ashikhmin, Thomas L. Marzetta. 1137-1141 [doi]
• Wireless network control with privacy using hybrid ARQYunus Sarikaya, Özgür Erçetin, Can Emre Koksal. 1142-1146 [doi]
• Reverse compute and forward: A low-complexity architecture for downlink distributed antenna systemsSong-Nam Hong, Giuseppe Caire. 1147-1151 [doi]
• Base station cooperation with limited feedback: A large system analysisRusdha Muharar, Randa Zakhour, Jamie Evans. 1152-1156 [doi]
• Distributed computing with privacyHimanshu Tyagi. 1157-1161 [doi]
• Secure computation in a bidirectional relayNavin Kashyap, V. Shashank, Andrew Thangaraj. 1162-1166 [doi]
• On the secrecy capacity of 3-receiver Broadcast Channel with causal states and conferencingSadaf Salehkalaibar, Mohammad Reza Aref. 1167-1171 [doi]
• On secure communication with constrained randomizationMatthieu R. Bloch, Jörg Kliewer. 1172-1176 [doi]
• Secure transmission of a Gaussian source over Gaussian channels with side informationJoffrey Villard, Pablo Piantanida, Shlomo Shamai (Shitz). 1177-1181 [doi]
• Long MDS codes for optimal repair bandwidthZhiying Wang, Itzhak Tamo, Jehoshua Bruck. 1182-1186 [doi]
• Access vs. bandwidth in codes for storageItzhak Tamo, Zhiying Wang, Jehoshua Bruck. 1187-1191 [doi]
• Functional-repair-by-transfer regenerating codesKenneth W. Shum, Yuchong Hu. 1192-1196 [doi]
• Exact scalar minimum storage coordinated regenerating codesNicolas Le Scouarnec. 1197-1201 [doi]
• Regenerating codes for errors and erasures in distributed storageK. V. Rashmi, Nihar B. Shah, Kannan Ramchandran, P. Vijay Kumar. 1202-1206 [doi]
• On inverses of APN exponentsGohar M. M. Kyureghyan, Valentin Suder. 1207-1211 [doi]
• Generalized bent functions and their relation to Maiorana-McFarland classLilya Budaghyan, Claude Carlet, Tor Helleseth, Alexander Kholosha. 1212-1215 [doi]
• Binary Niho sequences with four-valued cross correlationsJinquan Luo, Tor Helleseth. 1216-1220 [doi]
• Rotating-table game and construction of periodic sequences with lightweight calculationMin Zeng, Yuan Luo, Guang Gong. 1221-1225 [doi]
• Low Probability of Intercept properties of some binary sequence families with good correlation propertiesSerdar Boztas, Udaya Parampalli. 1226-1230 [doi]
• Information-theoretically optimal compressed sensing via spatial coupling and approximate message passingDavid L. Donoho, Adel Javanmard, Andrea Montanari. 1231-1235 [doi]
• Hybrid generalized approximate message passing with applications to structured sparsitySundeep Rangan, Alyson K. Fletcher, Vivek K. Goyal, Philip Schniter. 1236-1240 [doi]
• Quantized stochastic belief propagation: Efficient message-passing for continuous state spacesNima Noorshams, Martin J. Wainwright. 1241-1245 [doi]
• Iterative estimation of constrained rank-one matrices in noiseSundeep Rangan, Alyson K. Fletcher. 1246-1250 [doi]
• Entropy functions and determinant inequalitiesTerence H. Chan, Dongning Guo, Raymond W. Yeung. 1251-1255 [doi]
• Non-entropic inequalities from information constraintsSiu-Wai Ho, Terence Chan, Alex J. Grant. 1256-1260 [doi]
• Sumset inequalities for differential entropy and mutual informationIoannis Kontoyiannis, Mokshay M. Madiman. 1261-1265 [doi]
• An information theoretic perspective over an extremal entropy inequalitySangwoo Park, Erchin Serpedin, Khalid A. Qaraqe. 1266-1270 [doi]
• Data processing inequalities based on a certain structured class of information measures with application to estimation theoryNeri Merhav. 1271-1275 [doi]
• Compressive principal component pursuitJohn Wright, Arvind Ganesh, Kerui Min, Yi Ma. 1276-1280 [doi]
• Principal Component Pursuit with reduced linear measurementsArvind Ganesh, Kerui Min, John Wright, Yi Ma. 1281-1285 [doi]
• Bilateral random projectionsTianyi Zhou, Dacheng Tao. 1286-1290 [doi]
• Compressed sensing on the image of bilinear mapsPhilipp Walk, Peter Jung. 1291-1295 [doi]
• SPIN: Iterative signal recovery on incoherent manifoldsChinmay Hegde, Richard G. Baraniuk. 1296-1300 [doi]
• On a construction of universal network code using LDPC matricesShigeki Miyake, Jun Muramatsu. 1301-1305 [doi]
• Properties of network polynomialsB. Javad Ebrahimi, Christina Fragouli. 1306-1310 [doi]
• Network coding aware resource allocation to improve throughputDan Zhang, Kai Su, Narayan B. Mandayam. 1311-1315 [doi]
• Min-cost multicast networks in Euclidean spaceXunrui Yin, Yan Wang, Xin Wang 0002, Xiangyang Xue, Zongpeng Li. 1316-1320 [doi]
• Selective coding strategy for unicast composite networksArash Behboodi, Pablo Piantanida. 1321-1325 [doi]
• Causal relay networks with causal side informationIhn-Jung Baik, Sae-Young Chung. 1326-1330 [doi]
• Partial decode-forward binning for full-duplex causal cognitive interference channelsZhuohua Wu, Mai Vu. 1331-1335 [doi]
• Combined decode-forward and layered noisy network coding schemes for relay channelsPeng Zhong, Mai Vu. 1336-1340 [doi]
• Energy-efficient sensing and communication of parallel Gaussian sourcesXi Liu, Osvaldo Simeone, Elza Erkip. 1341-1345 [doi]
• Achievable rates for intermittent communicationMostafa Khoshnevisan, J. Nicholas Laneman. 1346-1350 [doi]
• Energy state amplification in an energy harvesting communication systemOmur Ozel, Sennur Ulukus. 1351-1355 [doi]
• On energy/information cross-layer architecturesLav R. Varshney. 1356-1360 [doi]
• Gaussian robust sequential and predictive codingLin Song, Jun Chen, Jia Wang, Tie Liu. 1361-1365 [doi]
• Successive refinement with cribbing decoders and its channel coding dualsHimanshu Asnani, Haim H. Permuter, Tsachy Weissman. 1366-1370 [doi]
• Combinatorial message sharing and random binning for multiple description codingEmrah Akyol, Kumar Viswanatha, Kenneth Rose. 1371-1375 [doi]
• Gaussian multiple descriptions with common and constrained reconstruction constraintsRavi Tandon, Behzad Ahmadi, Osvaldo Simeone, H. Vincent Poor. 1376-1380 [doi]
• Making WOM codes decodable using short synchronous WOM codesNicolas Bitouze, Alexandre Graell i Amat, Eirik Rosnes. 1381-1385 [doi]
• High sum-rate three-write and non-binary WOM codesEitan Yaakobi, Amir Shpilka. 1386-1390 [doi]
• Short q-ary WOM codes with hot/cold write differentiationYuval Cassuto, Eitan Yaakobi. 1391-1395 [doi]
• WOM with retained messagesLele Wang, Minghai Qin, Eitan Yaakobi, Young Han Kim, Paul H. Siegel. 1396-1400 [doi]
• Transmission of non-linear binary input functions over a CDMA systemElaheh Mohammadi, Amin Gohari, Hassan Aghaeinia. 1401-1405 [doi]
• New near-optimal codebooks associated with binary Sidelnikov sequencesNam Yul Yu. 1406-1410 [doi]
• New nonbinary sequence families with low correlation and large linear spanChunlei Li, Tor Helleseth. 1411-1415 [doi]
• New constructions of asymptotically optimal optical orthogonal codes with λ = 1Jin-Ho Chung, Kyeongcheol Yang. 1416-1420 [doi]
• New polyphase sequence sets with all-zero cross-correlationAndrzej K. Brodzik. 1421-1424 [doi]
• New achievable rates for nonlinear Volterra channels via martingale inequalitiesKostis Xenoulis, Nicholas Kalouptsidis, Igal Sason. 1425-1429 [doi]
• On the complete monotonicity of symbol error ratesAdithya Rajan, Cihan Tepedelenlioglu. 1430-1434 [doi]
• A serial concatenation of coding and trellis shaping for OFDM systems with peak power reductionRyota Yoshizawa, Hideki Ochiai. 1435-1439 [doi]
• Achievable gains in peak power reduction via single-carrier distribution shapingStella Achtenberg, Dan Raphaeli. 1440-1444 [doi]
• An affine invariant k-nearest neighbor regression estimateGérard Biau, Adam Krzyzak, Luc Devroye, Vida Dujmovic. 1445-1447 [doi]
• On linear coherent estimation with spatial collaborationSwarnendu Kar, Pramod K. Varshney. 1448-1452 [doi]
• Modeling spatially-dependent extreme events with Markov random field priorsHang Yu, Zheng Choo, Justin Dauwels, Philip Jonathan, Qiao Zhou. 1453-1457 [doi]
• Signal detection algorithms for two-dimensional intersymbol-interference channelsYiming Chen, Shayan Garani Srinivasa. 1458-1462 [doi]
• Sparse signal recovery in Hilbert spacesGraeme Pope, Helmut Bölcskei. 1463-1467 [doi]
• On sampling a high-dimensional bandlimited field on a union of shifted latticesJayakrishnan Unnikrishnan, Martin Vetterli. 1468-1472 [doi]
• Recovery of sparse 1-D signals from the magnitudes of their Fourier transformKishore Jaganathan, Samet Oymak, Babak Hassibi. 1473-1477 [doi]
• Generalized faster-than-Nyquist signalingJing Zhou, Daoben Li, Xuesong Wang. 1478-1482 [doi]
• Explicit construction of universal strongly secure network coding via MRD codesJun Kurihara, Tomohiko Uyematsu, Ryutaroh Matsumoto. 1483-1487 [doi]
• List-decoding of subspace codes and rank-metric codes up to Singleton boundHessam Mahdavifar, Alexander Vardy. 1488-1492 [doi]
• A matroidal framework for network-error correcting codesKrishnan Prasad, B. Sundar Rajan. 1493-1497 [doi]
• Matroidal undirected networkChung Chan. 1498-1502 [doi]
• The DoF of the K-user interference channel with a cognitive relayAnas Chaaban, Aydin Sezgin. 1503-1507 [doi]
• Lattice coding and the generalized degrees of freedom of the interference channel with relayAnas Chaaban, Aydin Sezgin. 1508-1512 [doi]
• Guiding blind transmitters: Relay-aided interference alignment for the X channelYe Tian, Aylin Yener. 1513-1517 [doi]
• Broadcast approaches to dual-hop parallel relay networksMahdi Zamani, Amir K. Khandani. 1518-1522 [doi]
• On the information content of scattered wavesMassimo Franceschetti. 1523-1527 [doi]
• Degrees of freedom of sparsely connected wireless networksSang-Woon Jeon, Naveen Goela, Michael Gastpar. 1528-1532 [doi]
• Hierarchical beamforming for large one-dimensional wireless networksAlla Merzakreeva, Olivier Lévêque, Ayfer Özgür. 1533-1537 [doi]
• Degrees of freedom (DoF) of locally connected interference channels with cooperating multiple-antenna transmittersAly El Gamal, V. Sreekanth Annapureddy, Venugopal V. Veeravalli. 1538-1542 [doi]
• On linear transforms in zero-delay Gaussian source channel codingEmrah Akyol, Kenneth Rose. 1543-1547 [doi]
• Achieving Csiszár's source-channel coding exponent with product distributionsAdrià Tauste Campo, Gonzalo Vazquez-Vilar, Albert Guillen i Fabregas, Tobias Koch, Alfonso Martinez. 1548-1552 [doi]
• Lossy joint source-channel coding in the finite blocklength regimeVictoria Kostina, Sergio Verdú. 1553-1557 [doi]
• Update efficient codes for error correctionArya Mazumdar, Gregory W. Wornell, Venkat Chandar. 1558-1562 [doi]
• On some properties of a check digit systemYanling Chen, Markku Niemenmaa, A. J. Han Vinck, Danilo Gligoroski. 1563-1567 [doi]
• Computing extensions of linear codes using a greedy algorithmMarkus Grassl, Sunghyu Han. 1568-1572 [doi]
• An algebraic framework for concatenated linear block codes in side information based problemsFelipe Cinelli Barbosa, Jörg Kliewer, Max H. M. Costa. 1573-1577 [doi]
• Rate allocation for component codes of Plotkin-type UEP codesJin Soo Park, Ki-Hyeon Park, Hong-Yeop Song. 1578-1582 [doi]
• Synchrony amplificationUeli Maurer, Björn Tackmann. 1583-1587 [doi]
• Perfectly secure encryption of individual sequencesNeri Merhav. 1588-1592 [doi]
• Design of error-free perfect secrecy system by prefix codes and partition codesChinthani Uduwerelle, Siu-Wai Ho, Terence Chan. 1593-1597 [doi]
• A fast-CSMA based distributed scheduling algorithm under SINR modelSubhash Lakshminarayana, Bin Li, Mohamad Assaad, Atilla Eryilmaz, Mérouane Debbah. 1598-1602 [doi]
• Upper bound for the capacity of multiple access protocols on multipacket reception channelsDouglas S. Chan, Toby Berger. 1603-1607 [doi]
• Effect of channel estimation errors on the stability of channel-aware random accessJeongho Jeon, Anthony Ephremides. 1608-1612 [doi]
• Random access compressed sensing over fading and noisy communication channelsFatemeh Fazel, Maryam Fazel, Milica Stojanovic. 1613-1617 [doi]
• Partial Kelly portfolios and shrinkage estimatorsJustin K. Rising, Abraham J. Wyner. 1618-1622 [doi]
• Constant Markov Portfolio and its application to universal portfolio with side informationMariko Tsurusaki, Jun-ichi Takeuchi. 1623-1627 [doi]
• Estimating multiple concurrent processesJayadev Acharya, Hirakendu Das, Ashkan Jafarpour, Alon Orlitsky, Shengjun Pan. 1628-1632 [doi]
• The minimax risk of truncated series estimators for symmetric convex polytopesAdel Javanmard, Li Zhang. 1633-1637 [doi]
• Optimal phase transitions in compressed sensing with noisy measurementsYihong Wu, Sergio Verdú. 1638-1642 [doi]
• Universality in polytope phase transitions and iterative algorithmsMohsen Bayati, Marc Lelarge, Andrea Montanari. 1643-1647 [doi]
• Number of compressed measurements needed for noisy distributed compressed sensingSangjun Park 0002, Heung-No Lee. 1648-1651 [doi]
• Central approximation in statistical physics and information theoryRyuhei Mori, Toshiyuki Tanaka. 1652-1656 [doi]
• An information-theoretic meta-theorem on edge-cut boundsSudeep Kamath, Pramod Viswanath. 1657-1661 [doi]
• Symmetrical multilevel diversity coding with an all-access encoderJinjing Jiang, Neeharika Marukala, Tie Liu. 1662-1666 [doi]
• On network coding capacity under on-off schedulingMayank Bakshi, Michelle Effros. 1667-1671 [doi]
• Non-coherent network coding: An arbitrarily varying channel approachMahdi Jafari Siavoshani, Shenghao Yang, Raymond W. Yeung. 1672-1676 [doi]
• Short message noisy network coding for multiple sourcesJie Hou, Gerhard Kramer. 1677-1681 [doi]
• Wyner-Ziv type versus noisy network coding for a state-dependent MACAbdellatif Zaidi, Pablo Piantanida, Shlomo Shamai (Shitz). 1682-1686 [doi]
• MAC with action-dependent state information at one encoderLior Dikstein, Haim H. Permuter, Shlomo Shamai (Shitz). 1687-1691 [doi]
• Capacity region of the finite state MAC with cooperative encoders and delayed CSIZiv Goldfeld, Haim H. Permuter, Benjamin M. Zaidel. 1692-1696 [doi]
• Multiple access channel with various degrees of asymmetric state informationNevroz Sen, Fady Alajaji, Serdar Yüksel, Giacomo Como. 1697-1701 [doi]
• Achievable rate regions for the dirty multiple access channel with partial side information at the transmittersElham Bahmani, Ghosheh Abed Hodtani. 1702-1706 [doi]
• On asymptotic capacity of coordinated multi-point MIMO channels with spatial correlation and LOSJun Zhang, Chao-Kai Wen, Shi Jin, Xiqi Gao, Kai-Kit Wong. 1707-1711 [doi]
• Approaching capacity of large MIMO systems by non-binary LDPC codes and MMSE detectionPuripong Suthisopapan, Kenta Kasai, Virasit Imtawil, Anupap Meesomboon. 1712-1716 [doi]
• Unitary isotropically distributed inputs are not capacity-achieving for large-MIMO fading channelsWei Yang, Giuseppe Durisi, Erwin Riegler. 1717-1721 [doi]
• Maximum throughput and expected-rate in multiple transmit antenna systemsMahdi Zamani, Amir K. Khandani. 1722-1726 [doi]
• Max-product algorithm for low density lattice codesYair Yona, Meir Feder. 1727-1731 [doi]
• Non-random coding error exponent for latticesYuval Domb, Meir Feder. 1732-1736 [doi]
• Iterative encoding with Gauss-Seidel method for spatially-coupled low-density lattice codesHironori Uchikawa, Brian M. Kurkoski, Kenta Kasai, Kohichi Sakaniwa. 1737-1741 [doi]
• Optimality of linear codes over PAM for the modulo-additive Gaussian channelAyal Hitron, Uri Erez. 1742-1746 [doi]
• Secrecy gain of Gaussian wiretap codes from 2- and 3-modular latticesFuchun Lin, Frédérique E. Oggier. 1747-1751 [doi]
• Repairable Fountain codesMegasthenis Asteris, Alexandros G. Dimakis. 1752-1756 [doi]
• Ripple design of LT codes for AWGN channelJesper H. Sørensen, Toshiaki Koike-Akino, Philip V. Orlik, Jan Østergaard, Petar Popovski. 1757-1761 [doi]
• Finite length LT codes over Fq for unequal error protection with biased sampling of input nodesBirgit Schotsch, Radu Lupoaie. 1762-1766 [doi]
• Rateless feedback codesJesper H. Sørensen, Toshiaki Koike-Akino, Philip V. Orlik. 1767-1771 [doi]
• Universal rateless coding with finite message setNavot Blits, Meir Feder. 1772-1776 [doi]
• One-way rate-limited sequential key-distillationRemi A. Chou, Matthieu R. Bloch. 1777-1781 [doi]
• Agreement of a restricted secret keyChung Chan. 1782-1786 [doi]
• Fault-tolerant secret key generationHimanshu Tyagi, Navin Kashyap, Yogesh Sankarasubramaniam, Kapali Viswanathan. 1787-1791 [doi]
• Authentication based on secret-key generationFrans M. J. Willems, Tanya Ignatenko. 1792-1796 [doi]
• Connectivity results for sensor networks under a random pairwise key predistribution schemeOsman Yagan, Armand M. Makowski. 1797-1801 [doi]
• Optimal active sensing in heterogeneous cognitive radio networksThang Van Nguyen, Hyundong Shin, Tony Q. S. Quek, Moe Z. Win. 1802-1806 [doi]
• Effect of secondary nodes on the primary's stable throughput in a cognitive wireless networkAnthony Fanous, Anthony Ephremides. 1807-1811 [doi]
• The capacity of the semi-deterministic cognitive interference channel with a common cognitive message and approximate capacity for the Gaussian caseStefano Rini, Carolin Huppert. 1812-1816 [doi]
• The capacity of a three-user interference channel with a cognitive transmitter in strong interferenceMyung Gil Kang, Wan Choi. 1817-1821 [doi]
• Gaussian cognitive interference channels with stateRuchen Duan, Yingbin Liang. 1822-1826 [doi]
• Compressive binary searchMark A. Davenport, Ery Arias-Castro. 1827-1831 [doi]
• Adaptive group testing as channel coding with feedbackMatthew Aldridge. 1832-1836 [doi]
• Non-adaptive group testing: Explicit bounds and novel algorithmsChun Lam Chan, Sidharth Jaggi, Venkatesh Saligrama, Samar Agnihotri. 1837-1841 [doi]
• Adaptive sensing using deterministic partial Hadamard matricesSaeid Haghighatshoar, Emmanuel Abbe, Emre Telatar. 1842-1846 [doi]
• Semi-quantitative group testingAmin Emad, Olgica Milenkovic. 1847-1851 [doi]
• Beyond worst-case reconstruction in deterministic compressed sensingSina Jafarpour, Marco F. Duarte, A. Robert Calderbank. 1852-1856 [doi]
• Minimum complexity pursuit: Stability analysisShirin Jalali, Arian Maleki, Richard G. Baraniuk. 1857-1861 [doi]
• 1-bit Hamming compressed sensingTianyi Zhou, Dacheng Tao. 1862-1866 [doi]
• Binary graphs and message passing strategies for Compressed Sensing in the noiseless settingFrancisco Ramirez-Javega, Meritxell Lamarca, Javier Villares. 1867-1871 [doi]
• Analysis and design of irregular graphs for node-based verification-based recovery algorithms in compressed sensingYaser Eftekhari, Amir H. Banihashemi, Ioannis Lambadaris. 1872-1876 [doi]
• On X-channels with feedback and delayed CSIRavi Tandon, Soheil Mohajer, H. Vincent Poor, Shlomo Shamai. 1877-1881 [doi]
• Binary fading interference channel with delayed feedbackAlireza Vahid, Mohammad Ali Maddah-Ali, Amir Salman Avestimehr. 1882-1886 [doi]
• Interference alignment for achieving both full DoF and full diversity in the broadcast channel with delayed CSITJinyuan Chen, Raymond Knopp, Petros Elia. 1887-1891 [doi]
• On the degrees of freedom of MIMO X channel with delayed CSITAkbar Ghasemi, Mohammad Javad Abdoli, Amir K. Khandani. 1892-1896 [doi]
• Space information flow: Multiple unicastZongpeng Li, Chuan Wu. 1897-1901 [doi]
• A transform approach to linear network coding for acyclic networks with delayTeja Damodaram Bavirisetti, Abhinav Ganesan, Krishnan Prasad, B. Sundar Rajan. 1902-1906 [doi]
• On the feasibility of precoding-based network alignment for three unicast sessionsChun Meng, Abinesh Ramakrishnan, Athina Markopoulou, Syed Ali Jafar. 1907-1911 [doi]
• Network coding for two-unicast with rate (1, 2)Wentu Song, Rongquan Feng, Kai Cai, Junshan Zhang. 1912-1916 [doi]
• Random access in wireless X network: A deterministic viewSeyyed Hasan Mahboubi, Ehsan Ebrahimzadeh, Amir K. Khandani. 1917-1921 [doi]
• A deterministic approach to random access interference channelJavad Behrouzi Moghaddam, Akbar Ghasemi, Amir K. Khandani. 1922-1926 [doi]
• Carry-free models and beyondSe-Yong Park, Gireeja Ranade, Anant Sahai. 1927-1931 [doi]
• Expansion coding: Achieving the capacity of an AEN channelOnur Ozan Koyluoglu, Kumar Appaiah, Hongbo Si, Sriram Vishwanath. 1932-1936 [doi]
• Joint source-channel coding for the multiple-access relay channelYonathan Murin, Ron Dabora, Deniz Gündüz. 1937-1941 [doi]
• On source transmission over some classes of relay channelsSadaf Salehkalaibar, Mohammad Reza Aref. 1942-1946 [doi]
• Lossy source-channel communication over a phase-incoherent interference relay channelHamidreza Ebrahimzadeh Saffar, Masoud Badiei Khuzani, Patrick Mitran. 1947-1951 [doi]
• Joint source-channel coding for cribbing modelsEliron Amir, Yossef Steinberg. 1952-1956 [doi]
• Universal bounds on the scaling behavior of polar codesAli Goli, Seyed Hamed Hassani, Rüdiger L. Urbanke. 1957-1961 [doi]
• Polar codes: Robustness of the successive cancellation decoder with respect to quantizationSeyed Hamed Hassani, Rüdiger L. Urbanke. 1962-1966 [doi]
• Code based efficient maximum-likelihood decoding of short polar codesSinan Kahraman, Mehmet Ertugrul Çelebi. 1967-1971 [doi]
• Polar write once memory codesDavid Burshtein, Alona Strugatski. 1972-1976 [doi]
• Authentication over noisy data with the use of memory containing metric functionsVladimir B. Balakirsky, A. J. Han Vinck. 1977-1981 [doi]
• Efficient code-based one-time signature from automorphism groups with syndrome compatibilityPhilippe Gaborit, Julien Schrek. 1982-1986 [doi]
• Efficient signature scheme for network codingEly Porat, Erez Waisbard. 1987-1991 [doi]
• BPRS: Belief Propagation based iterative recommender systemErman Ayday, Arash Einolghozati, Faramarz Fekri. 1992-1996 [doi]
• Convergence of generalized linear coordinate-descent message-passing for quadratic optimizationGuoqiang Zhang, Richard Heusdens. 1997-2001 [doi]
• Relaxed Gaussian Belief PropagationYousef El-Kurdi, Dennis Giannacopoulos, Warren J. Gross. 2002-2006 [doi]
• Message-passing sequential detection of multiple change points in networksXuanLong Nguyen, Arash A. Amini, Ram Rajagopal. 2007-2011 [doi]
• The Bethe approximation of the pattern maximum likelihood distributionPascal O. Vontobel. 2012-2016 [doi]
• Alternating Markov chains for distribution estimation in the presence of errorsFarzad Farnoud, Narayana P. Santhanam, Olgica Milenkovic. 2017-2021 [doi]
• On simple one-class classification methodsZineb Noumir, Paul Honeine, Cedue Richard. 2022-2026 [doi]
• On optimal two sample homogeneity tests for finite alphabetsJayakrishnan Unnikrishnan. 2027-2031 [doi]
• Recovery threshold for optimal weight ℓ1 minimizationSamet Oymak, M. Amin Khajehnejad, Babak Hassibi. 2032-2036 [doi]
• The ℓ1 analysis approach by sparse dual frames for sparse signal recovery represented by framesTiebin Mi, Shidong Li, Yulong Liu. 2037-2041 [doi]
• Performance analysis of ℓ1-synthesis with coherent framesYulong Liu, Shidong Li, Tiebin Mi, Hong Lei, Weidong Yu. 2042-2046 [doi]
• Sparse signal separation in redundant dictionariesCéline Aubel, Christoph Studer, Graeme Pope, Helmut Bölcskei. 2047-2051 [doi]
• Analog network coding in general SNR regimeSamar Agnihotri, Sidharth Jaggi, Minghua Chen. 2052-2056 [doi]
• Network coding for the broadcast Rayleigh fading channel with feedbackXiaohang Song, Onurcan Iscan. 2057-2061 [doi]
• Linear network coding capacity region of 2-receiver MIMO broadcast packet erasure channels with feedbackChih-Chun Wang, David J. Love. 2062-2066 [doi]
• Wireless network coding for MIMO two-way relaying using Latin RectanglesVijayvaradharaj T. Muralidharan, B. Sundar Rajan. 2067-2071 [doi]
• The approximate sum capacity of the symmetric Gaussian K-user interference channelOr Ordentlich, Uri Erez, Bobak Nazer. 2072-2076 [doi]
• Interference alignment: From degrees-of-freedom to constant-gap capacity approximationsUrs Niesen, Mohammad Ali Maddah-Ali. 2077-2081 [doi]
• Degrees of freedom of MIMO X networks: Spatial scale invariance, one-sided decomposability and linear feasibilityHua Sun, Chunhua Geng, Tiangao Gou, Syed Ali Jafar. 2082-2086 [doi]
• Signal space alignment for the Gaussian Y-channelAnas Chaaban, Aydin Sezgin. 2087-2091 [doi]
• On the capacity of multi-user two-way linear deterministic channelsZhiyu Cheng, Natasha Devroye. 2092-2096 [doi]
• Sum capacity of 3-user deterministic interference channels with connectivity constraintsSuvarup Saha, Randall A. Berry. 2097-2101 [doi]
• On the sum-capacity of the linear deterministic interference channel with partial feedbackSy-Quoc Le, Ravi Tandon, Mehul Motani, H. Vincent Poor. 2102-2106 [doi]
• The sum-capacity of the linear deterministic three-user cognitive interference channelDiana Maamari, Daniela Tuninetti, Natasha Devroye. 2107-2111 [doi]
• The adversarial joint source-channel problemYuval Kochman, Arya Mazumdar, Yury Polyanskiy. 2112-2116 [doi]
• A strong converse for joint source-channel codingDa Wang, Amir Ingber, Yuval Kochman. 2117-2121 [doi]
• Joint source-channel coding of one random variable over the Poisson channelAlbert No, Kartik Venkat, Tsachy Weissman. 2122-2126 [doi]
• Curves on torus layers and coding for continuous alphabet sourcesAntonio Campello, Cristiano Torezzan, Sueli I. R. Costa. 2127-2131 [doi]
• Constructing polar codes for non-binary alphabets and MACsIdo Tal, Artyom Sharov, Alexander Vardy. 2132-2136 [doi]
• Polar codes for discrete alphabetsEren Sasoglu. 2137-2141 [doi]
• rWoomyoung Park, Alexander Barg. 2142-2146 [doi]
• Polar coding without alphabet extension for asymmetric channelsJunya Honda, Hirosuke Yamamoto. 2147-2151 [doi]
• Cryptanalysis of a homomorphic encryption scheme from ISIT 2008Jingguo Bi, Mingjie Liu, Xiaoyun Wang. 2152-2156 [doi]
• Finding short vectors in a lattice of Voronoi's first kindRobby G. McKilliam, Alex J. Grant. 2157-2160 [doi]
• Oblivious distributed guessingSerdar Boztas. 2161-2165 [doi]
• Error exponents for Rayleigh fading product MIMO channelsJiang Xue, Md. Zahurul I. Sarkar, Tharmalingam Ratnarajah, Caijun Zhong. 2166-2170 [doi]
• Ergodic sum capacity of macrodiversity MIMO systems in flat Rayleigh fadingDushyantha A. Basnayaka, Peter J. Smith, Philippa A. Martin. 2171-2175 [doi]
• Characterization of the constrained capacity of multiple-antenna fading coherent channels driven by arbitrary inputsMiguel R. D. Rodrigues. 2176-2180 [doi]
• A random matrix approach to the finite blocklength regime of MIMO fading channelsJakob Hoydis, Romain Couillet, Pablo Piantanida, Mérouane Debbah. 2181-2185 [doi]
• Worst-case expected-rate loss of slow-fading channelsJae Won Yoo, Tie Liu, Shlomo Shamai (Shitz). 2186-2190 [doi]
• Extrinsic Jensen-Shannon divergence with application in active hypothesis testingMohammad Naghshvar, Tara Javidi. 2191-2195 [doi]
• Controlled sensing for sequential multihypothesis testingGeorge Atia, Venugopal V. Veeravalli. 2196-2200 [doi]
• Active sequential hypothesis testing with application to a visual search problemNidhin K. Vaidhiyan, S. P. Arun, Rajesh Sundaresan. 2201-2205 [doi]
• Hypothesis testing via a comparatorYury Polyanskiy. 2206-2210 [doi]
• The sensitivity of compressed sensing performance to relaxation of sparsityDavid Donoho, Galen Reeves. 2211-2215 [doi]
• Combinatorial selection and least absolute shrinkage via the Clash algorithmAnastasios T. Kyrillidis, Volkan Cevher. 2216-2220 [doi]
• ℓp-constrained least squares (0 < p < 1) and its critical pathMasahiro Yukawa, Shun-ichi Amari. 2221-2225 [doi]
• WarmL1: A warm-start homotopy-based reconstruction algorithm for sparse signalsTien-Ju Yang, Yi-Min Tsai, Chung-Te Li, Liang-Gee Chen. 2226-2230 [doi]
• On linear index coding for random graphsIshay Haviv, Michael Langberg. 2231-2235 [doi]
• Index coding: An interference alignment perspectiveHamed Maleki, Viveck R. Cadambe, Syed Ali Jafar. 2236-2240 [doi]
• Optimal index codes with near-extreme ratesSon Hoang Dau, Vitaly Skachek, Yeow Meng Chee. 2241-2245 [doi]
• Bipartite index codingArash Saber Tehrani, Alexandros G. Dimakis, Michael J. Neely. 2246-2250 [doi]
• Pliable index codingSiddhartha Brahma, Christina Fragouli. 2251-2255 [doi]
• A new achievable rate region for the 3-user discrete memoryless interference channelArun Padakandla, Aria Ghasemian Sahebi, S. Sandeep Pradhan. 2256-2260 [doi]
• An information-spectrum approach to the capacity region of general interference channelLei Lin, Xiao Ma, Xiujie Huang, Baoming Bai. 2261-2265 [doi]
• On a class of discrete memoryless broadcast interference channelsYuanpeng Liu, Elza Erkip. 2266-2270 [doi]
• On the sum capacity of the discrete memoryless interference channel with one-sided weak interference and mixed interferenceFangfang Zhu, Biao Chen. 2271-2275 [doi]
• An achievable rate region for three-pair interference channels with noiseBernd Bandemer. 2276-2280 [doi]
• Hermitian precoding for distributed MIMO systemsJianwen Zhang, Xiaojun Yuan, Li Ping. 2281-2285 [doi]
• On the net DoF comparison between ZF and MAT over time-varying MISO broadcast channelsMari Kobayashi, Giuseppe Caire. 2286-2290 [doi]
• Proximity factors of lattice reduction-aided precoding for multiantenna broadcastShuiyin Liu, Cong Ling, Xiaofu Wu. 2291-2295 [doi]
• High-SNR analysis of MIMO linear precodersAhmed Hesham Mehana, Aria Nosratinia. 2296-2300 [doi]
• A transmit-power efficient MIMO-THP designChristos Masouros, Mathini Sellathurai, Tharmalingam Ratnarajah. 2301-2305 [doi]
• Lattice codes achieving strong secrecy over the mod-Λ Gaussian ChannelCong Ling, Laura Luzzi, Jean-Claude Belfiore. 2306-2310 [doi]
• Key agreement over Gaussian wiretap models with known interference at the transmitterAli Zibaeenejad. 2311-2315 [doi]
• The Gaussian interference wiretap channel when the eavesdropper channel is arbitrarily varyingXiang He, Aylin Yener. 2316-2320 [doi]
• Optimal power allocation for GSVD-based beamforming in the MIMO Gaussian wiretap channelS. Ali. A. Fakoorian, A. Lee Swindlehurst. 2321-2325 [doi]
• Switched power allocation for MISOME wiretap channelsThang Van Nguyen, Tony Q. S. Quek, Hyundong Shin. 2326-2330 [doi]
• Beyond the Bethe free energy of LDPC codes via polymer expansionsNicolas Macris, Marc Vuffray. 2331-2335 [doi]
• On Generalized EXIT charts of LDPC code ensembles over binary-input output-symmetric memoryless channelsHosein Mamani, Hamid Saeedi, Ali Eslami, Hossein Pishro-Nik. 2336-2340 [doi]
• Analysis of error floors of generalized non-binary LDPC codes over q-ary memoryless symmetric channelsTakayuki Nozaki, Kenta Kasai, Kohichi Sakaniwa. 2341-2345 [doi]
• Finite-length analysis of the TEP decoder for LDPC ensembles over the BECPablo M. Olmos, Fernando Pérez-Cruz, Luis Salamanca, Juan José Murillo-Fuentes. 2346-2350 [doi]
• Properties and encoding aspects of direct product convolutional codesVladimir Sidorenko, Martin Bossert, Francesca Vatta. 2351-2355 [doi]
• Efficient decoding of Partial Unit Memory codes of arbitrary rateAntonia Wachter-Zeh, Markus Stinner, Martin Bossert. 2356-2360 [doi]
• SISO MAP decoding of rate-1 recursive convolutional codes: A revisitYonghui Li, Md. Shahriar Rahman, Branka Vucetic. 2361-2365 [doi]
• Best rate 1/2 convolutional codes for turbo equalization with severe ISIJohn B. Anderson, Mehdi Zeinali. 2366-2370 [doi]
• Low complexity syndrome based decoding of Turbo codesJan Geldmacher, Klaus Hueske, Jürgen Götze, Martin Kosakowski. 2371-2375 [doi]
• Message-passing algorithms for channel estimation and decoding using approximate inferenceMihai-Alin Badiu, Gunvor Elisabeth Kirkelund, Carles Navarro i Manchon, Erwin Riegler, Bernard H. Fleury. 2376-2380 [doi]
• Bidirectional channel estimation using adaptive pilotsFei Teng, Dongning Guo, Michael L. Honig. 2381-2385 [doi]
• Delay-Doppler channel estimation with almost linear complexity: To Solomon Golomb for the occasion of his 80 birthday mazel tovAlexander Fish, Akbar M. Sayeed, Shamgar Gurevich, Ronny Hadani, Oded Schwartz. 2386-2390 [doi]
• Efficient algorithms for calculating Euclidean distance spectra of muliti-user continuous phase modulation systemsLi-Bing, Tor Aulin, Baoming Bai. 2391-2395 [doi]
• Joint synchronization and demodulation by forward filteringMurthy V. Devarakonda, Hans-Andrea Loeliger. 2396-2400 [doi]
• On the equivalence of TCM encodersAlex Alvarado, Alexandre Graell i Amat, Fredrik Brännström, Erik Agrell. 2401-2405 [doi]
• Performance estimation of bit-interleaved coded modulation based on information processing characteristicsAndreas Schenk, Robert F. H. Fischer, Johannes B. Huber. 2406-2410 [doi]
• Cooperative diversity via set-partitioning in BICM: Outage analysis and frame interleavingLai Wei, Thomas E. Fuja. 2411-2415 [doi]
• Mismatched shaping schemes for bit-interleaved coded modulationLi Peng, Albert Guillen i Fabregas, Alfonso Martinez. 2416-2420 [doi]
• Achieving the Shannon limit with probabilistically shaped BICMErik Agrell, Alex Alvarado. 2421-2425 [doi]
• Systematic DFT frames: Principle and eigenvalues structureMojtaba Vaezi, Fabrice Labeau. 2426-2430 [doi]
• Subsampling at information theoretically optimal ratesAdel Javanmard, Andrea Montanari. 2431-2435 [doi]
• New construction of a near-optimal partial Fourier codebook using the structure of binary m-sequencesNam Yul Yu. 2436-2440 [doi]
• Behavior of the minimum singular value of a random Vandermonde matrixGabriel H. Tucci, Philip A. Whiting. 2441-2445 [doi]
• Applications of the Shannon-Hartley theorem to data streams and sparse recoveryEric Price, David P. Woodruff. 2446-2450 [doi]
• Expander graph based overlapped chunked codesBin Tang, Shenghao Yang, Yitong Yin, Baoliu Ye, Sanglu Lu. 2451-2455 [doi]
• On densifying coding opportunities in instantly decodable network coding graphsSameh Sorour, Shahrokh Valaee. 2456-2460 [doi]
• How fast can dense codes achieve the min-cut capacity of line networks?Anoosheh Heidarzadeh, Amir H. Banihashemi. 2461-2465 [doi]
• On decoding delay of intra-session random linear network coding for line networksVahid Shah-Mansouri, Vincent W. S. Wong. 2466-2470 [doi]
• Subspace alignment chains and the degrees of freedom of the three-user MIMO interference channelChenwei Wang, Tiangao Gou, Syed Ali Jafar. 2471-2475 [doi]
• Genie chains and the degrees of freedom of the K-user MIMO interference channelChenwei Wang, Hua Sun, Syed Ali Jafar. 2476-2480 [doi]
• A general test to check the feasibility of linear interference alignmentOscar Gonzalez, Ignacio Santamaría, Carlos Beltrán. 2481-2485 [doi]
• The feasibility conditions of interference alignment for MIMO interference networksLiangzhong Ruan, Vincent K. N. Lau, Moe Z. Win. 2486-2490 [doi]
• Grassmannian-Euclidean superposition for MIMO broadcast channelsYang Li, Aria Nosratinia. 2491-2495 [doi]
• Throughput penalty of fair scheduling algorithms on multiple antenna broadcast channelsJuyul Lee. 2496-2500 [doi]
• On the degrees of freedom of time correlated MISO broadcast channel with delayed CSITMari Kobayashi, Sheng Yang, David Gesbert, Xinping Yi. 2501-2505 [doi]
• An extremal inequality and the capacity region of the degraded MIMO compound Gaussian broadcast channel with multiple usersHon-Fah Chong, Ying-Chang Liang. 2506-2510 [doi]
• The supermarket gameJiaming Xu, Bruce Hajek. 2511-2515 [doi]
• A game theoretic model for the Gaussian broadcast channelSrinivas Yerramalli, Rahul Jain, Urbashi Mitra. 2516-2520 [doi]
• Incentives for cooperative relaying in a simple information-theoretic modelDileep M. Kalathil, Rahul Jain. 2521-2525 [doi]
• Graph cover ensembles of non-binary protograph LDPC codesDariush Divsalar, Lara Dolecek. 2526-2530 [doi]
• Analysis and design of ultra-sparse non-binary cluster-LDPC codesDavid Declercq, Valentin Savin, Lam Pham Sy. 2531-2535 [doi]
• A new ensemble of rate-compatible LDPC codesKai Zhang, Xiao Ma, Shancheng Zhao, Baoming Bai, Xiaoyi Zhang. 2536-2540 [doi]
• Fourier domain representation of non-binary LDPC codesValentin Savin. 2541-2545 [doi]
• Secure network coding and non-malleable codes: Protection against linear tamperingHervé Chabanne, Gérard D. Cohen, Alain Patey. 2546-2550 [doi]
• On a class of three-weight codes with cryptographic applicationsZihui Liu, Xin-Wen Wu. 2551-2555 [doi]
• Private Stream Search at the same communication cost as a regular search: Role of LDPC codesMatthieu Finiasz, Kannan Ramchandran. 2556-2560 [doi]
• Mutual information for a deletion channelMichael Drmota, Wojciech Szpankowski, Krishnamurthy Viswanathan. 2561-2565 [doi]
• Recognition capacity versus search speed in noisy databasesErtem Tuncel. 2566-2570 [doi]
• On fingerprinting capacity games for arbitrary alphabets and their asymptoticsYen-Wei Huang, Pierre Moulin. 2571-2575 [doi]
• Universal communication over unknown vector channelsYuval Lomnitz, Meir Feder. 2576-2580 [doi]
• The porosity of additive noise sequencesVinith Misra, Tsachy Weissman. 2581-2585 [doi]
• Classification with high-dimensional sparse samplesDayu Huang, Sean P. Meyn. 2586-2590 [doi]
• Large scale correlation detectionFrancesca Bassi, Alfred O. Hero III. 2591-2595 [doi]
• An innovative approach for analysing rank deficient covariance matricesGabriel H. Tucci, Ke Wang. 2596-2600 [doi]
• Corrupted and missing predictors: Minimax bounds for high-dimensional linear regressionPo-Ling Loh, Martin J. Wainwright. 2601-2605 [doi]
• Coded cooperative data exchange problem for general topologiesMira Gonen, Michael Langberg. 2606-2610 [doi]
• Data exchange problem with helpersNebojsa Milosavljevic, Sameer Pawar, Salim Y. El Rouayheb, Michael Gastpar, Kannan Ramchandran. 2611-2615 [doi]
• Network coded gossip with correlated dataBernhard Haeupler, Asaf Cohen, Chen Avin, Muriel Médard. 2616-2620 [doi]
• Wireless networks with symmetric demandsSudeep Kamath, Sreeram Kannan, Pramod Viswanath. 2621-2625 [doi]
• Delay-rate tradeoff in ergodic interference alignmentOliver Johnson, Matthew Aldridge, Robert J. Piechocki. 2626-2630 [doi]
• Opportunistic interference alignment in MIMO femtocell networksNguyen Minh Tri, Tony Q. S. Quek, Hyundong Shin. 2631-2635 [doi]
• Opportunistic interference alignment for MIMO IMAC: Effect of user scaling over degrees-of-freedomHyun Jong Yang, Won-Yong Shin, Bang Chul Jung, Arogyaswami Paulraj. 2636-2640 [doi]
• Relay-aided interference alignment for MIMO cellular networksXuesong Wang, Yongping Zhang, Philipp Zhang, Xiaotao Ren. 2641-2645 [doi]
• Generalized Distributive Law for ML decoding of STBCs: Further resultsLakshmi Prasad Natarajan, B. Sundar Rajan. 2646-2650 [doi]
• The Jacobi MIMO channelRonen Dar, Meir Feder, Mark Shtaif. 2651-2655 [doi]
• Channel modelling of MU-MIMO systems by quaternionic free probabilityRalf R. Müller, Burak Çakmak. 2656-2660 [doi]
• Transmission over arbitrarily permuted parallel Gaussian channelsAyal Hitron, Anatoly Khina, Uri Erez. 2661-2665 [doi]
• Real-time status updating: Multiple sourcesRoy D. Yates, Sanjit Krishnan Kaul. 2666-2670 [doi]
• On emptying a wireless network in minimum timeVangelis Angelakis, Anthony Ephremides, Qing He, Di Yuan. 2671-2675 [doi]
• Mixing time and temporal starvation of general CSMA networks with multiple frequency agilityKa Kit Lam, Chi-Kin Chau, Minghua Chen, Soung Chang Liew. 2676-2680 [doi]
• From Glauber dynamics to Metropolis algorithm: Smaller delay in optimal CSMAChul-Ho Lee, Do Young Eun, SeYoung Yun, Yung Yi. 2681-2685 [doi]
• Linear-programming decoding of Tanner codes with local-optimality certificatesNissim Halabi, Guy Even. 2686-2690 [doi]
• Hierarchies of local-optimality characterizations in decoding Tanner codesNissim Halabi, Guy Even. 2691-2695 [doi]
• Approaching capacity at high rates with iterative hard-decision decodingYung-Yih Jian, Henry D. Pfister, Krishna R. Narayanan. 2696-2700 [doi]
• On the maximum a posteriori decoding thresholds of multiuser systems with erasuresPhong S. Nguyen, Arvind Yedla, Henry D. Pfister, Krishna R. Narayanan. 2701-2705 [doi]
• An analytic upper bound on T-complexityUlrich Speidel, T. Aaron Gulliver. 2706-2710 [doi]
• On the query computation and verification of functionsHirakendu Das, Ashkan Jafarpour, Alon Orlitsky, Shengjun Pan, Ananda Theertha Suresh. 2711-2715 [doi]
• Fundamental limits on the power consumption of encoding and decodingPulkit Grover, Andrea Goldsmith, Anant Sahai. 2716-2720 [doi]
• Tractable Bayesian social learning on treesYashodhan Kanoria, Omer Tamuz. 2721-2725 [doi]
• Learning minimal latent directed information treesJalal Etesami, Negar Kiyavash, Todd P. Coleman. 2726-2730 [doi]
• Learning Markov graphs up to edit distanceAbhik Kumar Das, Praneeth Netrapalli, Sujay Sanghavi, Sriram Vishwanath. 2731-2735 [doi]
• Passive learning of the interference graph of a wireless networkJing Yang 0002, Stark C. Draper, Robert Nowak. 2735-2740 [doi]
• Information theory for DNA sequencing: Part I: A basic modelAbolfazl S. Motahari, Guy Bresler, David Tse. 2741-2745 [doi]
• The information content in sorting algorithmsLudwig M. Busse, Morteza Haghir Chehreghani, Joachim M. Buhmann. 2746-2750 [doi]
• String reconciliation with unknown edit distanceAryeh Kontorovich, Ari Trachtenberg. 2751-2755 [doi]
• Modeling biological circuits with urn functionsDavid Lee, Jehoshua Bruck. 2756-2760 [doi]
• Allocations for heterogenous distributed storageVasileios Ntranos, Giuseppe Caire, Alexandros G. Dimakis. 2761-2765 [doi]
• Codes can reduce queueing delay in data centersLongbo Huang, Sameer Pawar, Hao Zhang, Kannan Ramchandran. 2766-2770 [doi]
• Locally repairable codesDimitris S. Papailiopoulos, Alexandros G. Dimakis. 2771-2775 [doi]
• Optimal linear codes with a local-error-correction propertyN. Prakash, Govinda M. Kamath, V. Lalitha, P. Vijay Kumar. 2776-2780 [doi]
• Wireless device-to-device communications with distributed cachingNegin Golrezaei, Alexandros G. Dimakis, Andreas F. Molisch. 2781-2785 [doi]
• Capacity for MIMO Gaussian interference channels with generally strong and noisy interferenceXiaohu Shang, H. Vincent Poor. 2786-2790 [doi]
• The Han-Kobayashi region for a class of Gaussian interference channels with mixed interferenceYu Zhao, Fangfang Zhu, Biao Chen. 2791-2795 [doi]
• Simple transmission strategies for interference channelJung Hyun Bae, Jungwon Lee, Inyup Kang. 2796-2800 [doi]
• Two-way interference channelsChangho Suh, I-Hsiang Wang, David Tse. 2801-2805 [doi]
• A new outer bound on the capacity region of Gaussian interference channelsJunyoung Nam, Giuseppe Caire. 2806-2810 [doi]
• On the sphere decoding complexity of high rate multigroup ML decodable STBCsLakshmi Prasad Natarajan, K. Pavan Srinath, B. Sundar Rajan. 2811-2815 [doi]
• Feedback-aided complexity reductions in ML and lattice decodingArun Kumar Singh, Petros Elia. 2816-2820 [doi]
• Time-varying space-only codesDieter Duyck, Marc Moeneclaey, Sheng Yang, Fambirai Takawira, Joseph Jean Boutros. 2821-2825 [doi]
• n Tx antennasNadya Markin, Frédérique E. Oggier. 2826-2830 [doi]
• Space-time MIMO multicastingIdan Livni, Anatoly Khina, Ayal Hitron, Uri Erez. 2831-2835 [doi]
• Approximating the timely throughput of heterogeneous wireless networksSina Lashgari, Amir Salman Avestimehr. 2836-2840 [doi]
• Wireless downloading delay under proportional fair scheduling with coupled service and requests: An approximated analysisKarthikeyan Shanmugam, Giuseppe Caire. 2841-2845 [doi]
• Delay-optimal buffered decode-and-forward for two-hop networks with random link connectivityYing Cui, Vincent K. N. Lau, Edmund M. Yeh. 2846-2850 [doi]
• Delay-exponent of delay-universal compress-and-forward relayingKhoa D. Nguyen. 2851-2855 [doi]
• On playback delay in streaming communicationGauri Joshi, Yuval Kochman, Gregory W. Wornell. 2856-2860 [doi]
• Jar decoding: LDPC coding theorems for binary input memoryless channelsEn-Hui Yang, Jin Meng. 2861-2865 [doi]
• A two stage selective averaging LDPC decodingA. Dinesh Kumar, Ambedkar Dukkipati. 2866-2870 [doi]
• Quantized min-sum decoders with low error floor for LDPC codesXiaojie Zhang, Paul H. Siegel. 2871-2875 [doi]
• Enhancing the error correction of finite alphabet iterative decoders via adaptive decimationShiva Kumar Planjery, Bane V. Vasic, David Declercq. 2876-2880 [doi]
• Selecting two-bit bit flipping algorithms for collective error correctionDung Viet Nguyen, Bane V. Vasic, Michael W. Marcellin. 2881-2885 [doi]
• Maximum distance separable symbol-pair codesYeow Meng Chee, Han Mao Kiah, Chengmin Wang. 2886-2890 [doi]
• Decoding of cyclic codes over symbol-pair read channelsEitan Yaakobi, Jehoshua Bruck, Paul H. Siegel. 2891-2895 [doi]
• Describing a cyclic code by another cyclic codeAlexander Zeh, Sergey Bezzateev. 2896-2900 [doi]
• Weight distribution of some cyclic codesSung-Tai Choi, Ji-Youp Kim, Jong-Seon No, Habong Chung. 2901-2903 [doi]
• Self-dual repeated root cyclic and negacyclic codes over finite fieldsKenza Guenda, T. Aaron Gulliver. 2904-2908 [doi]
• Approximate feedback capacity of the Gaussian multicast channelChangho Suh, Naveen Goela, Michael Gastpar. 2909-2913 [doi]
• A sequential transmission scheme for unifilar finite-state channels with feedback based on posterior matchingAchilleas Anastasopoulos. 2914-2918 [doi]
• Optimal selective feedback policies for opportunistic beamforming under peak feedback constraintsTharaka Samarasinghe, Hazer Inaltekin, Jamie S. Evans. 2919-2923 [doi]
• A rate-compatible sphere-packing analysis of feedback coding with limited retransmissionsAdam R. Williamson, Tsung-Yi Chen, Richard D. Wesel. 2924-2928 [doi]
• Completely decoupled space-time block codes with low-rate feedbackWei Liu, Mathini Sellathurai, Jing Lei, Jibo Wei, Chaojing Tang. 2929-2933 [doi]
• On reliability functions for single-message unequal error protectionDa Wang, Venkat Chandar, Sae-Young Chung, Gregory W. Wornell. 2934-2938 [doi]
• Error exponents of optimum erasure/list and ordinary decoding for channels with side informationErez Sabbag, Neri Merhav. 2939-2943 [doi]
• Extremality properties for Gallager's random coding exponentMine Alsan. 2944-2948 [doi]
• Refinement of the sphere-packing boundYücel Altug, Aaron B. Wagner. 2949-2953 [doi]
• On decoding error exponent of Gaussian channel with noisy feedback: Nonexponential number of messagesMarat V. Burnashev, Hirosuke Yamamoto. 2954-2958 [doi]
• Collective sensing-capacity of bacteria populationsArash Einolghozati, Mohsen Sardari, Faramarz Fekri. 2959-2963 [doi]
• A Berger-Levy energy efficient neuron model with unequal synaptic weightsJie Xing, Toby Berger, Terrence J. Sejnowski. 2964-2968 [doi]
• Design principles and specifications for neural-like computation under constraints on information preservation and energy costs as analyzed with statistical theoryWilliam B. Levy, Toby Berger. 2969-2972 [doi]
• The peak constrained additive inverse Gaussian noise channelAndrew W. Eckford, K. V. Srinivas, Raviraj S. Adve. 2973-2977 [doi]
• Systematic error-correcting codes for rank modulationHongchao Zhou, Anxiao Jiang, Jehoshua Bruck. 2978-2982 [doi]
• Snake-in-the-box codes for rank modulationYonatan Yehezkeally, Moshe Schwartz. 2983-2987 [doi]
• Rank modulation for translocation error correctionFarzad Farnoud, Vitaly Skachek, Olgica Milenkovic. 2988-2992 [doi]
• On ML-certificate linear constraints for rank modulation with linear programming decoding and its application to compact graphsManabu Hagiwara. 2993-2997 [doi]
• Linear programming upper bounds on permutation code sizes from coherent configurations related to the Kendall-tau distance metricFabian Lim, Manabu Hagiwara. 2998-3002 [doi]
• Lossy communication over multiple-access channels with feedbackPaolo Minero, Safitha Jayaraj. 3003-3007 [doi]
• The compute-and-forward transformOr Ordentlich, Uri Erez, Bobak Nazer. 3008-3012 [doi]
• On modulo-sum computation over an erasure multiple access channelAshish Khisti, Brett Hern, Krishna R. Narayanan. 3013-3017 [doi]
• Capacity regions of partly asynchronous multiple access channelsLóránt Farkas, Tamás Kói. 3018-3022 [doi]
• Performance of MIMO single-carrier frequency domain zero-forcing equalizerAhmed Hesham Mehana, Aria Nosratinia. 3023-3027 [doi]
• Matrix exponential learning: Distributed optimization in MIMO systemsPanayotis Mertikopoulos, Elena Veronica Belmega, Aris L. Moustakas. 3028-3032 [doi]
• Asymptotic data rates of receive-diversity systems with MMSE estimation and interferers at correlated locationsSiddhartan Govindasamy. 3033-3037 [doi]
• Connecting DMT of division algebra space-time codes and point counting in Lie groupsRoope Vehkalahti, Laura Luzzi. 3038-3042 [doi]
• DMT-optimal, low ML-complexity STBC-schemes for asymmetric MIMO systemsK. Pavan Srinath, B. Sundar Rajan. 3043-3047 [doi]
• Coordination via a relayFarzin Haddadpour, Mohammad Hossein Yassaee, Amin Gohari, Mohammad Reza Aref. 3048-3052 [doi]
• Channel simulation via interactive communicationsMohammad Hossein Yassaee, Amin Gohari, Mohammad Reza Aref. 3053-3057 [doi]
• Action dependent strictly causal state communicationChiranjib Choudhuri, Urbashi Mitra. 3058-3062 [doi]
• Multi-stage coding for channels with a rewrite option and reversible inputKittipong Kittichokechai, Tobias J. Oechtering, Mikael Skoglund. 3063-3067 [doi]
• Amplification of the hidden Gaussian channel statesChao Tian. 3068-3072 [doi]
• Low-density arrays of circulant matrices: Rank and row-redundancy, and QC-LDPC codesQin Huang, Keke Liu, Zulin Wang. 3073-3077 [doi]
• On the girth of quasi cyclic protograph LDPC codesMehdi Karimi, Amir H. Banihashemi. 3078-3082 [doi]
• A greedy search for improved QC LDPC codes with good girth profile and degree distributionIrina E. Bocharova, Florian Hug, Rolf Johannesson, Boris D. Kudryashov. 3083-3087 [doi]
• Trapping set structure of finite geometry LDPC codesQiuju Diao, Ying Yu Tai, Shu Lin, Khaled A. S. Abdel-Ghaffar. 3088-3092 [doi]
• A new parity structure with multi-weight circulants for QC LDPC codesHosung Park, Seokbeom Hong, Jong-Seon No, Dong-Joon Shin. 3093-3097 [doi]
• Lagrange interpolation polynomials and generalized Reed-Solomon codes over rings of matricesLi-Ping Wang. 3098-3100 [doi]
• Extensions of Z2Z4-additive self-dual codes preserving their propertiesMuhammad Bilal, Joaquim Borges, Steven T. Dougherty, Cristina Fernández-Córdoba. 3101-3105 [doi]
• 4Kenza Guenda, T. Aaron Gulliver, S. Arash Sheikholeslam. 3106-3109 [doi]
• Construction of Barnes-Wall lattices from linear codes over ringsJ. Harshan, Emanuele Viterbo, Jean-Claude Belfiore. 3110-3114 [doi]
• On the algebraic representation of selected optimal non-linear binary codesMarcus Greferath, Jens Zumbrägel. 3115-3119 [doi]
• Full-duplex transmitter cooperation, feedback, and the degrees of freedom of SISO Gaussian interference and X channelsMohammad Javad Abdoli, Akbar Ghasemi, Amir K. Khandani. 3120-3124 [doi]
• Generalized degrees of freedom of the symmetric K-user interference channel with feedbackSoheil Mohajer, Ravi Tandon, H. Vincent Poor. 3125-3129 [doi]
• Feedback in the K-user interference channelDimitris S. Papailiopoulos, Changho Suh, Alexandros G. Dimakis. 3130-3134 [doi]
• The generalized multiplexing gain region of the slow fading MIMO interference channel and its achievability with limited feedbackSanjay Karmakar, Mahesh K. Varanasi. 3135-3139 [doi]
• On the ARQ protocols over the Z-interference channels: Diversity-multiplexing-delay tradeoffMohamed S. Nafea, Doha Hamza, Karim G. Seddik, Mohammed Nafie, Hesham El Gamal. 3140-3144 [doi]