Table of Contents

• WelcomeAnders Høst-Madsen, Aleksandar Kavcic, Venugopal V. Veeravalli. 1 [doi]
• Compression for similarity identification: Fundamental limitsAmir Ingber, Tsachy Weissman. 1-5 [doi]
• Bounds for permutation rate-distortionFarzad Farnoud, Moshe Schwartz, Jehoshua Bruck. 6-10 [doi]
• Lossy compression of permutationsDa Wang, Arya Mazumdar, Gregory W. Wornell. 11-15 [doi]
• Streaming with autoregressive-hamming distortion for ultra short-delay communicationsRoy Timoy, Alex Grantz, Badri N. Vellambiz. 16-20 [doi]
• General formula for secrecy capacity of wiretap channel with noncausal stateJun Muramatsu. 21-25 [doi]
• On the achievable individual-secrecy rate region for broadcast channels with receiver side informationYanling Chen, Onur Ozan Koyluoglu, Aydin Sezgin. 26-30 [doi]
• Achievable secure degrees of freedom of MISO broadcast channel With alternating CSITZohaib Hassan Awan, Abdellatif Zaidi, Aydin Sezgin. 31-35 [doi]
• Blind wiretap channel with delayed CSITSina Lashgari, Amir Salman Avestimehr. 36-40 [doi]
• Decentralized caching with secure deliveryAvik Sengupta, Ravi Tandon, T. Charles Clancy. 41-45 [doi]
• Cache-induced opportunistic MIMO cooperation: A new paradigm for future wireless content access networksAn Liu, Vincent K. N. Lau. 46-50 [doi]
• Multi-armed bandit optimization of cache content in wireless infostation networksPol Blasco, Deniz Gündüz. 51-55 [doi]
• Multi-level coded cachingJad Hachem, Nikhil Karamchandani, Suhas N. Diggavi. 56-60 [doi]
• Ad hoc networking with rate-limited infrastructure: Generalized capacity scalingCheol Jeong, Won-Yong Shin. 61-65 [doi]
• Performance of path-time codes for end-to-end transmission in ad hoc multihop networksI-Wei Lai, Chia-han Lee, Kwang-Cheng Chen, Ezio Biglieri. 66-70 [doi]
• Demystifying the scaling laws of dense wireless networks: No linear scaling in practiceSong-Nam Hong, Giuseppe Caire. 71-75 [doi]
• Scaling laws for Infrastructure Single and multihop wireless networks in wideband regimesFelipe Gomez-Cuba, Sundeep Rangan, Elza Erkip. 76-80 [doi]
• Joint network and Gelfand-Pinsker coding for 3-receiver Gaussian broadcast channels with receiver message side informationJin Sima, Wei Chen. 81-85 [doi]
• State-dependent parallel Gaussian channels with a common helper in high power regimeRuchen Duan, Yingbin Liang, Ashish Khisti, Shlomo Shamai. 86-90 [doi]
• The effect of maximal rate codes on the interfering message rateRonit Bustin, H. Vincent Poor, Shlomo Shamai. 91-95 [doi]
• Multi-level coding and multi-stage decoding in MAC, broadcast, and relay channelAhmed Attia Abotabl, Aria Nosratinia. 96-100 [doi]
• Characteristic-dependent linear rank inequalities and network coding applicationsRandall Dougherty, Eric Freiling, Kenneth Zeger. 101-105 [doi]
• Reverse edge cut-set bounds for secure network codingWentao Huang, Tracey Ho, Michael Langberg, Jörg Kliewer. 106-110 [doi]
• On routing-optimal networks for multiple unicastsChun Meng, Athina Markopoulou. 111-115 [doi]
• Resilient flow decomposition of unicast connections with network codingPéter Babarczi, János Tapolcai, Lajos Rónyai, Muriel Médard. 116-120 [doi]
• On the puncturing patterns for punctured polar codesLiang Zhang, Zhaoyang Zhang 0001, Xianbin Wang, Qilian Yu, Yan Chen. 121-125 [doi]
• On the scaling of the blocklength in some polar coding schemesDavid Burshtein, Dina Goldin. 126-130 [doi]
• From polar to Reed-Muller codes: A technique to improve the finite-length performanceMarco Mondelli, Seyed Hamed Hassani, Rüdiger L. Urbanke. 131-135 [doi]
• A novel partial order for the information sets of polar codes over B-DMCsMine Alsan. 136-140 [doi]
• Second order refinements for the classical capacity of quantum channels with separable input statesMarco Tomamichel, Vincent Y. F. Tan. 141-145 [doi]
• Classical-quantum arbitrarily varying wiretap channel - A capacity formula with Ahlswede Dichotomy - ResourcesHolger Boche, Minglai Cai, Christian Deppe. 146-150 [doi]
• Constant compositions in the sphere packing bound for classical-quantum channelsMarco Dalai, Andreas Winter. 151-155 [doi]
• Cooperation for the classical-quantum multiple access channelHolger Boche, Janis Nötzel. 156-160 [doi]
• Exact common informationGowtham Ramani Kumar, Cheuk Ting Li, Abbas El Gamal. 161-165 [doi]
• Coincidence of 1- and 2-dimensional entropiesNigel Burke, John Enns. 166-170 [doi]
• Side-information in control and estimationGovind Ramnarayan, Gireeja Ranade, Anant Sahai. 171-175 [doi]
• Informational divergence and entropy rate on rooted trees with probabilitiesGeorg Böcherer, Rana Ali Amjad. 176-180 [doi]
• Integer-Forcing source codingOr Ordentlich, Uri Erez. 181-185 [doi]
• On the dither-quantized Gaussian channel at low SNRTobias Koch. 186-190 [doi]
• Quantizer design for outputs of binary-input discrete memoryless channels using SMAWK algorithmKen-ichi Iwata, Shin-ya Ozawa. 191-195 [doi]
• Scalar quantization with noisy partitions and its application to Flash ADC designDa Wang, Yury Polyanskiy, Gregory W. Wornell. 196-200 [doi]
• Rank-deficient solutions for optimal signaling over secure MIMO channelsSergey Loyka, Charalambos D. Charalambous. 201-205 [doi]
• Decomposing the MIMO wiretap channelAnatoly Khina, Yuval Kochman, Ashish Khisti. 206-210 [doi]
• On multi-user MISO wiretap channels with delayed CSITRavi Tandon, Pablo Piantanida, Shlomo Shamai. 211-215 [doi]
• MISO broadcast channels with confidential messages and alternating CSITPritam Mukherjee, Ravi Tandon, Sennur Ulukus. 216-220 [doi]
• Multi terminal probabilistic compressed sensingSaeid Haghighatshoar. 221-225 [doi]
• Signal recovery using expectation consistent approximation for linear observationsYoshiyuki Kabashima, Mikko Vehkaperä. 226-230 [doi]
• Power allocation in compressed sensing of non-uniformly sparse signalsXiaochen Zhao, Wei Dai. 231-235 [doi]
• On the convergence of approximate message passing with arbitrary matricesSundeep Rangan, Philip Schniter, Alyson K. Fletcher. 236-240 [doi]
• Scalable upper bounding models for wireless networksJinfeng Du, Muriel Médard, Ming Xiao, Mikael Skoglund. 241-245 [doi]
• Minimum node degree and k-connectivity in wireless networks with unreliable linksJun Zhao. 246-250 [doi]
• Information theoretic upper bound on the capacity of wireless backhaul networksHarpreet S. Dhillon, Giuseppe Caire. 251-255 [doi]
• Mobile conductance in sparse networks and mobility-connectivity tradeoffHuazi Zhang, Yufan Huang, Zhaoyang Zhang 0001, Huaiyu Dai. 256-260 [doi]
• On Gaussian interference channels with mixed gaussian and discrete inputsAlex Dytso, Natasha Devroye, Daniela Tuninetti. 261-265 [doi]
• On the second-order cost of TDMA for Gaussian multiple accessEbrahim MolavianJazi, J. Nicholas Laneman. 266-270 [doi]
• A generalized cut-set bound for deterministic multi-flow networks and its applicationsIlan Shomorony, Amir Salman Avestimehr. 271-275 [doi]
• The sum-rate capacity of general degraded interference networks with arbitrary topologiesReza Khosravi-Farsani. 276-280 [doi]
• Critical graphs in index codingMehrdad Tahmasbi, Amirbehshad Shahrasbi, Amin Gohari. 281-285 [doi]
• Local time sharing for index codingFatemeh Arbabjolfaei, Young Han Kim. 286-290 [doi]
• Graph theory versus minimum rank for index codingKarthikeyan Shanmugam, Alexandros G. Dimakis, Michael Langberg. 291-295 [doi]
• Bounding multiple unicasts through index coding and Locally Repairable CodesKarthikeyan Shanmugam, Alexandros G. Dimakis. 296-300 [doi]
• A simple proof of polarization and polarization for non-stationary channelsMine Alsan, Emre Telatar. 301-305 [doi]
• Achieving Marton's region for broadcast channels using polar codesMarco Mondelli, Seyed Hamed Hassani, Rüdiger L. Urbanke, Igal Sason. 306-310 [doi]
• Polar coding for interference networksLele Wang, Eren Sasoglu. 311-315 [doi]
• Polar codes for some multi-terminal communications problemsAria Ghasemian Sahebi, S. Sandeep Pradhan. 316-320 [doi]
• Mismatched quantum filtering and entropic informationMankei Tsang. 321-325 [doi]
• Squashed entanglement and the two-way assisted capacities of a quantum channelMasahiro Takeoka, Saikat Guha, Mark M. Wilde. 326-330 [doi]
• Identifying the information gain of a quantum measurementMario Berta, Joseph M. Renes, Mark M. Wilde. 331-335 [doi]
• Optimal measurements for symmetric quantum states with applications to optical quantum communicationHari Krovi, Saikat Guha, Zachary Dutton, Marcus P. da Silva. 336-340 [doi]
• Bounds for constrained entropy maximisationTerence H. Chan, Alex J. Grant. 341-345 [doi]
• Codes for tasks and Rényi entropy rateChristoph Bunte, Amos Lapidoth. 346-350 [doi]
• Information divergences and the curious case of the binary alphabetJiantao Jiao, Thomas A. Courtade, Albert No, Kartik Venkat, Tsachy Weissman. 351-355 [doi]
• Ensemble estimation of multivariate f-divergenceKevin R. Moon, Alfred O. Hero. 356-360 [doi]
• The degrees-of-freedom of multi-way device-to-device communications is limited by 2Anas Chaaban, Henning Maier, Aydin Sezgin. 361-365 [doi]
• Linear degrees of freedom of the MIMO X-channel with delayed CSITDavid T.-H. Kao, Amir Salman Avestimehr. 366-370 [doi]
• On the generalized degrees-of-freedom of the phase fading Z-interference channel with a relayDaniel Zahavi, Ron Dabora. 371-375 [doi]
• A degrees of freedom-optimal scheme for SISO X channel with synergistic alternating CSITAhmed Wagdy, Amr El-Keyi, Tamer Khattab, Mohammed Nafie. 376-380 [doi]
• On Landau's eigenvalue theorem and its applicationsMassimo Franceschetti. 381-385 [doi]
• Lossy source coding with reconstruction privacyKittipong Kittichokechai, Tobias J. Oechtering, Mikael Skoglund. 386-390 [doi]
• Inseparability of the multiple access wiretap channelJianwei Xie, Sennur Ulukus. 391-395 [doi]
• Layered secure broadcasting over MIMO channels and application in secret sharingShaofeng Zou, Yingbin Liang, Lifeng Lai, Shlomo Shamai. 396-400 [doi]
• Secret sharing schemes based on min-entropiesMitsugu Iwamoto, Junji Shikata. 401-405 [doi]
• Secure coordination with a two-sided helperSanket Satpathy, Paul Cuff. 406-410 [doi]
• Channel upgradation for non-binary input alphabets and MACsUzi Pereg, Ido Tal. 411-415 [doi]
• An efficient feedback coding scheme with low error probability for discrete memoryless channelsCheuk Ting Li, Abbas El Gamal. 416-420 [doi]
• On modulation coding for channels with cost constraintsVictor Y. Krachkovsky, Razmik Karabed, Shaohua Yang, Bruce A. Wilson. 421-425 [doi]
• Short-blocklength non-binary LDPC codes with feedback-dependent incremental transmissionsKasra Vakilinia, Tsung-Yi Chen, Sudarsan Vasista Srinivasan Ranganathan, Adam R. Williamson, Dariush Divsalar, Richard D. Wesel. 426-430 [doi]
• Probabilistic signal shaping for bit-metric decodingGeorg Bocherer. 431-435 [doi]
• On the stability of random multiple access with feedback exploitation and queue priorityKarim G. Seddik. 436-440 [doi]
• Energy-efficient data transmission over multiple-access channels with QoS constraintsYing Cui, Edmund M. Yeh, Stephen V. Hanly. 441-445 [doi]
• Stable scheduling in Heterogeneous NetworksStephen V. Hanly, Philip A. Whiting. 446-450 [doi]
• Delay optimal control and its connection to the dynamic backpressure algorithmYing Cui, Edmund M. Yeh. 451-455 [doi]
• How much can knowledge of delay model help chunked coding over networks with perfect feedback?Anoosheh Heidarzadeh, Amir H. Banihashemi. 456-460 [doi]
• Second-order asymptotics for the gaussian MAC with degraded message setsJonathan Scarlett, Vincent Y. F. Tan. 461-465 [doi]
• An improved outer bound on the admissible source region for broadcast channels with correlated sourcesKia Khezeli, Jun Chen. 466-470 [doi]
• Explicit and almost sure conditions for K/2 degrees of freedomDavid Stotz, Helmut Bölcskei. 471-475 [doi]
• Asymptotic properties of dual-hop AF relay MIMO communication systemsMaksym A. Girnyk, Mikko Vehkaperä, Lars K. Rasmussen. 476-480 [doi]
• Large deviations analysis of variable-rate Slepian-Wolf codingNir Weinberger, Neri Merhav. 481-485 [doi]
• Linear index coding and representable discrete polymatroidsVijayvaradharaj T. Muralidharan, B. Sundar Rajan. 486-490 [doi]
• Linear Codes are Optimal for Index-Coding Instances with Five or Fewer ReceiversLawrence Ong. 491-495 [doi]
• Some new results on index coding when the number of data is less than the number of receiversJungho So, Sangwoon Kwak, Youngchul Sung. 496-500 [doi]
• An extended least difference greedy clique-cover algorithm for index codingSangwoon Kwak, Jungho So, Youngchul Sung. 501-505 [doi]
• Spatially-coupled MacKay-Neal codes with no bit nodes of degree two achieve the capacity of BECTakuya Okazaki, Kenta Kasai. 506-510 [doi]
• Non-binary algebraic spatially-coupled quasi-cyclic LDPC codesKeke Liu, Mostafa El-Khamy, Jungwon Lee, Inyup Kang, Arvind Yedla. 511-515 [doi]
• Spatially-coupled codes for side-information problemsSanthosh Kumar, Avinash Vem, Krishna R. Narayanan, Henry D. Pfister. 516-520 [doi]
• Spatially-coupled precoded rateless codes with bounded degree achieve the capacity of BEC under BP decodingKosuke Sakata, Kenta Kasai, Kohichi Sakaniwa. 521-525 [doi]
• Perfect signaling among three parties violating predefined causal orderAmin Baumeler, Stefan Wolf. 526-530 [doi]
• Asymptotic reversibility of LOCC conversionsKosuke Ito, Wataru Kumagai, Masahito Hayashi. 531-535 [doi]
• Efficient achievability for quantum protocols using decoupling theoremsChristoph Hirche, Ciara Morgan. 536-540 [doi]
• Positivity, discontinuity, finite resources, nonzero error for arbitrarily varying quantum channelsHolger Boche, Janis Nötzel. 541-545 [doi]
• Robust quantum error syndrome extraction by classical codingAlexei E. Ashikhmin, Ching-Yi Lai, Todd A. Brun. 546-550 [doi]
• Social learning and distributed hypothesis testingAnusha Lalitha, Anand D. Sarwate, Tara Javidi. 551-555 [doi]
• Strong large deviations for composite hypothesis testingYen-Wei Huang, Pierre Moulin. 556-560 [doi]
• A non-asymptotic standardization of binomial counts in Higher CriticismDavid Mary, André Ferrari. 561-565 [doi]
• Some remarks on robust binary hypothesis testingEzio Biglieri, László Györfi. 566-570 [doi]
• Optimal simultaneous detection and signal and noise power estimationLong Le, Douglas L. Jones. 571-575 [doi]
• An achievable rate-distortion region for the multiple descriptions problemFarhad Shirani Chaharsooghi, S. Sandeep Pradhan. 576-580 [doi]
• One helper source coding problem for a class of correlated sources with memoryYasutada Oohama. 581-585 [doi]
• Distributed remote vector gaussian source coding with covariance distortion constraintsAdel Zahedi, Jan Østergaard, Søren Holdt Jensen, Patrick A. Naylor, Soren Bech. 586-590 [doi]
• A proof of the Generalized Markov Lemma with countable infinite sourcesPablo Piantanida, Leonardo Rey Vega, Alfred O. Hero. 591-595 [doi]
• The Henchman problem: Measuring secrecy by the minimum distortion in a listCurt Schieler, Paul Cuff. 596-600 [doi]
• Effective secrecy: Reliability, confusion and stealthJie Hou, Gerhard Kramer. 601-605 [doi]
• LPD communication when the warden does not know whenBoulat A. Bash, Dennis Goeckel, Don Towsley. 606-610 [doi]
• Reliable, deniable, and hidable communication over multipath networksSwanand Kadhe, Sidharth Jaggi, Mayank Bakshi, Alex Sprintson. 611-615 [doi]
• Outage capacity of OSTBCs over pico-cellular MIMO channelsLu Wei, Zhong Zheng, Jukka Corander, Giorgio Taricco. 616-620 [doi]
• Broadcast approach for the sparse-input random-sampled MIMO Gaussian channelAntonia Maria Tulino, Giuseppe Caire, Shlomo Shamai. 621-625 [doi]
• Transmission strategies for MIMO channels with processing and transmit power constraintsJialin He, Dinesh Rajan. 626-630 [doi]
• SVD-based estimation for reduced-rank MIMO channelTao Cui, Qian Wang, Yindi Jing, Xinwei Yu. 631-635 [doi]
• Distributed decode-forward for multicastSung-Hoon Lim, Kwang Taik Kim, Young Han Kim. 636-640 [doi]
• Structure of optimal schedules in diamond networksSiddhartha Brahma, Christina Fragouli. 641-645 [doi]
• Feasibility study of physical-layer network coding in 802.11p VANETsIvan Wang Hei Ho, Soung Chang Liew, Lu Lu. 646-650 [doi]
• Distributed reed-solomon codes for simple multiple access networksWael Halbawi, Tracey Ho, Hongyi Yao, Iwan M. Duursma. 651-655 [doi]
• The capacity region of a class of deterministic state-dependent Z-interference channelsRitesh Kolte, Ayfer Özgür, Haim H. Permuter. 656-660 [doi]
• A signal-space analysis of spatial self-interference isolation for full-duplex wirelessEvan Everett, Ashutosh Sabharwal. 661-665 [doi]
• Binary Fading Interference Channel with No CSITAlireza Vahid, Mohammad Ali Maddah-Ali, Amir Salman Avestimehr. 666-670 [doi]
• Harnessing bursty interference in multicarrier systems with feedbackShaunak Mishra, I-Hsiang Wang, Suhas N. Diggavi. 671-675 [doi]
• Binary cyclic codes that are locally repairableSreechakra Goparaju, A. Robert Calderbank. 676-680 [doi]
• Locality and availability in distributed storageAnkit Singh Rawat, Dimitris S. Papailiopoulos, Alexandros G. Dimakis, Sriram Vishwanath. 681-685 [doi]
• A family of optimal locally recoverable codesItzhak Tamo, Alexander Barg. 686-690 [doi]
• Bounds on locally recoverable codes with multiple recovering setsItzhak Tamo, Alexander Barg. 691-695 [doi]
• Instanton search algorithm for the ADMM penalized decoderXishuo Liu, Stark C. Draper. 696-700 [doi]
• Check-hybrid GLDPC codes: Systematic elimination of trapping sets by super checksVida Ravanmehr, David Declercq, Bane V. Vasic. 701-705 [doi]
• An application of generalized belief propagation: splitting trapping sets in LDPC codesJean-Christophe Sibel, Sylvain Reynal, David Declercq. 706-710 [doi]
• Design of high-rate irregular non-binary LDPC codes using algorithmic stopping-set cancellationSudarsan Vasista Srinivasan Ranganathan, Dariush Divsalar, Kasra Vakilinia, Richard D. Wesel. 711-715 [doi]
• Strong converse for entanglement-assisted capacityManish K. Gupta 0003, Mark M. Wilde. 716-720 [doi]
• Resource cost results for entanglement distillation and state merging under source uncertaintiesHolger Boche, Gisbert Janssen. 721-725 [doi]
• Strong converse for the capacity of quantum Gaussian channelsBhaskar Roy Bardhan, Raul Garcia-Patron, Mark M. Wilde, Andreas Winter. 726-730 [doi]
• A duality relation connecting different quantum generalizations of the conditional Rényi entropyMarco Tomamichel, Mario Berta, Masahito Hayashi. 731-735 [doi]
• A Bayesian approach to two-sided quickest change detectionJames Falt, Steven D. Blostein. 736-740 [doi]
• Data-efficient quickest change detection with unknown post-change distributionTaposh Banerjee, Venugopal V. Veeravalli. 741-745 [doi]
• Opportunistic detection rulesWenyi Zhang, George V. Moustakides, H. Vincent Poor. 746-750 [doi]
• A Weiss-Weinstein lower bound based sensing strategy for active state trackingDaphney-Stavroula Zois, Urbashi Mitra. 751-755 [doi]
• The CEO problem with secrecy constraintsFarshad Naghibi, Somayeh Salimi, Mikael Skoglund. 756-760 [doi]
• Universal quantization for separate encodings and joint decoding of correlated sourcesAvraham Reani, Neri Merhav. 761-765 [doi]
• Vector Gaussian two-terminal CEO problem under sum distortionYinfei Xu, Qiao Wang. 766-770 [doi]
• On the three-terminal interactive lossy source coding problemLeonardo Rey Vega, Pablo Piantanida, Alfred O. Hero. 771-775 [doi]
• Coded cooperative data exchange for a secret keyThomas A. Courtade, Thomas R. Halford. 776-780 [doi]
• Triangle network secrecyLászló Czap, Vinod M. Prabhakaran, Suhas N. Diggavi, Christina Fragouli. 781-785 [doi]
• Optimality of routing on the wiretap network with simple network topologyFan Cheng. 786-790 [doi]
• Active adversaries from an information-theoretic perspective: Data modification attacksMahtab Mirmohseni, Panagiotis Papadimitratos. 791-795 [doi]
• Capacity of the discrete memoryless energy harvesting channel with side informationOmur Ozel, Kaya Tutuncuoglu, Sennur Ulukus, Aylin Yener. 796-800 [doi]
• Approximate capacity of energy harvesting communication with finite batteryYishun Dong, Ayfer Özgür. 801-805 [doi]
• An energy harvesting AWGN channel with a finite batteryVarun Jog, Venkat Anantharam. 806-810 [doi]
• Achievable rate for energy harvesting channel with finite blocklengthJing Yang. 811-815 [doi]
• A hybrid algorithm for content placement in distributed video on demand systemsJames Yifei Yang, Bruce E. Hajek. 816-820 [doi]
• Dynamic control of video quality for AVSAnkit Singh Rawat, Emina Soljanin. 821-825 [doi]
• Information in tweets: Analysis of a bufferless timing channel modelMehrnaz Tavan, Roy D. Yates, Waheed U. Bajwa. 826-830 [doi]
• Information overload and human priority queuingAseem Sharma, Krishna P. Jagannathan, Lav R. Varshney. 831-835 [doi]
• Degrees of Freedom for multiple-multicast trafficShaileshh Bojja Venkatakrishnan, Pramod Viswanath, Sreeram Kannan. 836-840 [doi]
• On the optimality of treating interference as noise for parallel deterministic interference networksHua Sun, Syed Ali Jafar. 841-845 [doi]
• Topological interference management with transmitter cooperationXinping Yi, David Gesbert. 846-850 [doi]
• The separability and ergodic sum-rate of parallel Gaussian interference channelsAli Haghi, Amir K. Khandani. 851-855 [doi]
• One extra bit of download ensures perfectly private information retrievalNihar B. Shah, K. V. Rashmi, Kannan Ramchandran. 856-860 [doi]
• The MDS queue: Analysing the latency performance of erasure codesNihar B. Shah, Kangwook Lee, Kannan Ramchandran. 861-865 [doi]
• Sending perishable information: Coding improves delay-constrained throughput even for single unicastChih-Chun Wang, Minghua Chen. 866-870 [doi]
• Multi-version coding in distributed storageZhiying Wang, Viveck R. Cadambe. 871-875 [doi]
• Performance comparison of non-binary LDPC block and spatially coupled codesKechao Huang, David G. M. Mitchell, Lai Wei, Xiao Ma, Daniel J. Costello Jr.. 876-880 [doi]
• Threshold analysis of non-binary spatially-coupled LDPC codes with windowed decodingLai Wei, Toshiaki Koike-Akino, David G. M. Mitchell, Thomas E. Fuja, Daniel J. Costello Jr.. 881-885 [doi]
• Absorbing set characterization of array-based spatially coupled LDPC codesDavid G. M. Mitchell, Lara Dolecek, Daniel J. Costello Jr.. 886-890 [doi]
• Analyzing finite-length protograph-based spatially coupled LDPC codesMarkus Stinner, Pablo M. Olmos. 891-895 [doi]
• Constructions of pure asymmetric quantum alternant codes based on subclasses of Alternant codesJihao Fan, Hanwu Chen. 896-900 [doi]
• Superadditivity of quantum channel coding rate with finite blocklength quantum measurementsHye Won Chung, Saikat Guha, Lizhong Zheng. 901-905 [doi]
• Quantum error-correcting codes for amplitude dampingMarkus Grassl, Zhaohui Wei, Zhang-Qi Yin, Bei Zeng. 906-910 [doi]
• The MacWilliams identity for quantum convolutional codesChing-Yi Lai, Min-Hsiu Hsieh. 911-915 [doi]
• Control your information for better predictionsMichal Moshkovitz, Naftali Tishby. 916-920 [doi]
• Randomized sketches of convex programs with sharp guaranteesMert Pilanci, Martin J. Wainwright. 921-925 [doi]
• Sparse feature selection by information theoryGuangyao Zhou, Stuart Geman, Joachim M. Buhmann. 926-930 [doi]
• On efficiency and low sample complexity in phase retrievalYoussef Mroueh, Lorenzo Rosasco. 931-935 [doi]
• Rate-distortion functions for source coding when side information with unknown delay may be presentTetsunao Matsuta, Tomohiko Uyematsu. 936-940 [doi]
• On multiterminal source coding with list decoding constraintsYeow-Khiang Chia. 941-945 [doi]
• Justification of logarithmic loss via the benefit of side informationJiantao Jiao, Thomas A. Courtade, Kartik Venkat, Tsachy Weissman. 946-950 [doi]
• Vector Gaussian rate-distortion with variable side informationSinem Unal, Aaron B. Wagner. 951-955 [doi]
• Explicit capacity-achieving coding scheme for the Gaussian wiretap channelHimanshu Tyagi, Alexander Vardy. 956-960 [doi]
• Polar lattices for strong secrecy over the mod-Λ Gaussian wiretap channelYanfei Yan, Ling Liu, Cong Ling. 961-965 [doi]
• An analysis of small dimensional fading wiretap lattice codesJérôme Ducoat, Frédérique E. Oggier. 966-970 [doi]
• Secrecy gain, flatness factor, and secrecy-goodness of even unimodular latticesFuchun Lin, Cong Ling, Jean-Claude Belfiore. 971-975 [doi]
• Improved capacity bounds for the binary energy harvesting channelKaya Tutuncuoglu, Omur Ozel, Aylin Yener, Sennur Ulukus. 976-980 [doi]
• Energy efficient random multiple access with strict delay constraintsSreejith Sreekumar, Sibi Raj B. Pillai, Bikash Kumar Dey. 981-985 [doi]
• Energy harvesting diamond channel with energy cooperationBerk Gurakan, Sennur Ulukus. 986-990 [doi]
• Constrained codes for joint energy and information transfer with receiver energy utilization requirementsAli Mohammad Fouladgar, Osvaldo Simeone, Elza Erkip. 991-995 [doi]
• Cellular network coverage with inter-cell interference coordination and intra-cell diversityXinchen Zhang, Martin Haenggi. 996-1000 [doi]
• Elastic routing in wireless networks with directional antennasJangho Yoon, Won-Yong Shin, Sang-Woon Jeon. 1001-1005 [doi]
• A new achievability scheme for downlink multicell processing with finite backhaul capacityNan Liu, Wei Kang. 1006-1010 [doi]
• Market-based power allocation for a differentially priced FDMA systemMohammad Hassan Lotfi, George Kesidis, Saswati Sarkar. 1011-1015 [doi]
• Characterizing per node degrees of freedom in an interference networkMohammad A. Khojastepour, Mohammad Farajzadeh-Tehraniy. 1016-1020 [doi]
• Symmetric decentralized interference channels with noisy feedbackSamir Medina Perlaza, Ravi Tandon, H. Vincent Poor. 1021-1025 [doi]
• Achievable regions for interference channels with generalized and intermittent feedbackAbdellatif Zaidi. 1026-1030 [doi]
• Interference channels with very weak interferenceSida Liu, Chandra Nair, Lingxiao Xia. 1031-1035 [doi]
• New codes and inner bounds for exact repair in distributed storage systemsSreechakra Goparaju, Salim El Rouayheb, A. Robert Calderbank. 1036-1040 [doi]
• On the minimum storage overhead of distributed storage codes with a given repair localityHenk D. L. Hollmann. 1041-1045 [doi]
• Regenerating codes over a binary cyclic codeKenneth W. Shum, Hanxu Hou, Minghua Chen, Huanle Xu, Hui Li. 1046-1050 [doi]
• Channel-code detection by a third-party receiver via the likelihood ratio testArti D. Yardi, Animesh Kumar, Saravanan Vijayakumaran. 1051-1055 [doi]
• Synchronizing rankings via interactive communicationLili Su, Olgica Milenkovic. 1056-1060 [doi]
• Approximate capacities of two-dimensional codes by spatial mixingYikai Wang, Yitong Yin, Sheng Zhong. 1061-1065 [doi]
• Correction of samplable additive errorsKenji Yasunaga. 1066-1070 [doi]
• A decoding algorithm for CSS codes using the X/Z correlationsNicolas Delfosse, Jean-Pierre Tillich. 1071-1075 [doi]
• Quantum codes and symplectic matroidsPradeep Kiran Sarvepalli. 1076-1080 [doi]
• Branching MERA codes: A natural extension of classical and quantum polar codesAndrew James Ferris, David Poulin. 1081-1085 [doi]
• Numerical techniques for finding the distances of quantum codesIlya Dumer, Alexey A. Kovalev, Leonid P. Pryadko. 1086-1090 [doi]
• Information geometry approach to parameter estimation in Markov chainsMasahito Hayashi, Shun Watanabe. 1091-1095 [doi]
• Large deviation property of waiting times for Markov and mixing processesVatsal Sharan, Rakesh K. Bansal. 1096-1100 [doi]
• The value of noise for informational cascadesTho Ngoc Le, Vijay G. Subramanian, Randall A. Berry. 1101-1105 [doi]
• Local statistical models from deterministic state space models, likelihood filtering, and local typicalityLukas Bruderer, Hans-Andrea Loeliger, Nour Zalmai. 1106-1110 [doi]
• Analogy between gambling and measurement-based work extractionDror A. Vinkler, Haim H. Permuter, Neri Merhav. 1111-1115 [doi]
• A proof of the Ahlswede-Cai-Zhang conjectureChristoph Bunte, Amos Lapidoth, Alex Samorodnitsky. 1116-1120 [doi]
• New upper bounds for grain-correcting and grain-detecting codesArtyom Sharov, Ron M. Roth. 1121-1125 [doi]
• A Heisenberg limit for quantum region estimationMichael Walter, Joseph M. Renes. 1126-1130 [doi]
• On topological properties of wireless sensor networks under the q-composite key predistribution scheme with on/off channelsJun Zhao 0007, Osman Yagan, Virgil D. Gligor. 1131-1135 [doi]
• Secret key agreement: General capacity and second-order asymptoticsMasahito Hayashi, Himanshu Tyagi, Shun Watanabe. 1136-1140 [doi]
• Secret key-private key generation over three terminals: Capacity regionHuishuai Zhang, Lifeng Lai, Yingbin Liang, Hua Wang. 1141-1145 [doi]
• Key capacity with limited one-way communication for product sourcesJingbo Liu, Paul W. Cuff, Sergio Verdú. 1146-1150 [doi]
• On the communication complexity of secret key generation in the multiterminal source modelManuj Mukherjee, Navin Kashyap. 1151-1155 [doi]
• Achieving SK capacity in the source model: When must all terminals talk?Manuj Mukherjee, Navin Kashyap, Yogesh Sankarasubramaniam. 1156-1160 [doi]
• A game-theoretical model for wireless information and power transfer in relay interference channelsHe Chen, Yunxiang Jiang, Yonghui Li, Yuanye Ma, Branka Vucetic. 1161-1165 [doi]
• Optimal energy-bandwidth allocation for energy harvesting interference networksZhe Wang, Vaneet Aggarwal, Xiaodong Wang. 1166-1170 [doi]
• Achieving nearly 100% throughput without feedback in energy harvesting wireless networksOmer Melih Gul, Elif Uysal-Biyikoglu. 1171-1175 [doi]
• Finite horizon online lazy scheduling with energy harvesting transmitters over fading channelsBaran Tan Bacinoglu, Elif Uysal-Biyikoglu. 1176-1180 [doi]
• On lossy source-channel transmission in Energy Harvesting communication systemsMeysam Shahrbaf Motlagh, Masoud Badiei Khuzani, Patrick Mitran. 1181-1185 [doi]
• Asymmetric cooperative multiple access channels with delayed CSIAbdellatif Zaidi, Shlomo Shamai. 1186-1190 [doi]
• Multicasting in linear deterministic relay network by matrix completionT. Soma. 1191-1195 [doi]
• Capacity bounds for a class of diamond networksShirin Saeedi Bidokhti, Gerhard Kramer. 1196-1200 [doi]
• Energy-efficient communication over the unsynchronized Gaussian diamond networkRitesh Kolte, Urs Niesen, Piyush Gupta. 1201-1205 [doi]
• Achievable partition information rate over noisy multi-access Boolean channelShuhang Wu, Shuangqing Wei, Yue Wang 0007, Ramachandran Vaidyanathan, Jian Yuan. 1206-1210 [doi]
• Channel diversity needed for vector interference alignmentCheuk Ting Li, Ayfer Özgür. 1211-1215 [doi]
• Interference alignment with diversity for the 2 × 2 X-Network with three antennasAbhinav Ganesan, B. Sundar Rajan. 1216-1220 [doi]
• Degrees of freedom of interference channel with rank-deficient transfer matrixAbinesh Ramakrishnan, Sundar Rajan Krishnamurthy, Syed Ali Jafar, Yaming Yu. 1221-1225 [doi]
• Unstructured linear beamforming design for interference alignment in MIMO cellular networksGokul Sridharan, Wei Yu. 1226-1230 [doi]
• Linear Boolean classification, coding and "the critical problem"Emmanuel Abbe, Noga Alon, Afonso S. Bandeira. 1231-1235 [doi]
• List decoding of crisscross error patternsAntonia Wachter-Zeh. 1236-1240 [doi]
• Identification codes to identify multiple objectsHirosuke Yamamoto, Masashi Ueda. 1241-1245 [doi]
• Codes for correcting three or more adjacent deletions or insertionsLing Cheng, Theo G. Swart, Hendrik C. Ferreira, Khaled A. S. Abdel-Ghaffar. 1246-1250 [doi]
• Linear inverse problems on Erdős-Rényi graphs: Information-theoretic limits and efficient recoveryEmmanuel Abbe, Afonso S. Bandeira, Annina Bracher, Amit Singer. 1251-1255 [doi]
• Generalized sphere packing bound: Basic principlesArman Fazeli, Alexander Vardy, Eitan Yaakobi. 1256-1260 [doi]
• Generalized sphere packing bound: ApplicationsArman Fazeli, Alexander Vardy, Eitan Yaakobi. 1261-1265 [doi]
• Generalized sphere-packing upper bounds on the size of codes for combinatorial channelsDaniel F. Cullina, Negar Kiyavash. 1266-1270 [doi]
• New bounds on the probability of a finite union of eventsJun Yang, Fady Alajaji, Glen Takahara. 1271-1275 [doi]
• An Elias bound on the Bhattacharyya distance of codes for channels with a zero-error capacityMarco Dalai. 1276-1280 [doi]
• Scaling laws for molecular communicationAndrew W. Eckford, Chan-Byoung Chae. 1281-1285 [doi]
• DNA assembly from paired reads as 2-D jigsaw puzzlesEren Sasoglu, David Tse. 1286-1290 [doi]
• Directed information between connected leaky integrate-and-fire neuronsNima Soltani, Andrea J. Goldsmith. 1291-1295 [doi]
• Quadratic-backtracking algorithm for string reconstruction from substring compositionsJayadev Acharya, Hirakendu Das, Olgica Milenkovic, Alon Orlitsky, Shengjun Pan. 1296-1300 [doi]
• The capacity of string-duplication systemsFarzad Farnoud, Moshe Schwartz, Jehoshua Bruck. 1301-1305 [doi]
• Variable-density sampling on the dual latticePeng Zhang, Sumei Sun, Cong Ling. 1306-1310 [doi]
• Information-theoretic bounds for adaptive sparse recoveryCem Aksoylar, Venkatesh Saligrama. 1311-1315 [doi]
• To average or not to average: Trade-off in compressed sensing with noisy measurementsKei Sano, Ryosuke Matsushita, Toshiyuki Tanaka. 1316-1320 [doi]
• Faster SVD-truncated regularized least-squaresChristos Boutsidis, Malik Magdon-Ismail. 1321-1325 [doi]
• Generalized binary independent component analysisAmichai Painsky, Saharon Rosset, Meir Feder. 1326-1330 [doi]
• Lossless coding of correlated sources with actions in acyclic directed networksOron Sabag, Haim H. Permuter, Asaf Cohen. 1331-1335 [doi]
• Revisiting the Slepian-Wolf coding problem for general sources: A direct approachTomohiko Uyematsu, Tetsunao Matsuta. 1336-1340 [doi]
• The Ahlswede-Körner coordination problem with one-sided encoder cooperationZiv Goldfeld, Haim H. Permuter, Gerhard Kramer. 1341-1345 [doi]
• Equating the achievable exponent region to the achievable entropy region by partitioning the sourceEric Graves, Tan F. Wong. 1346-1350 [doi]
• A secret sharing scheme based on a systematic Reed-Solomon code and analysis of its security for a general class of sourcesHiroki Koga, Shuntaro Honjo. 1351-1355 [doi]
• Three-level storage and nested MDS codes for perfect secrecy in multiple cloudsPing Hu, Chi Wan Sung, Siu-Wai Ho, Terence H. Chan. 1356-1360 [doi]
• Constructing Boolean functions with potentially optimal algebraic immunity based on additive decompositions of finite fields (extended abstract)Baofeng Wu, Qingfang Jin, Zhuojun Liu, Dongdai Lin. 1361-1365 [doi]
• Weakly secure data exchange with Generalized Reed Solomon codesMuxi Yan, Alex Sprintson, Igor Zelenko. 1366-1370 [doi]
• Opportunistic scheduling with limited channel state information: A rate distortion approachMatthew Johnston, Eytan Modiano, Yury Polyanskiy. 1371-1375 [doi]
• Traffic-aware training and scheduling for the 2-user MISO broadcast channelApostolos Destounis, Mohamad Assaad, Mérouane Debbah, Bessem Sayadi. 1376-1380 [doi]
• QoS-driven power control for fading channels with arbitrary input distributionsGozde Ozcan, Mustafa Cenk Gursoy. 1381-1385 [doi]
• ZigZag neighbor discovery in wireless networksArash Saber Tehrani, Giuseppe Caire. 1386-1390 [doi]
• Energy efficiency and SINR maximization beamformers for cognitive radio utilizing sensing informationAbdulrahman Alabbasi, Zouheir Rezki, Basem Shihada. 1391-1395 [doi]
• A combined underlay and interweave strategy for cognitive radiosS. Ali Hesammohseni, Kamyar Moshksar, Amir K. Khandani. 1396-1400 [doi]
• On the power efficiency for cognitive radio networks with multiple relaysMahmoud Ashour, M. Majid Butt, Amr Mohamed. 1401-1405 [doi]
• Enhanced access schemes based on channel statistics for cognitive wireless networksAnthony Fanous, Anthony Ephremides. 1406-1410 [doi]
• Symmetric two-user Gaussian interference channel with common message with very low interferenceQuan Geng, Tie Liu. 1411-1415 [doi]
• Capacity theorems for the Cognitive Radio Channel with confidential messagesReza K. Farsani, Reza Ebrahimpour. 1416-1420 [doi]
• Constant-gap results and cooperative strategies for a class of Interference Relay ChannelsGermán Bassi, Pablo Piantanida, Sheng Yang. 1421-1425 [doi]
• New outer bounds for the interference channel with unilateral source cooperationMartina Cardone, Daniela Tuninetti, Raymond Knopp, Umer Salim. 1426-1430 [doi]
• Constructions for constant-weight ICI-free codesScott Kayser, Paul H. Siegel. 1431-1435 [doi]
• Decompositions of edge-colored digraphs: A new technique in the construction of constant-weight codes and related familiesYeow Meng Chee, Fei Gao, Han Mao Kiah, Alan Chi Hung Ling, Hui Zhang 0004, Xiande Zhang. 1436-1440 [doi]
• Product construction of affine codesYeow Meng Chee, Han Mao Kiah, Punarbasu Purkayastha, Patrick Solé. 1441-1445 [doi]
• A polynomial time attack against algebraic geometry code based public key cryptosystemsAlain Couvreur, Irene Marquez Corbella, Ruud Pellikaan. 1446-1450 [doi]
• Universal polar codesSeyed Hamed Hassani, Rüdiger L. Urbanke. 1451-1455 [doi]
• Universal polarizationEren Sasoglu, Lele Wang. 1456-1460 [doi]
• Universal polar codes for more capable and less noisy channels and sourcesDavid Sutter, Joseph M. Renes. 1461-1465 [doi]
• A note on polarization martingalesErdal Arikan. 1466-1468 [doi]
• Fundamental finite key limits for information reconciliation in quantum key distributionMarco Tomamichel, Jesús Martínez-Mateo, Christoph Pacher, David Elkouss. 1469-1473 [doi]
• Variations on classical and quantum extractorsMario Berta, Omar Fawzi, Volkher Scholz, Oleg Szehr. 1474-1478 [doi]
• Trading permutation invariance for communication in multi-party non-locality distillationHelen Ebbe, Stefan Wolf. 1479-1483 [doi]
• Lower bounds on the communication complexity of two-party (quantum) processesAlberto Montina, Stefan Wolf. 1484-1488 [doi]
• Markov chain Monte Carlo algorithms for lattice Gaussian samplingZheng Wang, Cong Ling, Guillaume Hanrot. 1489-1493 [doi]
• Replica analysis and approximate message passing decoder for superposition codesJean Barbier, Florent Krzakala. 1494-1498 [doi]
• Variational free energies for compressed sensingFlorent Krzakala, Andre Manoel, Eric W. Tramel, Lenka Zdeborová. 1499-1503 [doi]
• On stochastic estimation of the partition functionAli Al-Bashabsheh, Yongyi Mao. 1504-1508 [doi]
• On robustness of hybrid digital analog source-channel coding with bandwidth mismatchErman Koken, Ertem Tuncel. 1509-1513 [doi]
• Source-channel coding with multiple classesIrina E. Bocharova, Albert Guillen i Fabregas, Boris D. Kudryashov, Alfonso Martinez, Adrià Tauste Campo, Gonzalo Vazquez-Vilar. 1514-1518 [doi]
• Source broadcasting to the masses: Separation has a bounded lossUri Mendlovic, Meir Feder. 1519-1523 [doi]
• Optimal strategies for dynamic joint source-channel coding with feedbackSe-Yong Park, Tara Javidi, Andrea J. Goldsmith. 1524-1528 [doi]
• Intercepting tokens in cryptographic protocols: The empire strikes back in the clone warsÖzgür Dagdelen, Marc Fischlin. 1529-1533 [doi]
• Cryptographic boolean functions with a large number of variablesQichun Wang, Chik-How Tan. 1534-1538 [doi]
• The oblivious transfer capacity of the wiretapped binary erasure channelManoj Mishra, Bikash Kumar Dey, Vinod M. Prabhakaran, Suhas N. Diggavi. 1539-1543 [doi]
• Single-use ot combiners with near-optimal resilienceYuval Ishai, Hemanta K. Maji, Amit Sahai, Jürg Wullschleger. 1544-1548 [doi]
• Media-based modulation: Converting static Rayleigh fading to AWGNAmir K. Khandani. 1549-1553 [doi]
• Phase modulation for discrete-time wiener phase noise channels with oversampling at high SNRHassan Ghozlan, Gerhard Kramer. 1554-1557 [doi]
• Early decoding for transmission over finite transport blocksCenk Sahin, Lingjia Liu, Erik Perrins. 1558-1562 [doi]
• A novel trellis-based PAPR reduction technique for OFDM signalsRyota Yoshizawa, Hideki Ochiai. 1563-1567 [doi]
• Protocol sequences for multiple-packet reception: Throughput invariance and user irrepressibilityYijin Zhang, Yuan-Hsun Lo, Feng Shu, Wing Shing Wong. 1568-1572 [doi]
• ITLinQ: A new approach for spectrum sharing in device-to-device communication systemsNavid Naderializadeh, Amir Salman Avestimehr. 1573-1577 [doi]
• Slotted Aloha for networked base stations with spatial and temporal diversityDusan Jakovetic, Dragana Bajovic, Dejan Vukobratovic, Vladimir S. Crnojevic. 1578-1582 [doi]
• Age of information with packet managementMaice Costa, Marian Codreanu, Anthony Ephremides. 1583-1587 [doi]
• Opportunistic downlink interference alignmentHyun Jong Yang, Won-Yong Shin, Bang Chul Jung, Changho Suh, Arogyaswami Paulraj. 1588-1592 [doi]
• Degrees of freedom of uplink-downlink multiantenna cellular networksSang-Woon Jeon, Changho Suh. 1593-1597 [doi]
• Cellular interference alignmentVasileios Ntranos, Mohammad Ali Maddah-Ali, Giuseppe Caire. 1598-1602 [doi]
• Enhanced interference management in heterogeneous cellular networksNarayan Prasad, Mustafa Y. Arslan, Sampath Rangarajan. 1603-1607 [doi]
• Counting balanced sequencesw/o forbidden patterns via the betheapproximation and loop calculusPascal O. Vontobel. 1608-1612 [doi]
• Enumerative modulation codes based on sliding-window substitutionsThomas Mittelholzer, Roy D. Cideciyan. 1613-1617 [doi]
• GBP-based detection and symmetric information rate for rectangular-grain TDMR modelMehrdad Khatami, Vida Ravanmehr, Bane V. Vasic. 1618-1622 [doi]
• Oblivious transfer in the bounded storage model with errorsRafael Dowsley, Felipe Lacerda, Anderson C. A. Nascimento. 1623-1627 [doi]
• Polar codes for multiple descriptionsQi Shi, Lin Song, Chao Tian, Jun Chen, Sorina Dumitrescu. 1628-1632 [doi]
• Coding for noisy write-efficient memoriesQing Li, Anxiao Andrew Jiang. 1633-1637 [doi]
• Polar coding for noisy write-once memoriesEyal En Gad, Yue Li, Jürg Kliewer, Michael Langberg, Anxiao Jiang, Jehoshua Bruck. 1638-1642 [doi]
• Polarized random variables: Maximal correlations and common informationNaveen Goela. 1643-1647 [doi]
• The induced correlations of Zadoff-Chu sequencesTae-Kyo Lee, Kyeongcheol Yang. 1648-1652 [doi]
• 2 over 2Chang-Min Cho, Ji-Youp Kim, Jong-Seon No. 1653-1657 [doi]
• Optimized markers for balancing runlength-limited sequences in optical recordingJos H. Weber, Carl H. Heymann, Hendrik C. Ferreira, Khaled A. S. Abdel-Ghaffar. 1658-1662 [doi]
• New binary sequences with good correlation based on high-order difference and interleaving techniquesMin Zeng, Yuan Luo, Guang Gong. 1663-1666 [doi]
• Bayesian properties of normalized maximum likelihood and its fast computationAndrew R. Barron, Teemu Roos, Kazuho Watanabe. 1667-1671 [doi]
• The role model estimator revisitedJossy Sayir. 1672-1676 [doi]
• Density estimation using real and artificial dataTina Felber, Michael Kohler, Adam Krzyzak. 1677-1681 [doi]
• Sorting with adversarial comparators and application to density estimationJayadev Acharya, Ashkan Jafarpour, Alon Orlitsky, Ananda Theertha Suresh. 1682-1686 [doi]
• Moderate deviations for joint source-channel coding of systems with Markovian memoryVincent Y. F. Tan, Shun Watanabe, Masahito Hayashi. 1687-1691 [doi]
• On mismatched unequal message protection for finite block length joint source-channel codingYanina Shkel, Vincent Y. F. Tan, Stark C. Draper. 1692-1696 [doi]
• Information spectrum approach to the source channel separation theoremNir Elkayam, Meir Feder. 1697-1701 [doi]
• Finite block-length gains in distributed source codingFarhad Shirani Chaharsooghi, S. Sandeep Pradhan. 1702-1706 [doi]
• Optimality of non-adaptive strategies: The case of parallel gamesGregory Demay, Peter Gazi, Ueli Maurer, Björn Tackmann. 1707-1711 [doi]
• The efficiency of optimal sampling in the random S-box modelPaul Stankovski, Lennart Brynielsson, Martin Hell. 1712-1716 [doi]
• Structural weakness of compact variants of the McEliece cryptosystemJean-Charles Faugère, Ayoub Otmani, Ludovic Perret, Frédéric de Portzamparc, Jean-Pierre Tillich. 1717-1721 [doi]
• Authentication with side informationWei Kang, Daming Cao, Nan Liu. 1722-1726 [doi]
• The capacity of the ergodic miso channel with per-antenna power constraint and an application to the fading cognitive interference channelDiana Maamari, Natasha Devroye, Daniela Tuninetti. 1727-1731 [doi]
• Performance of precoded integer-forcing for parallel Gaussian channelsOded Fischler, Uri Erez. 1732-1736 [doi]
• MAC-BC duality with linear-feedback schemesSelma Belhadj Amor, Yossef Steinberg, Michele A. Wigger. 1737-1741 [doi]
• Net degrees of freedom of decomposition schemes for the MIMO IC with delayed CSITYohan Lejosne, Dirk T. M. Slock, Yi Yuan-Wu. 1742-1746 [doi]
• A cross-layer framework for joint control and distributed sensing in agile wireless networksNicolò Michelusi, Urbashi Mitra. 1747-1751 [doi]
• Success probabilities in Gauss-Poisson networks with and without cooperationAnjin Guo, Yi Zhong, Martin Haenggi, Wenyi Zhang. 1752-1756 [doi]
• Can carriers make more profit while users save money?John Tadrous, Hesham El Gamal, Atilla Eryilmaz. 1757-1761 [doi]
• Medium access control game with an enhanced physical-link layer interfaceYanru Tang, Tiegang Zhao, Jie Luo. 1762-1766 [doi]
• Topological interference management with multiple antennasHua Sun, Syed Ali Jafar. 1767-1771 [doi]
• Resolving entanglements in topological interference management with alternating connectivitySoheil Gherekhloo, Anas Chaaban, Aydin Sezgin. 1772-1776 [doi]
• On the optimality of treating interference as noise: General message setsChunhua Geng, Hua Sun, Syed Ali Jafar. 1777-1781 [doi]
• Re-encoding reformulation and application to Welch-Berlekamp algorithmMorgan Barbier. 1782-1786 [doi]
• On the existence of MDS codes over small fields with constrained generator matricesSon Hoang Dau, Wentu Song, Chau Yuen. 1787-1791 [doi]
• Partial MDS (PMDS) and Sector-Disk (SD) codes that tolerate the erasure of two random sectorsMario Blaum, James S. Plank, Moshe Schwartz, Eitan Yaakobi. 1792-1796 [doi]
• A new progressive algebraic soft decoding algorithm for reed-solomon codesYi Lyu, Li Chen. 1797-1801 [doi]
• On the follower set graph of shifts of finite typeDaniel P. B. Chaves, Cecilio Pimentel. 1802-1806 [doi]
• On lower bounds for the Maximum Consecutive Subsums Problem and the (min, +)-convolutionEduardo Sany Laber, Wilfredo Bardales R., Ferdinando Cicalese. 1807-1811 [doi]
• On convergence of approximate message passingFrancesco Caltagirone, Lenka Zdeborová, Florent Krzakala. 1812-1816 [doi]
• Signaling with identical tokens: Upper bounds with energy constraintsChristopher Rose, I. Saira Mian. 1817-1821 [doi]
• On the proof of Lin's conjectureHonggang Hu, Shuai Shao, Guang Gong, Tor Helleseth. 1822-1826 [doi]
• Niho bent functions from quadratic o-monomialsLilya Budaghyan, Alexander Kholosha, Claude Carlet, Tor Helleseth. 1827-1831 [doi]
• New classes of quadratic bent functions in polynomial formsBaofeng Wu. 1832-1836 [doi]
• Almost perfect algebraic immune functions with good nonlinearityMeicheng Liu, Dongdai Lin. 1837-1841 [doi]
• A fast approximation algorithm for tree-sparse recoveryChinmay Hegde, Piotr Indyk, Ludwig Schmidt. 1842-1846 [doi]
• A greedy search algorithm with tree pruning for sparse signal recoveryJaeseok Lee, Suhyuk Kwon, Byonghyo Shim. 1847-1851 [doi]
• A robust R-FFAST framework for computing a k-sparse n-length DFT in O(k log n) sample complexity using sparse-graph codesSameer Pawar, Kannan Ramchandran. 1852-1856 [doi]
• The SPRIGHT algorithm for robust sparse Hadamard TransformsXiao Li, Joseph Kurata Bradley, Sameer Pawar, Kannan Ramchandran. 1857-1861 [doi]
• A parallel two-pass MDL context tree algorithm for universal source codingNikhil Krishnan, Dror Baron, Mehmet Kivanç Mihçak. 1862-1866 [doi]
• Efficient compression of monotone and m-modal distributionsJayadev Acharya, Ashkan Jafarpour, Alon Orlitsky, Ananda Theertha Suresh. 1867-1871 [doi]
• Poissonization and universal compression of envelope classesJayadev Acharya, Ashkan Jafarpour, Alon Orlitsky, Ananda Theertha Suresh. 1872-1876 [doi]
• Data-driven weak universal redundancyNarayana Prasad Santhanam, Venkat Anantharam, Aleksandar Kavcic, Wojciech Szpankowski. 1877-1881 [doi]
• Strong converse and second-order asymptotics of channel resolvabilityShun Watanabe, Masahito Hayashi. 1882-1886 [doi]
• Second-order capacities of erasure and list decodingVincent Y. F. Tan, Pierre Moulin. 1887-1891 [doi]
• The saddlepoint approximation: Unified random coding asymptotics for fixed and varying ratesJonathan Scarlett, Alfonso Martinez, Albert Guillen i Fabregas. 1892-1896 [doi]
• The third-order term in the normal approximation for singular channelsYucel Altug, Aaron B. Wagner. 1897-1901 [doi]
• Coding schemes with constant sphere-decoding complexity and high DMT performance for MIMO multiple access channels with low-rate feedbackTi-wen Tang, Hsiao-ting Tien, Hsiao-feng Francis Lu. 1902-1906 [doi]
• Multi-resolution broadcasting over the Grassmann and stiefel manifoldsMohammad Tarek Hussien, Karim G. Seddik, Ramy H. Gohary, Mohammad Shaqfeh, Hussein M. Alnuweiri, Halim Yanikomeroglu. 1907-1911 [doi]
• A space-time Tx scheme for two-cell MISO-BC with delayed CSITJhanak Parajuli, Giuseppe Abreu. 1912-1916 [doi]
• Fast lattice decodability of space-time block codesGrégory Berhuy, Nadya Markin, B. A. Sethuraman. 1917-1921 [doi]
• A simple relaying strategy for diamond networksSiddhartha Brahma, Christina Fragouli. 1922-1926 [doi]
• Efficient subnetwork selection in relay networksSiddhartha Brahma, Ayan Sengupta, Christina Fragouli. 1927-1931 [doi]
• Align-and-forward relaying for two-hop erasure broadcast channelsDavid T.-H. Kao, Mohammad Ali Maddah-Ali, Amir Salman Avestimehr. 1932-1936 [doi]
• Achievable diversity-rate tradeoff of MIMO AF relaying systems with MMSE transceiversChang-Ick Song, Cong Ling. 1937-1941 [doi]
• Identification via the broadcast channelAnnina Bracher, Amos Lapidoth. 1942-1946 [doi]
• Channels with cooperation links that may be absentYossef Steinberg. 1947-1951 [doi]
• Capacity region of the broadcast channel with two deterministic channel state componentsHyeji Kim, Abbas El Gamal. 1952-1956 [doi]
• The capacity region of a new class of K-receiver degraded compound broadcast channelsHon-Fah Chong, Ying-Chang Liang. 1957-1961 [doi]
• Codes with locality for two erasuresN. Prakash, V. Lalitha, P. Vijay Kumar. 1962-1966 [doi]
• On block security of regenerating codes at the MBR point for distributed storage systemsSon Hoang Dau, Wentu Song, Chau Yuen. 1967-1971 [doi]
• Repair locality from a combinatorial perspectiveAnyu Wang, Zhifang Zhang. 1972-1976 [doi]
• On a duality between recoverable distributed storage and index codingArya Mazumdar. 1977-1981 [doi]
• Design of unstructured and protograph-based LDPC coded continuous phase modulationTarik Benaddi, Charly Poulliat, Marie-Laure Boucheret, Benjamin Gadat, Guy Lesthievent. 1982-1986 [doi]
• Analysis of best high rate convolutional codes for faster than Nyquist turbo equalizationJohn B. Anderson, Mehdi Zeinali. 1987-1991 [doi]
• On LDPC codes for Gaussian interference channelsShahrouz Sharifi, Ahmet Korhan Tanc, Tolga M. Duman. 1992-1996 [doi]
• Improved performance of LDPC-coded MIMO systems with EP-based soft-decisionsJavier Cespedes, Pablo M. Olmos, Matilde Sánchez Fernández, Fernando Pérez-Cruz. 1997-2001 [doi]
• Estimation error guarantees for Poisson denoising with sparse and structured dictionary modelsAkshay Soni, Jarvis D. Haupt. 2002-2006 [doi]
• SUPER: Sparse signals with unknown phases efficiently recoveredSheng Cai, Mayank Bakshi, Sidharth Jaggi, Minghua Chen. 2007-2011 [doi]
• Information recovery from pairwise measurementsYuxin Chen, Andrea J. Goldsmith. 2012-2016 [doi]
• Robust and universal covariance estimation from quadratic measurements via convex programmingYuxin Chen, Yuejie Chi, Andrea J. Goldsmith. 2017-2021 [doi]
• Maximizing entropy of pickard random fields for 2×2 binary constraintsJacob Sogaard, Søren Forchhammer. 2022-2026 [doi]
• Algebraic methods of classifying directed graphical modelsHajir Roozbehani, Yury Polyanskiy. 2027-2031 [doi]
• Spatio-temporal graphical models for extreme eventsHang Yu, Liaofan Zhang, Justin Dauwels. 2032-2036 [doi]
• New sample complexity bounds for phylogenetic inference from multiple lociGautam Dasarathy, Robert D. Nowak, Sébastien Roch. 2037-2041 [doi]
• The likelihood encoder for lossy source compressionEva C. Song, Paul Cuff, H. Vincent Poor. 2042-2046 [doi]
• Random number conversion via restricted storageWataru Kumagai, Masahito Hayashi. 2047-2051 [doi]
• On scalable coding in the presence of decoder side informationEmrah Akyol, Urbashi Mitra, Ertem Tuncel, Kenneth Rose. 2052-2056 [doi]
• Source coding in the presence of exploration-exploitation tradeoffEmrah Akyol, Urbashi Mitra, Ertem Tuncel, Kenneth Rose. 2057-2061 [doi]
• Block-fading channels with delayed CSIT at finite blocklengthKasper F. Trillingsgaard, Petar Popovski. 2062-2066 [doi]
• Finite-blocklength channel coding rate under a long-term power constraintWei Yang, Giuseppe Caire, Giuseppe Durisi, Yury Polyanskiy. 2067-2071 [doi]
• Dispersion of quasi-static MIMO fading channels via Stokes' theoremWei Yang, Giuseppe Durisi, Tobias Koch, Yury Polyanskiy. 2072-2076 [doi]
• The third-order term in the normal approximation for the AWGN channelVincent Y. F. Tan, Marco Tomamichel. 2077-2081 [doi]
• Rewritable coset coding for flash memoriesYeow Meng Chee, Han Mao Kiah, Punarbasu Purkayastha. 2082-2086 [doi]
• Error correction and partial information rewriting for flash memoriesYue Li, Anxiao Andrew Jiang, Jehoshua Bruck. 2087-2091 [doi]
• Codes for high performance write and read processes in multi-level NVMsEvyatar Hemo, Yuval Cassuto. 2092-2096 [doi]
• LDPC codes for partial-erasure channels in multi-level memoriesRami Cohen, Yuval Cassuto. 2097-2101 [doi]
• Approximate capacity of the MIMO relay channelXianglan Jin, Young Han Kim. 2102-2106 [doi]
• Beyond one-way communication: Degrees of freedom of the 4-user relay MIMO Y channelChenwei Wang. 2107-2111 [doi]
• Multistage compute-and-forward with multilevel lattice codes based on product constructionsYu-Chih Huang, Krishna R. Narayanan. 2112-2116 [doi]
• Phase precoded compute-and-forward with partial feedbackAmin Sakzad, Emanuele Viterbo, Joseph Jean Boutros, Yi Hong. 2117-2121 [doi]
• Polyhedral description of the symmetrical latency capacity region of broadcast channelsAmir Salimi, Tie Liu, Shuguang Cui. 2122-2126 [doi]
• Coding schemes for discrete memoryless broadcast channels with rate-limited feedbackYoulong Wu, Michele A. Wigger. 2127-2131 [doi]
• A source-channel separation theorem with application to the source broadcast problemKia Khezeli, Jun Chen. 2132-2136 [doi]
• On the degrees-of-freedom of the 3-user MISO broadcast channel with hybrid CSITSaiDhiraj Amuru, Ravi Tandon, Shlomo Shamai. 2137-2141 [doi]
• Hierarchical coded cachingNikhil Karamchandani, Urs Niesen, Mohammad Ali Maddah-Ali, Suhas N. Diggavi. 2142-2146 [doi]
• Two-unicast is hardSudeep U. Kamath, David N. C. Tse, Chih-Chun Wang. 2147-2151 [doi]
• Linear capacity equivalence between multiple multicast and multiple unicastMing Fai Wong, Michael Langberg, Michelle Effros. 2152-2156 [doi]
• Multicast network coding and field sizesQifu Sun, Xunrui Yin, Zongpeng Li, Keping Long. 2157-2161 [doi]
• A new design framework for LT codes over noisy channelsIqbal Hussain, Ingmar Land, Terence H. Chan, Ming Xiao, Lars K. Rasmussen. 2162-2166 [doi]
• Multiple access analog fountain codesMahyar Shirvanimoghaddam, Yonghui Li, Branka Vucetic. 2167-2171 [doi]
• Successive segmentation-based coding for broadcasting over erasure channelsYao Li, Louis Tan, Ashish Khisti, Emina Soljanin. 2172-2176 [doi]
• An improved ensemble of variable-rate LDPC codes with precodingMin Zhu, Yucheng Qu, Kai Zhang, Baoming Bai, Xiao Ma. 2177-2181 [doi]
• Approximate matrix multiplication with application to linear embeddingsAnastasios T. Kyrillidis, Michail Vlachos, Anastasios Zouzias. 2182-2186 [doi]
• Performance guarantees for ReProCS - Correlated low-rank matrix entries caseJinchun Zhan, Namrata Vaswani, Chenlu Qiu. 2187-2191 [doi]
• Robust PCA with partial subspace knowledgeJinchun Zhan, Namrata Vaswani. 2192-2196 [doi]
• Information-theoretically optimal sparse PCAYash Deshpande, Andrea Montanari. 2197-2201 [doi]
• Extensions of the I-MMSE relationGuangyue Han, Jian Song. 2202-2206 [doi]
• New information-estimation results for poisson, binomial and negative binomial modelsCamilo G. Taborda, Fernando Pérez-Cruz, Dongning Guo. 2207-2211 [doi]
• Relations between information and estimation in scalar Lévy channelsJiantao Jiao, Kartik Venkat, Tsachy Weissman. 2212-2216 [doi]
• Integration by parts and representation of information functionalsIvan Nourdin, Giovanni Peccati, Yvik Swan. 2217-2221 [doi]
• Mismatched side information in wireless network compression via overhearing helpersMohsen Sardari, Ahmad Beirami, Faramarz Fekri. 2222-2226 [doi]
• A new information-theoretic lower bound for distributed function computationAolin Xu, Maxim Raginsky. 2227-2231 [doi]
• Reconsidering unique information: Towards a multivariate information decompositionJohannes Rauh, Nils Bertschinger, Eckehard Olbrich, Jürgen Jost. 2232-2236 [doi]
• A novel collusion attack on finite alphabet digital fingerprinting systemsJalal Etesami, Negar Kiyavash. 2237-2241 [doi]
• Writing on a dirty paper in the presence of jammingAmitalok J. Budkuley, Bikash Kumar Dey, Vinod M. Prabhakaran. 2242-2246 [doi]
• Correlated jamming in a Joint Source Channel Communication systemAmitalok J. Budkuley, Bikash Kumar Dey, Vinod M. Prabhakaran. 2247-2251 [doi]
• On the capacity of Write-Constrained MemoriesTetsuya Kobayashi, Hiroyoshi Morita, Akiko Manada. 2252-2256 [doi]
• When data must satisfy constraints upon writingErik Ordentlich, Ron M. Roth. 2257-2261 [doi]
• Noise modeling and capacity analysis for NAND flash memoriesQing Li, Anxiao Jiang, Erich F. Haratsch. 2262-2266 [doi]
• Similarity distances between permutationsLili Su, Farzad Farnoud, Olgica Milenkovic. 2267-2271 [doi]
• Learning structure of power-law Markov networksAbhik Kumar Das, Praneeth Netrapalli, Sujay Sanghavi, Sriram Vishwanath. 2272-2276 [doi]
• How informative are Minimum Spanning Tree algorithms?Alexey Gronskiy, Joachim M. Buhmann. 2277-2281 [doi]
• On the dispersion of dirty paper codingJonathan Scarlett. 2282-2286 [doi]
• The impact of phase fading on the dirty paper coding channelStefano Rini, Shlomo Shamai. 2287-2291 [doi]
• The modulo loss in lattice dirty-paper codingRam Zamir. 2292-2295 [doi]
• A quadratic programming relaxation approach to compute-and-forward network coding designBaojian Zhou, Wai Ho Mow. 2296-2300 [doi]
• Subspace synchronization: A network-coding approach to object reconciliationVitaly Skachek, Michael G. Rabbat. 2301-2305 [doi]
• Algorithms for computing network coding rate regions via single element extensions of matroidsJayant Apte, Congduan Li, John MacLaren Walsh. 2306-2310 [doi]
• Improving code diversity on block-fading channels by spatial couplingNajeeb ul Hassan, Michael Lentmaier, Iryna Andriyanova, Gerhard P. Fettweis. 2311-2315 [doi]
• A generalization of threshold saturation: application to spatially coupled BICM-IDKeigo Takeuchi. 2316-2320 [doi]
• Analysis of coupled scalar systems by displacement convexityRafah El-Khatib, Nicolas Macris, Tom Richardson, Rüdiger L. Urbanke. 2321-2325 [doi]
• Constructions a of lattices from number fields and division algebrasRoope Vehkalahti, Wittawat Kositwattanarerk, Frédérique E. Oggier. 2326-2330 [doi]
• Shifted inverse determinant sums and new bounds for the DMT of space-time lattice codesRoope Vehkalahti, Laura Luzzi, Jean-Claude Belfiore. 2331-2335 [doi]
• Multilevel lattices based on spatially-coupled LDPC codes with applicationsAvinash Vem, Yu-Chih Huang, Krishna R. Narayanan, Henry D. Pfister. 2336-2340 [doi]
• Bounds on the rate of superimposed codesA. G. Dyachkov, Ilya Vorobyev, N. A. Polyanskii, V. Yu. Shchukin. 2341-2345 [doi]
• Group testing with prior statisticsTongxin Li, Chun Lam Chan, Wenhao Huang, Tarik Kaced, Sidharth Jaggi. 2346-2350 [doi]
• Group testing for non-uniformly quantized adder channelsAmin Emad, Olgica Milenkovic. 2351-2355 [doi]
• Simultaneous real-time transmission of multiple Markov sources over a shared channelMehnaz Mannan, Aditya Mahajan. 2356-2360 [doi]
• Feedback can improve the second-order coding performance in discrete memoryless channelsYucel Altug, Aaron B. Wagner. 2361-2365 [doi]
• Necessary and sufficient conditions for reliability of posterior matching in arbitrary dimensionsRui Ma, Todd P. Coleman. 2366-2370 [doi]
• The optimal mechanism in differential privacyQuan Geng, Pramod Viswanath. 2371-2375 [doi]
• On arbitrarily varying wiretap channels for different classes of secrecy measuresHolger Boche, Rafael F. Schaefer, H. Vincent Poor. 2376-2380 [doi]
• On secure and reliable communications in wireless sensor networks: Towards k-connectivity under a random pairwise key predistribution schemeFaruk Yavuz, Jun Zhao 0007, Osman Yagan, Virgil D. Gligor. 2381-2385 [doi]
• Systematic codes for rank modulationSarit Buzaglo, Eitan Yaakobi, Tuvi Etzion, Jehoshua Bruck. 2386-2390 [doi]
• Perfect permutation codes with the Kendall's τ-metricSarit Buzaglo, Tuvi Etzion. 2391-2395 [doi]
• Constrained codes for rank modulationSarit Buzaglo, Eitan Yaakobi. 2396-2400 [doi]
• Equivalence for networks with adversarial stateOliver Kosut, Jörg Kliewer. 2401-2405 [doi]
• Capacity theorems for multi-functioning radiosYu Zhao, Biao Chen. 2406-2410 [doi]
• Effect of message transmission diversity on status ageClement Kam, Sastry Kompella, Anthony Ephremides. 2411-2415 [doi]
• Waterfilling theorems in the time-frequency plane for the heat channel and a related sourceEdwin Hammerich. 2416-2420 [doi]
• Recent results in continuous-time network information theoryXianming Liu, Guangyue Han. 2421-2425 [doi]
• On continuous-time white phase noise channelsLuca Barletta, Gerhard Kramer. 2426-2429 [doi]
• An improved outer bound on the storage-repair-bandwidth tradeoff of exact-repair regenerating codesBirenjith Padmakumari Sasidharan, Kaushik Senthoor, P. Vijay Kumar. 2430-2434 [doi]
• Repairable Block Failure Resilient codesGokhan Calis, Onur Ozan Koyluoglu. 2435-2439 [doi]
• On storage codes allowing partially collaborative repairsShiqiu Liu, Frédérique E. Oggier. 2440-2444 [doi]
• Non-binary LDPC codes with large alphabet sizeKoji Tazoe, Kenta Kasai, Kohichi Sakaniwa. 2445-2448 [doi]
• ADMM decoding of non-binary LDPC codes in F2mXishuo Liu, Stark C. Draper. 2449-2453 [doi]
• Quasi-cyclic LDPC codes on two arbitrary sets of a finite fieldJuane Li, Keke Liu, Shu Lin, Khaled A. S. Abdel-Ghaffar. 2454-2458 [doi]
• List decoding - Random coding exponents and expurgated exponentsNeri Merhav. 2459-2463 [doi]
• Asymptotic expansion and error exponent for two-phase feedback codes on DMCsTsung-Yi Chen, Adam R. Williamson, Richard D. Wesel. 2464-2468 [doi]
• Achievability bounds for rate-compatible codesTsung-Yi Chen, Dariush Divsalar, Richard D. Wesel. 2469-2473 [doi]
• Mutual information of contingency tables and related inequalitiesPeter Harremoës. 2474-2478 [doi]
• The Blackwell relation defines no latticeNils Bertschinger, Johannes Rauh. 2479-2483 [doi]
• Entropy for singular distributionsGeorg Pichler, Günther Koliander, Erwin Riegler, Franz Hlawatsch. 2484-2488 [doi]
• A simple class of efficient compression schemes supporting local access and editingHongchao Zhou, Da Wang, Gregory W. Wornell. 2489-2493 [doi]
• Cumulant generating function of codeword lengths in optimal lossless compressionThomas A. Courtade, Sergio Verdú. 2494-2498 [doi]
• Variable-length lossy compression and channel coding: Non-asymptotic converses via cumulant generating functionsThomas A. Courtade, Sergio Verdú. 2499-2503 [doi]
• Compression and predictive distributions for large alphabet i.i.d and Markov modelsXiao Yang, Andrew R. Barron. 2504-2508 [doi]
• Codeword or noise? Exact random coding exponents for slotted asynchronismNir Weinberger, Neri Merhav. 2509-2513 [doi]
• Second-order asymptotics for the Gaussian interference channel with strictly very strong interferenceSy-Quoc Le, Vincent Y. F. Tan, Mehul Motani. 2514-2518 [doi]
• Achievability bounds for unequal message protection at finite block lengthsYanina Y. Shkel, Vincent Y. F. Tan, Stark C. Draper. 2519-2523 [doi]
• Orthogonal designs optimize achievable dispersion for coherent MISO channelsAustin Collins, Yury Polyanskiy. 2524-2528 [doi]
• Uplink interference reduction in Large Scale Antenna SystemsAnsuman Adhikary, Alexei E. Ashikhmin, Thomas L. Marzetta. 2529-2533 [doi]
• A multicast approach for constructive interference precoding in MISO downlink channelMaha Alodeh, Symeon Chatzinotas, Björn E. Ottersten. 2534-2538 [doi]
• Mismatched multi-letter successive decoding for the multiple-access channelJonathan Scarlett, Alfonso Martinez, Albert Guillen i Fabregas. 2539-2543 [doi]
• Uplink-downlink duality for integer-forcingWenbo He, Bobak Nazer, Shlomo Shamai. 2544-2548 [doi]
• Delay-limited capacity of MIMO channels with limited feedbackErdem Koyuncu, Hamid Jafarkhani. 2549-2553 [doi]
• Noisy feedback improves the Gaussian channel reliability functionMarat V. Burnashev, Hirosuke Yamamoto. 2554-2558 [doi]
• Coding for the Gaussian channel with intermittent feedbackChristoph Bunte, Amos Lapidoth, Lars Palzer. 2559-2563 [doi]
• Outdated CSIT can achieve full DoF in heterogeneous parallel channelsJinyuan Chen, Sheng Yang, Ayfer Özgür, Andrea J. Goldsmith. 2564-2568 [doi]
• Many-broadcast channels: Definition and capacity in the degraded caseTsung-Yi Chen, Xu Chen, Dongning Guo. 2569-2573 [doi]
• Coherent, non-coherent, and mixed-CSIR broadcast channels: Multiuser degrees of freedomMohamed Fadel, Aria Nosratinia. 2574-2578 [doi]
• On the vector broadcast channel with alternating CSIT: A topological perspectiveJinyuan Chen, Petros Elia, Syed Ali Jafar. 2579-2583 [doi]
• Decoding of quasi-cyclic codes up to a new lower bound on the minimum distanceAlexander Zeh, San Ling. 2584-2588 [doi]
• Efficient maximum-likelihood decoding of linear block codes on binary memoryless channelsMichael Helmling, Eirik Rosnes, Stefan Ruzika, Stefan Scholl. 2589-2593 [doi]
• Message encoding for spread and orbit codesAnna-Lena Trautmann. 2594-2598 [doi]
• Analysis of one-step majority logic decoding under correlated data-dependent gate failuresSrdan Brkic, Predrag N. Ivanis, Bane V. Vasic. 2599-2603 [doi]
• The effect of saturation on belief propagation decoding of LDPC codesShrinivas Kudekar, Tom Richardson, Aravind R. Iyengar. 2604-2608 [doi]
• Density evolution analysis of braided convolutional codes on the erasure channelSaeedeh Moloudi, Michael Lentmaier. 2609-2613 [doi]
• Determining the convergence of variance in Gaussian belief propagation via semi-definite programmingQinliang Su, Yik-Chung Wu. 2614-2618 [doi]
• A modified sum-product algorithm over graphs with isolated short cyclesNithin Raveendran, Shayan Garani Srinivasa. 2619-2623 [doi]
• On optimal sensor collaboration topologies for linear coherent estimationSijia Liu, Makan Fardad, Swarnendu Kar, Pramod K. Varshney. 2624-2628 [doi]
• Stable grassmann manifold embedding via Gaussian random matricesHailong Shi, Hao Zhang, Gang Li, Xiqin Wang. 2629-2633 [doi]
• Asymptotic MMSE analysis under sparse representation modelingWasim Huleihel, Neri Merhav. 2634-2638 [doi]
• Markov field types and tilingsYuliy Baryshnikov, Jaroslaw Duda, Wojciech Szpankowski. 2639-2643 [doi]
• Supremus typicalitySheng Huang, Mikael Skoglund. 2644-2648 [doi]
• A generalized typicality for abstract alphabetsJunekey Jeon. 2649-2653 [doi]
• Precise best k-term approximation error analysis of ergodic processesJorge F. Silva, Milan S. Derpich. 2654-2658 [doi]
• Strong successive refinability: Sufficient conditionsAlbert No, Amir Ingber, Tsachy Weissman. 2659-2663 [doi]
• Successive refinement with common receiver reconstructionsBadri N. Vellambi, Roy Timo. 2664-2668 [doi]
• On distributed successive refinement with lossless recoveryChien-Yi Wang, Michael Gastpar. 2669-2673 [doi]
• Secure successive refinement with degraded side informationDerek Xu, Kittipong Kittichokechai, Tobias J. Oechtering, Mikael Skoglund. 2674-2678 [doi]
• Variable-length compression allowing errorsVictoria Kostina, Yury Polyanskiy, Sergio Verdú. 2679-2683 [doi]
• An information-spectrum approach to weak variable-length Slepian-Wolf codingShigeaki Kuzuoka, Shun Watanabe. 2684-2688 [doi]
• New results on third-order coding rate for universal fixed-to-variable source codingOliver Kosut, Lalitha Sankar. 2689-2693 [doi]
• Flexible backhaul design and degrees of freedom for linear interference networksAly El Gamal, Venugopal V. Veeravalli. 2694-2698 [doi]
• Multivariate backhaul compression for the downlink of cloud radio access networksSeok-Hwan Park, Osvaldo Simeone, Onur Sahin, Shlomo Shamai. 2699-2703 [doi]
• Multihop backhaul compression for the uplink of cloud radio access networksSeok-Hwan Park, Osvaldo Simeone, Onur Sahin, Shlomo Shamai. 2704-2708 [doi]
• Scalability of line-of-sight massive MIMO mesh networks for wireless backhaulHarpreet S. Dhillon, Giuseppe Caire. 2709-2713 [doi]
• The degrees of freedom of the K-pair-user full-duplex two-way interference channel with a MIMO relayZhiyu Cheng, Natasha Devroye. 2714-2718 [doi]
• On the achievable rates of pairwise multiway relay channelsReza Rafie Borujeny, Moslem Noori, Masoud Ardakani. 2719-2723 [doi]
• Mutual information based resource allocation in the two-way relay channel with OFDMStephan Schedler, Volker Kuehn. 2724-2728 [doi]
• Approaching the capacity of two-way gaussian relay channel with relay private messagesLeila Ghabeli, Milan S. Derpich. 2729-2733 [doi]
• On the capacity region of the two-user Interference ChannelReza Khosravi-Farsani. 2734-2738 [doi]
• On the achievable sum rate of Gaussian interference channel via Gaussian signalingZhengchuan Chen, Pingyi Fan, Dapeng Oliver Wu, Yunquan Dong, Khaled Ben Letaief. 2739-2743 [doi]
• On the corner points of the capacity region of a two-user Gaussian interference channelIgal Sason. 2744-2748 [doi]
• Sliding-window superposition coding for interference networksLele Wang, Eren Sasoglu, Young Han Kim. 2749-2753 [doi]
• Multipermutation codes in the Ulam metricFarzad Farnoud, Olgica Milenkovic. 2754-2758 [doi]
• Codes correcting erasures and deletions for rank modulationRyan Gabrys, Eitan Yaakobi, Farzad Farnoud, Jehoshua Bruck. 2759-2763 [doi]
• Single-deletion-correcting codes over permutationsRyan Gabrys, Eitan Yaakobi, Farzad Farnoud, Frederic Sala, Jehoshua Bruck, Lara Dolecek. 2764-2768 [doi]
• Deletions in multipermutationsFrederic Sala, Ryan Gabrys, Lara Dolecek. 2769-2773 [doi]
• LDPC convolutional codes versus QC LDPC block codes in communication standard scenariosIrina E. Bocharova, Boris D. Kudryashov, Rolf Johannesson. 2774-2778 [doi]
• Design of non-precoded protograph-based LDPC codesHironori Uchikawa. 2779-2783 [doi]
• Recovering the interleaver of an unknown turbo-codeJean-Pierre Tillich, Audrey Tixier, Nicolas Sendrier. 2784-2788 [doi]
• Notes on the pseudoredundancyZihui Liu, Jens Zumbrägel, Marcus Greferath, Xin-Wen Wu. 2789-2793 [doi]
• On shaping gain in the nonlinear fiber-optic channelRonen Dar, Meir Feder, Antonio Mecozzi, Mark Shtaif. 2794-2798 [doi]
• Capacity of optical communication in loss and noise with general quantum Gaussian receiversMasahiro Takeoka, Saikat Guha. 2799-2803 [doi]
• Spatially periodic signals for fiber channelsQun Zhang, Terence H. Chan, Alex J. Grant. 2804-2808 [doi]
• On the limits of communication over optical on-off keying channels with crosstalkHongchao Zhou, Gregory W. Wornell. 2809-2813 [doi]
• Proving and disproving information inequalitiesSiu-Wai Ho, Chee-Wei Tan, Raymond W. Yeung. 2814-2818 [doi]
• Computations of linear rank inequalities on six variablesRandall Dougherty. 2819-2823 [doi]
• Entropy inequalities for sums over several subsets and their applications to average entropyYuta Kishi, Nozomu Ochiumi, Masahiro Yanagida. 2824-2828 [doi]
• A lower bound on the Rényi entropy of convolutions in the integersLiyao Wang, Jae Oh Woo, Mokshay M. Madiman. 2829-2833 [doi]
• Distortion rate function of cyclo-stationary Gaussian processesAlon Kipnis, Andrea J. Goldsmith. 2834-2838 [doi]
• Compression for quadratic similarity queries via shape-gain quantizersSteffen Dempfle, Fabian Steiner, Amir Ingber, Tsachy Weissman. 2839-2843 [doi]
• The Gaussian rate-distortion function of sparse regression codes with optimal encodingRamji Venkataramanan, Sekhar Tatikonda. 2844-2848 [doi]
• The rate-information trade-off for Gaussian vector channelsAndreas Winkelbauer, Stefan Farthofer, Gerald Matz. 2849-2853 [doi]
• Is "Shannon-capacity of noisy computing" zero?Pulkit Grover. 2854-2858 [doi]
• A universal decoder relative to a given family of metricsNir Elkayam, Meir Feder. 2859-2863 [doi]
• A generalization of Witsenhausen's zero-error rate for directed graphsGábor Simonyi, Ágnes Tóth. 2864-2868 [doi]
• On the capacity of memoryless adversaryArya Mazumdar. 2869-2873 [doi]
• Single-letter characterization of epsilon-capacity for mixed memoryless channelsHideki Yagi, Ryo Nomura. 2874-2878 [doi]
• On the symbol error rate of M-ary MPSK over generalized fading channels with additive Laplacian noiseHamza Soury, Mohamed-Slim Alouini. 2879-2883 [doi]
• Scrutinizing the average error probability for Nakagami fading channelsGholamreza Alirezaei, Rudolf Mathar. 2884-2888 [doi]
• Fundamental limits in correlated fading MIMO broadcast channels: Benefits of transmit correlation diversityJunyoung Nam. 2889-2893 [doi]
• On the outage capacity of the block fading channel at low-power regimeZouheir Rezki, Mohamed-Slim Alouini. 2894-2898 [doi]
• The capacity of three-receiver AWGN broadcast channels with receiver message side informationBehzad Asadi, Lawrence Ong, Sarah J. Johnson. 2899-2903 [doi]
• Efficient approximation of discrete memoryless channel capacitiesDavid Sutter, Peyman Mohajerin Esfahani, Tobias Sutter, John Lygeros. 2904-2908 [doi]
• Capacity approximation of memoryless channels with countable output alphabetsTobias Sutter, Peyman Mohajerin Esfahani, David Sutter, John Lygeros. 2909-2913 [doi]
• Recursions for the trapdoor channel and an upper bound on its capacityTobias Lutz. 2914-2918 [doi]
• Using convex optimization to compute channel capacity in a channel model of cochlear implant stimulationXiao Gao, David B. Grayden, Mark D. McDonnell. 2919-2923 [doi]
• The impact of dark current on the wideband Poisson channelLigong Wang, Gregory W. Wornell. 2924-2928 [doi]
• On the asynchronous cognitive MACMichal Yemini, Anelia Somekh-Baruch, Amir Leshem. 2929-2933 [doi]
• Multiple access channels with combined cooperation and partial cribbingTal Kopetz, Haim H. Permuter, Shlomo Shamai. 2934-2938 [doi]
• The feedback capacity of a class of finite state multiple access channelsJui Wu, Achilleas Anastasopoulos. 2939-2943 [doi]
• Universal error exponent for discrete asynchronous multiple access channelsLóránt Farkas, Tamás Kói. 2944-2948 [doi]
• Gaussian (dirty) multiple access channels: A compute-and-forward perspectiveJingge Zhu, Michael Gastpar. 2949-2953 [doi]
• The packing radius of a code and partitioning problems: The case for poset metricsRafael Gregorio Lucas D'Oliveira, Marcelo Firer. 2954-2958 [doi]
• Breakpoint analysis and permutation codes in generalized Kendall tau and Cayley metricsYeow Meng Chee, Van Khu Vu. 2959-2963 [doi]
• Correcting on curves and highly sound locally correctable codes of high rateYeow Meng Chee, Liyasi Wu, Chaoping Xing. 2964-2966 [doi]
• Detecting and reconstructing an unknown convolutional code by counting collisionsMarion Bellard, Jean-Pierre Tillich. 2967-2971 [doi]
• Binary successive cancellation decoding of polar codes with Reed-Solomon kernelPeter Trifonov. 2972-2976 [doi]
• Enabling complexity-performance trade-offs for successive cancellation decoding of polar codesAlexios Balatsoukas-Stimming, Georgios Karakonstantis, Andreas Burg. 2977-2981 [doi]
• Adaptive linear programming decoding of polar codesVeeresh Taranalli, Paul H. Siegel. 2982-2986 [doi]
• Enhanced belief propagation decoding of polar codes through concatenationJing Guo, Minghai Qin, Albert Guillen i Fabregas, Paul H. Siegel. 2987-2991 [doi]
• Gap to capacity in concatenated Reed-Solomon polar coding schemeDina Goldin, David Burshtein. 2992-2996 [doi]
• Subspace clustering of dimensionality-reduced dataReinhard Heckel, Michael Tschannen, Helmut Bölcskei. 2997-3001 [doi]
• Sparse blind deconvolution: What cannot be doneSunav Choudhary, Urbashi Mitra. 3002-3006 [doi]
• Simple error bounds for regularized noisy linear inverse problemsChristos Thrampoulidis, Samet Oymak, Babak Hassibi. 3007-3011 [doi]
• Discrimination on the grassmann manifold: Fundamental limits of subspace classifiersMatthew S. Nokleby, Miguel R. D. Rodrigues, A. Robert Calderbank. 3012-3016 [doi]
• The fundamental limits of stable recovery in compressed sensingGalen Reeves. 3017-3021 [doi]
• On hypercontractivity and a data processing inequalityVenkat Anantharam, Amin Aminzadeh Gohari, Sudeep Kamath, Chandra Nair. 3022-3026 [doi]
• Information theoretic validity of penalized likelihoodSabyasachi Chatterjee, Andrew R. Barron. 3027-3031 [doi]
• A deterministic annealing approach to Witsenhausen's counterexampleMustafa S. Mehmetoglu, Emrah Akyol, Kenneth Rose. 3032-3036 [doi]
• Asymptotically minimax regret for models with hidden variablesJun-ichi Takeuchi, Andrew R. Barron. 3037-3041 [doi]
• Markov neighborhood estimation with linear complexity for random fieldsZsolt Talata. 3042-3046 [doi]
• On lossy source coding with side information under the erasure distortion measureYeow-Khiang Chia, Hon-Fah Chong. 3047-3051 [doi]
• Lossy compression of exponential and laplacian sources using expansion codingHongbo Si, Onur Ozan Koyluoglu, Sriram Vishwanath. 3052-3056 [doi]
• Sampling rate distortionVinay Praneeth Boda, Prakash Narayan. 3057-3061 [doi]
• Applications of information Nonanticipative Rate Distortion FunctionPhotios Stavrou, Christos K. Kourtellaris, Charalambos D. Charalambous. 3062-3066 [doi]
• A general formula for the mismatch capacityAnelia Somekh-Baruch. 3067-3071 [doi]
• Input-constrained erasure channels: Mutual information and capacityYonglong Li, Guangyue Han. 3072-3076 [doi]
• A cauchy input achieves the capacity of a Cauchy channel under a logarithmic constraintJihad Fahs, Ibrahim C. Abou-Faycal. 3077-3081 [doi]
• Bounding techniques for the intrinsic uncertainty of channelsOr Ordentlich, Ofer Shayevitz. 3082-3086 [doi]
• Multi-terminal joint transceiver design for MIMO systems with contaminated source and individual power constraintYang Liu 0017, Tiffany Jing Li, Xuanxuan Lu. 3087-3091 [doi]
• Interference mitigation and signal enhancement for K-user MIMO interference channelsXiaohu Shang. 3092-3096 [doi]
• Distributed optimization in multi-user MIMO systems with imperfect and delayed informationPierre Coucheney, Bruno Gaujal, Panayotis Mertikopoulos. 3097-3101 [doi]
• Performance estimates of the pseudo-random method for radar detectionAlexander Fish, Shamgar Gurevich. 3102-3106 [doi]
• On the design and throughput analysis of a new MME detector using Bartlett's methodEbtihal H. G. Yousif, Tharmalingam Ratnarajah. 3107-3111 [doi]
• Wyner's common information in Gaussian channelsPengfei Yang, Biao Chen. 3112-3116 [doi]
• CSI is not needed for optimal scaling in multiuser massive SIMO systemsAlexandros Manolakos, Mainak Chowdhury, Andrea J. Goldsmith. 3117-3121 [doi]
• Collaboration gain in MAC is limitedUri Mendlovic, Meir Feder. 3122-3126 [doi]
• Many-access channels: The Gaussian case with random user activitiesXu Chen, Dongning Guo. 3127-3131 [doi]
• On the power of cooperation: Can a little help a lot?Parham Noorzad, Michelle Effros, Michael Langberg, Tracey Ho. 3132-3136 [doi]
• Distance enumerator analysis for multi-user codesGuanghui Song, Jun Cheng. 3137-3141 [doi]
• New asymptotic metrics for relative generalized Hamming weightRyutaroh Matsumoto. 3142-3144 [doi]
• Exponential sum from half quadratic forms and its applicationWenbing Chen, Jinquan Luo, Yuansheng Tang. 3145-3149 [doi]
• Families of Optimal Binary Non-MDS Erasure CodesDanilo Gligoroski, Katina Kralevska. 3150-3154 [doi]
• An upper bound on the minimum distance of array low-density parity-check codesEirik Rosnes, Marcel Adrian Ambroze, Martin Tomlinson. 3155-3159 [doi]
• On the upper bound on undetected error probability for LDPC codePavel Rybin, Victor V. Zyablov. 3160-3164 [doi]
• On the error-correcting capabilities of low-complexity decoded irregular LDPC codesPavel Rybin. 3165-3169 [doi]
• Lower bounds on the error probability of turbo codesAyça Özçelikkale, Tolga M. Duman. 3170-3174 [doi]
• A case for orthogonal measurements in linear inverse problemsSamet Oymak, Babak Hassibi. 3175-3179 [doi]
• 1-minimization for dictionary learningQuan Geng, John Wright. 3180-3184 [doi]
• Analysis of regularized LS reconstruction and random matrix ensembles in compressed sensingMikko Vehkaperä, Yoshiyuki Kabashima, Saikat Chatterjee. 3185-3189 [doi]
• Online parallel monitoring via hard-thresholding post-change estimationYuan Wang, Yajun Mei. 3190-3194 [doi]
• The Cognitive Compressive Sensing problemSaeed Bagheri, Anna Scaglione. 3195-3199 [doi]
• Sublinear algorithms for outlier detection and generalized closeness testingJayadev Acharya, Ashkan Jafarpour, Alon Orlitsky, Ananda Theertha Suresh. 3200-3204 [doi]
• Universal sequential outlier hypothesis testingYun Li, Sirin Nitinawarat, Venugopal V. Veeravalli. 3205-3209 [doi]