Abstract is missing.
- Systematic lossy source transmission over Gaussian time-varying channelsInaki Estella Aguerri, Deniz Gündüz. 1-5 [doi]
- On zero delay source-channel coding: Functional properties and linearity conditionsEmrah Akyol, Kumar Viswanatha, Kenneth Rose, Tor A. Ramstad. 6-10 [doi]
- Gaussian HDA coding with bandwidth expansion and side information at the decoderErman Koken, Ertem Tuncel. 11-15 [doi]
- Dynamic joint source-Channel coding with feedbackTara Javidi, Andrea Goldsmith. 16-20 [doi]
- Bursty interference channel with feedbackI-Hsiang Wang, Changho Suh, Suhas N. Diggavi, Pramod Viswanath. 21-25 [doi]
- Interference channel with intermittent feedbackCan Karakus, I-Hsiang Wang, Suhas N. Diggavi. 26-30 [doi]
- Interactive interference alignmentQuan Geng, Sreeram Kannan, Pramod Viswanath. 31-35 [doi]
- Feedback can increase the degrees of freedom of the rank-deficient interference channelSung Ho Chae, Changho Suh, Sae-Young Chung. 36-40 [doi]
- Convexity of error rates in digital communications under non-Gaussian noiseSergey Loyka, Victoria Kostina, François Gagnon. 41-45 [doi]
- Generalizing the sampling property of the Q-function for Error Rate analysis of cooperative communication in fading channelsTugcan Aktas, Ali Özgür Yilmaz, Emre Aktas. 46-50 [doi]
- Exact symbol error probability of square M-QAM signaling over generalized fading channels subject to additive generalized Gaussian noiseHamza Soury, Ferkan Yilmaz, Mohamed-Slim Alouini. 51-55 [doi]
- Exact capture probability analysis of GSC receivers over i.n.d. Rayleigh fading channelsSung Sik Nam, Hong-Chuan Yang, Mohamed-Slim Alouini, Dong In Kim. 56-60 [doi]
- Random threshold graphs with exponential fitness: The width of the phase transition for connectivityArmand M. Makowski, Osman Yagan. 61-65 [doi]
- Age of information under random updatesClement Kam, Sastry Kompella, Anthony Ephremides. 66-70 [doi]
- Anonymity of a buffer constrained chaum mix: Optimal strategy and asymptoticsAbhishek Mishra, Parv Venkitasubramaniam. 71-75 [doi]
- Optimized relay-route assignment for anonymity in wireless networksChouchang Yang, Basel Alomair, Radha Poovendran. 76-80 [doi]
- Superposition codes for mismatched decodingJonathan Scarlett, Alfonso Martinez, Albert Guillen i Fabregas. 81-85 [doi]
- The mismatched multiple-access channel: General alphabetsJonathan Scarlett, Alfonso Martinez, Albert Guillen i Fabregas. 86-90 [doi]
- The zero-undetected-error capacity of the low-noise cyclic triangle channelChristoph Bunte, Amos Lapidoth, Alex Samorodnitsky. 91-95 [doi]
- On coding schemes for channels with mismatched decodingAnelia Somekh-Baruch. 96-100 [doi]
- Achieving Bayes MMSE performance in the sparse signal + Gaussian white noise model when the noise level is unknownDavid Donoho, Galen Reeves. 101-105 [doi]
- Almost lossless analog signal separationDavid Stotz, Erwin Riegler, Helmut Bölcskei. 106-110 [doi]
- From compression to compressed sensingShirin Jalali, Arian Maleki. 111-115 [doi]
- The minimax noise sensitivity in compressed sensingGalen Reeves, David Donoho. 116-120 [doi]
- On cyclic DNA codesKenza Guenda, T. Aaron Gulliver, Patrick Solé. 121-125 [doi]
- Generalizing bounds on the minimum distance of cyclic codes using cyclic product codesAlexander Zeh, Antonia Wachter-Zeh, Maximilien Gadouleau, Sergey Bezzateev. 126-130 [doi]
- Low-complexity encoding of binary quasi-cyclic codes based on Galois Fourier transformLi Tang, Qin Huang, Zulin Wang, Zixiang Xiong. 131-135 [doi]
- Upper bounds on the size of grain-correcting codesNavin Kashyapt, Gilles Zemori. 136-140 [doi]
- On efficient second-order spectral-null codes using sets of m1-balancing functionsRaffaele Mascella, Danilo Pelusi, Laura Pezza, Samir Elmougy, Luca G. Tallini, Bella Bose. 141-145 [doi]
- Pseudo-ternary run-length limited spectrum shaped codesOleg Kurmaev, Yanxing Zeng, Sergei Fedorenko, Vladimir Ivanov, Jianqiang Shen. 146-150 [doi]
- Hamming-weight constrained coded arrays based on covering codesErik Ordentlich, Ron M. Roth. 151-155 [doi]
- Sneak-path constraints in memristor crossbar arraysYuval Cassuto, Shahar Kvatinsky, Eitan Yaakobi. 156-160 [doi]
- On simultaneous min-entropy smoothingLukas Drescher, Omar Fawzi. 161-165 [doi]
- Achieving the Holevo capacity of a pure state classical-quantum channel via unambiguous state discriminationMasahiro Takeoka, Hari Krovi, Saikat Guha. 166-170 [doi]
- Towards a strong converse for the quantum capacity (of degradable channels)Ciara Morgan, Andreas Winter. 171-175 [doi]
- Capacities of Gaussian classical-quantum channelsAlexander S. Holevo. 176-180 [doi]
- Gaussian state amplification with noisy state observationsBernd Bandemer, Chao Tian, Shlomo Shamai. 181-185 [doi]
- Information embedding on actionsBehzad Ahmadi, Himanshu Asnani, Osvaldo Simeone, Haim H. Permuter. 186-190 [doi]
- Bit-error resilient index assignment for multiple description scalar quantizersSorina Dumitrescu, Yinghan Wan. 191-195 [doi]
- Network compression: Worst-case analysisHimanshu Asnani, Ilan Shomorony, Amir Salman Avestimehr, Tsachy Weissman. 196-200 [doi]
- Optimum transmission through the Gaussian multiple access channelDaniel Calabuig, Ramy H. Gohary, Halim Yanikomeroglu. 201-205 [doi]
- CSMA using the Bethe approximation for utility maximizationSeYoung Yun, Jinwoo Shin, Yung Yi. 206-210 [doi]
- On a multiple-access in a vector disjunctive channelAlexey Frolov, Victor V. Zyablov, Vladimir Sidorenko, Robert Fischer. 211-215 [doi]
- Riemannian-geometric optimization methods for MIMO multiple access channelsPanayotis Mertikopoulos, Aris L. Moustakas. 216-220 [doi]
- Refined bounds on the empirical distribution of good channel codes via concentration inequalitiesMaxim Raginsky, Igal Sason. 221-225 [doi]
- Which Boolean functions are most informative?Gowtham R. Kumar, Thomas A. Courtade. 226-230 [doi]
- Lovász's theta function, Rényi's divergence and the sphere-packing boundMarco Dalai. 231-235 [doi]
- Equivalence of two proof techniques for non-shannon-type inequalitiesTarik Kaced. 236-240 [doi]
- On the capacity of picocellular networksDinesh Ramasamy, Radhakrishna Ganti, Upamanyu Madhow. 241-245 [doi]
- Optimal wireless scheduling with interference cancellationMustafa Riza Akdeniz, Sundeep Rangan. 246-250 [doi]
- The aggregate throughput in random wireless networks with successive interference cancellationXinchen Zhang, Martin Haenggi. 251-255 [doi]
- Delay scaling in poisson networksMartin Haenggi. 256-260 [doi]
- Unsupervised learning and universal communicationVinith Misra, Tsachy Weissman. 261-265 [doi]
- Codes for limited view adversarial channelsReihaneh Safavi-Naini, Pengwei Wang. 266-270 [doi]
- On AVCs with quadratic constraintsFarzin Haddadpour, Mahdi Jafari Siavoshani, Mayank Bakshi, Sidharth Jaggi. 271-275 [doi]
- Coding with encoding uncertaintyJad Hachem, I-Hsiang Wang, Christina Fragouli, Suhas N. Diggavi. 276-280 [doi]
- An upper bound on the capacity of vector dirty paper with unknown spin and stretchDavid T.-H. Kao, Ashutosh Sabharwal. 281-285 [doi]
- Time invariant error bounds for modified-CS based sparse signal sequence recoveryJinchun Zhan, Namrata Vaswani. 286-290 [doi]
- Distortion-based achievability conditions for joint estimation of sparse signals and measurement parameters from undersampled acquisitionsMehmet Akçakaya, Vahid Tarokh. 291-295 [doi]
- Lower bounds for quantized matrix completionMary Wootters, Yaniv Plan, Mark A. Davenport, Ewout van den Berg. 296-300 [doi]
- SRL1: Structured reweighted ℓ1 minimization for compressive sampling of videosSheng Wang, Behzad Shahrasbi, Nazanin Rahnavard. 301-305 [doi]
- Multiply constant weight codesZouha Cherif, Jean-Luc Danger, Sylvain Guilley, Jon-Lark Kim, Patrick Solé. 306-310 [doi]
- Single-track Gray codes with non-k-spaced headsFan Zhang, Hengjun Zhu. 311-315 [doi]
- A reduced-complexity algorithm for polynomial interpolationYuan Zhu, Siyun Tang. 316-320 [doi]
- Optimal codes in the Enomoto-Katona spaceYeow Meng Chee, Han Mao Kiah, Hui Zhang 0004, Xiande Zhang. 321-325 [doi]
- Array BP-XOR codes for reliable cloud storage systemsYongge Wang. 326-330 [doi]
- A piggybacking design framework for read-and download-efficient distributed storage codesK. V. Rashmi, Nihar B. Shah, Kannan Ramchandran. 331-335 [doi]
- Characterizations and construction methods for linear functional-repair storage codesHenk D. L. Hollmann, Wencin Poh. 336-340 [doi]
- A ZigZag-decodable code with the MDS property for distributed storage systemsChi Wan Sung, Xueqing Gong. 341-345 [doi]
- Short random circuits define good quantum error correcting codesWinton Brown, Omar Fawzi. 346-350 [doi]
- Improved asymptotic key rate of the B92 protocolRyutaroh Matsumoto. 351-353 [doi]
- Efficient quantum channel coding scheme requiring no preshared entanglementDavid Sutter, Joseph M. Renes, Frédéric Dupuis, Renato Renner. 354-358 [doi]
- Adaptive pulse-position modulation for high-dimensional quantum key distributionHongchao Zhou, Gregory W. Wornell. 359-363 [doi]
- Sending a bivariate Gaussian source over a Gaussian MAC with unidirectional conferencing encodersShraga I. Bross, Yaron Laufer. 364-368 [doi]
- Joint source-channel coding for Multiple-Access Wiretap ChannelsSadaf Salehkalaibar, Mohammad Reza Aref. 369-373 [doi]
- Random access and source-channel coding error exponents for Multiple Access ChannelsLóránt Farkas, Tamás Kói. 374-378 [doi]
- Time-asynchronous Gaussian multiple access channel with correlated sourcesHamidreza Ebrahimzadeh Saffar, Patrick Mitran. 379-383 [doi]
- Finding the number of feasible solutions for linear interference alignment problemsOscar Gonzalez, Ignacio Santamaría, Carlos Beltrán. 384-388 [doi]
- Opportunistic interference management for multicarrier systemsShaunak Mishra, I-Hsiang Wang, Suhas N. Diggavi. 389-393 [doi]
- Impact of topology on interference networks with no CSITNavid Naderializadeh, Amir Salman Avestimehr. 394-398 [doi]
- Topological interference management with alternating connectivityHua Sun, Chunhua Geng, Syed A. Jafar. 399-403 [doi]
- Information geometry in mathematical finance: Model risk, worst and almost worst scenariosThomas Breuer, Imre Csiszár. 404-408 [doi]
- Information theoretic measures of distances and their econometric applicationsFerdinando Cicalese, Luisa Gargano, Ugo Vaccaro. 409-413 [doi]
- Entropy bounds for discrete random variables via couplingIgal Sason. 414-418 [doi]
- Logarithmic Sobolev inequalities and strong data processing theorems for discrete channelsMaxim Raginsky. 419-423 [doi]
- Large-scale ad hoc networks with rate-limited infrastructure: Information-theoretic operating regimesCheol Jeong, Won-Yong Shin. 424-428 [doi]
- Cooperative unicasting in large wireless networksAndres Altieri, Leonardo Rey Vega, Cecilia G. Galarza, Pablo Piantanida. 429-433 [doi]
- Telescopic beamforming for large wireless networksAlla Merzakreeva, Olivier Lévêque, Ayfer Özgür. 434-438 [doi]
- Large-system analysis of the K-hop AF MIMO relay channel with arbitrary inputsMaksym A. Girnyk, Mikko Vehkaperä, Lars K. Rasmussen. 439-443 [doi]
- Minimax filtering regret via relations between information and estimationAlbert No, Tsachy Weissman. 444-448 [doi]
- Pointwise relations between information and estimation in the Poisson channelJiantao Jiao, Kartik Venkat, Tsachy Weissman. 449-453 [doi]
- Generalized Bregman divergence and gradient of mutual information for vector Poisson channelsLiming Wang, Miguel R. D. Rodrigues, Lawrence Carin. 454-458 [doi]
- On information-Estimation relationships over binomial and negative binomial modelsDongning Guo. 459-463 [doi]
- Computing a k-sparse n-length Discrete Fourier Transform using at most 4k samples and O(k log k) complexitySameer Pawar, Kannan Ramchandran. 464-468 [doi]
- Randomized recovery for boolean compressed sensingMitra Fatemi, Martin Vetterli. 469-473 [doi]
- Reconstruction guarantee analysis of binary measurement matrices based on girthXin-Ji Liu, Shu-Tao Xia. 474-478 [doi]
- Constructions of quasi-cyclic measurement matrices based on array codesXin-Ji Liu, Shu-Tao Xia. 479-483 [doi]
- On frames from abelian group codesMatthew Thill, Babak Hassibi. 484-488 [doi]
- Explicit constructions of quasi-uniform codes from groupsEldho K. Thomas, Frédérique E. Oggier. 489-493 [doi]
- Coding for the Lee and Manhattan metrics with weighing matricesTuvi Etzion, Alexander Vardy, Eitan Yaakobi. 494-498 [doi]
- Complexity of dependencies in bounded domains, Armstrong Codes, and generalizationsYeow Meng Chee, Hui Zhang 0004, Xiande Zhang. 499-503 [doi]
- Explicit MBR all-symbol locality codesGovinda M. Kamath, Natalia Silberstein, N. Prakash, Ankit Singh Rawat, V. Lalitha, Onur Ozan Koyluoglu, P. Vijay Kumar, Sriram Vishwanath. 504-508 [doi]
- Rank metric and Gabidulin codes in characteristic zeroDaniel Augot, Pierre Loidreau, Gwezheneg Robert. 509-513 [doi]
- New lower bounds for constant dimension codesNatalia Silberstein, Anna-Lena Trautmann. 514-518 [doi]
- Bounds on polynomial-time list decoding of rank metric codesAntonia Wachter-Zeh. 519-523 [doi]
- Quantum stabilizer codes from difference setsYixuan Xie, Jinhong Yuan, Robert A. Malaney. 524-528 [doi]
- Stabilizer formalism for generalized concatenated quantum codesYun-Jiang Wang, Bei Zeng, Markus Grassl, Barry C. Sanders. 529-533 [doi]
- Leveraging automorphisms of quantum codes for fault-tolerant quantum computationMarkus Grassl, Martin Roetteler. 534-538 [doi]
- Gaussian sensor networks with adversarial nodesEmrah Akyol, Kenneth Rose, Tamer Basar. 539-543 [doi]
- Hybrid digital-analog coding for interference broadcast channelsAhmad Abou Saleh, Fady Alajaji, Wai-Yip Chan. 544-548 [doi]
- On necessary conditions for multiple-access-relay channels with correlated sourcesYonathan Murin, Ron Dabora, Deniz Gündüz. 549-553 [doi]
- Optimal multiresolution quantization with error detecting codes for broadcast channelsJames Ho, En-Hui Yang. 554-558 [doi]
- Outer bounds for multiterminal source coding via a strong data processing inequalityThomas A. Courtade. 559-563 [doi]
- Multiple-antenna interference channel with receive antenna joint processing and real interference alignmentMahdi Zamanighomi, Zhengdao Wang. 564-568 [doi]
- CSIT sharing over finite capacity backhaul for spatial interference alignmentMohsen Rezaee, Maxime Guillaud, Fredrik Lindqvist. 569-573 [doi]
- Integer-forcing interference alignmentVasileios Ntranos, Viveck R. Cadambe, Bobak Nazer, Giuseppe Caire. 574-578 [doi]
- Feasibility conditions of interference alignment via two orthogonal subcarriersStefan Dierks, Gerhard Kramer, Wolfgang Zirwas. 579-583 [doi]
- Ergodic interference alignment with noisy channel state informationHamed Farhadi, Majid Nasiri Khormuji, Chao Wang, Mikael Skoglund. 584-588 [doi]
- A new entropy power inequality for integer-valued random variablesSaeid Haghighatshoar, Emmanuel Abbe, Emre Telatar. 589-593 [doi]
- nVarun Jog, Venkat Anantharam. 594-598 [doi]
- A new approach to the entropy power inequality, via rearrangementsLiyao Wang, Mokshay M. Madiman. 599-603 [doi]
- A variational perspective over an extremal entropy inequalitySangwoo Park, Erchin Serpedin, Marwa Qaraqe. 604-608 [doi]
- A new extremal entropy inequality with applicationsHon-Fah Chong, Ying-Chang Liang. 609-613 [doi]
- Pilot-based product superposition for downlink multiuser MIMOYang Li, Aria Nosratinia. 614-618 [doi]
- Joint spatial division and multiplexing - Benefits of antenna correlation in multi-user MIMOJunyoung Nam, Jae Young Ahn. 619-623 [doi]
- On the degrees of freedom of the K-user time correlated broadcast channel with delayed CSITPaul de Kerret, Xinping Yi, David Gesbert. 624-628 [doi]
- NetDoFs of the MISO broadcast channel with delayed CSIT feedback for Finite Rate of innovation channel modelsYohan Lejosne, Dirk T. M. Slock, Yi Yuan-Wu. 629-633 [doi]
- Twice-universal fixed to variable-length random number generators for finite memory sourcesGadiel Seroussi, Marcelo J. Weinberger. 634-638 [doi]
- Universal variable to fixed-length random number generators for finite memory sourcesGadiel Seroussi, Marcelo J. Weinberger. 639-643 [doi]
- Universal Bayesian measuresJoe Suzuki. 644-648 [doi]
- Universal fixed-to-variable source coding in the finite blocklength regimeOliver Kosut, Lalitha Sankar. 649-653 [doi]
- Compression for exact match identificationAmir Ingber, Thomas A. Courtade, Tsachy Weissman. 654-658 [doi]
- Phase diagram and approximate message passing for blind calibration and dictionary learningFlorent Krzakala, Marc Mézard, Lenka Zdeborová. 659-663 [doi]
- Fixed points of generalized approximate message passing with arbitrary matricesSundeep Rangan, Philip Schniter, Erwin Riegler, Alyson K. Fletcher, Volkan Cevher. 664-668 [doi]
- Sample complexity of Bayesian optimal dictionary learningAyaka Sakata, Yoshiyuki Kabashima. 669-673 [doi]
- Compressive classificationHugo Reboredo, Francesco Renna, A. Robert Calderbank, Miguel R. D. Rodrigues. 674-678 [doi]
- k-bit Hamming compressed sensingTianyi Zhou, Dacheng Tao. 679-683 [doi]
- Lattice based codes for insertion and deletion channelsLin Sok, Patrick Solé, Aslan Tchamkerten. 684-688 [doi]
- Correcting grain-errors in magnetic mediaRyan Gabrys, Eitan Yaakobi, Lara Dolecek. 689-693 [doi]
- On L1 metric asymmetric/unidirectional error control codes, constrained weight codes and σ-codesLuca G. Tallini, Bella Bose. 694-698 [doi]
- An improvement to Levenshtein's upper bound on the cardinality of deletion correcting codesDaniel Cullina, Negar Kiyavash. 699-703 [doi]
- Rank-modulation rewriting codes for flash memoriesEyal En Gad, Eitan Yaakobi, Anxiao Andrew Jiang, Jehoshua Bruck. 704-708 [doi]
- Coding schemes for multi-level channels with unknown gain and/or offsetKees A. Schouhamer Immink. 709-713 [doi]
- Adaptive threshold read algorithms in multi-level non-volatile memoriesEvyatar Hemo, Yuval Cassuto. 714-718 [doi]
- Parallel programming of rank modulationMinghai Qin, Anxiao Andrew Jiang, Paul H. Siegel. 719-723 [doi]
- Error-correcting codes for multipermutationsSarit Buzaglo, Eitan Yaakobi, Tuvi Etzion, Jehoshua Bruck. 724-728 [doi]
- A realizable receiver for discriminating arbitrary coherent states near the quantum limitRanjith Nair, Saikat Guha, Si-Hui Tan. 729-733 [doi]
- Arbitrarily small amounts of correlation for arbitrarily varying quantum channelsHolger Boche, Janis Nötzel. 734-738 [doi]
- Distillation of multi-party non-locality with and without partial communicationHelen Ebbe, Stefan Wolf. 739-743 [doi]
- Classical communication rates for simulating quantum resourcesAlberto Montina, Marcel Pfaffhauser, Stefan Wolf. 744-748 [doi]
- The capacity to within a constant gap of the Gaussian half-duplex relay channelMartina Cardone, Daniela Tuninetti, Raymond Knopp, Umer Salim. 749-753 [doi]
- The symmetric sum-capacity of the Gaussian half-duplex causal cognitive interference channel to within a constant gapMartina Cardone, Daniela Tuninetti, Raymond Knopp, Umer Salim. 754-758 [doi]
- The capacity region of the wireless ergodic fading Interference Channel with partial CSIT to within one bitReza Khosravi-Farsani. 759-763 [doi]
- The symmetric ergodic capacity of phase-fading interference channels to within a constant gap: 3 users in the strong and very strong regimesMichael Farag, Bobak Nazer. 764-768 [doi]
- Polarization of quasi-static fading channelsJoseph Jean Boutros, Ezio Biglieri. 769-773 [doi]
- Polarization improves E0Mine Alsan, Emre Telatar. 774-778 [doi]
- Polarization of the Rényi information dimension for single and multi terminal analog compressionSaeid Haghighatshoar, Emmanuel Abbe. 779-783 [doi]
- On the correlation between polarized BECsMani Bastani Parizi, Emre Telatar. 784-788 [doi]
- Cyclic linking networkChung Chan. 789-793 [doi]
- Euclidean information theory of networksShao-Lun Huang, Changho Suh, Lizhong Zheng. 794-798 [doi]
- Parallel linear deterministic interference channels with feedback: Combinatorial structure and separabilitySuvarup Saha, Randall A. Berry. 799-803 [doi]
- The deterministic multicast capacity of 4-node relay networksAhmed A. Zewail, Yahya Mohasseb, Mohammed Nafie, Hesham El Gamal. 804-808 [doi]
- Multi-lane vehicle-to-vehicle networks with time-varying radio ranges: Information propagation speed propertiesEmmanuel Baccelli, Philippe Jacquet, Bernard Mans, Georgios Rodolakis. 809-813 [doi]
- Optimal distributed broadcasting with per-neighbor queues in acyclic overlay networks with arbitrary underlay capacity constraintsShaoquan Zhang, Minghua Chen, Zongpeng Li, Longbo Huang. 814-818 [doi]
- On hybrid access for cognitive radio systems with time-varying connectivityJeongho Jeon, Anthony Ephremides, Marian Codreanu, Matti Latva-aho. 819-823 [doi]
- Mobile conductance and gossip-based information spreading in mobile networksHuazi Zhang, Zhaoyang Zhang 0001, Huaiyu Dai. 824-828 [doi]
- Output statistics of MIMO channels with general input distributionGiuseppa Alfano, Carla-Fabiana Chiasserini, Alessandro Nordio, S. Zhou. 829-833 [doi]
- Spatial degrees of freedom of MIMO systems in line-of-sight environmentMarc Desgroseilliers, Olivier Lévêque, Emmanuel Preissmann. 834-838 [doi]
- Large deviation approach to the outage optical MIMO capacityApostolos Karadimitrakis, Aris L. Moustakas. 839-843 [doi]
- Power optimization on a random wireless networkAris L. Moustakas, Nicholas Bambos. 844-848 [doi]
- Oblique pursuits for compressed sensing with random anisotropic measurementsKiryung Lee, Yoram Bresler, Marius Junge. 849-853 [doi]
- Sparse signal recovery via multipath matching pursuitSuhyuk Kwon, Jian Wang, Byonghyo Shim. 854-858 [doi]
- Relation between exact and robust recovery for F-minimization: A topological viewpointJingbo Liu, Jian Jin, Yuantao Gu. 859-863 [doi]
- Recursive sparse recovery in large but structured noise - Part 2Chenlu Qiu, Namrata Vaswani. 864-868 [doi]
- Biembeddings of small order hamming STS(n) and APN monomial power permutationsJosep Rifà, Faina I. Solov'eva, Mercè Villanueva. 869-873 [doi]
- Sequence reconstruction for Grassmann graphs and permutationsEitan Yaakobi, Moshe Schwartz, Michael Langberg, Jehoshua Bruck. 874-878 [doi]
- Rank spectrum of propelinear perfect binary codesGeorge K. Guskov, Ivan Yu. Mogilnykh, Faina I. Solov'eva. 879-881 [doi]
- Generalised Multi-sequence Shift-Register synthesis using module minimisationJohan S. R. Nielsen. 882-886 [doi]
- Repair-optimal MDS array codes over GF(2)Eyal En Gad, Robert Mateescu, Filip Blagojevic, Cyril Guyot, Zvonimir Bandic. 887-891 [doi]
- Locally repairable codes with multiple repair alternativesLluis Pamies-Juarez, Henk D. L. Hollmann, Frédérique E. Oggier. 892-896 [doi]
- Polytope codes for distributed storage in the presence of an active omniscient adversaryOliver Kosut. 897-901 [doi]
- Distributed storage allocations and a hypergraph conjecture of ErdősYi-Hsuan Kao, Alexandros G. Dimakis, Derek Leong, Tracey Ho. 902-906 [doi]
- A family of quantum codes with performances close to the hashing bound under iterative decodingDenise Maurice, Jean-Pierre Tillich, Iryna Andriyanova. 907-911 [doi]
- Subsystem codes over nice nearringsSangjun Lee, Andreas Klappenecker. 912-916 [doi]
- Tradeoffs for reliable quantum information storage in surface codes and color codesNicolas Delfosse. 917-921 [doi]
- Asymmetric quantum codes detecting a single amplitude errorMartianus Frederic Ezerman, Markus Grassl. 922-926 [doi]
- Capacity bounds for wireless ergodic fading Broadcast Channels with partial CSITReza Khosravi-Farsani. 927-931 [doi]
- The capacity region of a class of two-user degraded compound broadcast channelsHon-Fah Chong, Ying-Chang Liang. 932-936 [doi]
- On the Degrees of Freedom region of general MIMO Broadcast Channel with mixed CSITBo Yang, Desheng Wang, Jun Sun, Yingzhuang Liu. 937-941 [doi]
- Bounds on the capacity region of a class of Gaussian broadcast interference channelsYuanpeng Liu, Elza Erkip. 942-946 [doi]
- Fixed-threshold polar codesJing Guo, Albert Guillen i Fabregas, Jossy Sayir. 947-951 [doi]
- On the construction and decoding of concatenated polar codesHessam Mahdavifar, Mostafa El-Khamy, Jungwon Lee, Inyup Kang. 952-956 [doi]
- A two phase successive cancellation decoder architecture for polar codesAlptekin Pamuk, Erdal Arikan. 957-961 [doi]
- On the capacity region for index codingFatemeh Arbabjolfaei, Bernd Bandemer, Young Han Kim, Eren Sasoglu, Lele Wang. 962-966 [doi]
- An equivalence between network coding and index codingMichelle Effros, Salim Y. El Rouayheb, Michael Langberg. 967-971 [doi]
- On a capacity equivalence between network and index coding and the edge removal problemM. F. Wong, Michael Langberg, Michelle Effros. 972-976 [doi]
- The Index Coding problem: A game-theoretical perspectiveYu-Pin Hsu, I-Hong Hou, Alex Sprintson. 977-981 [doi]
- On cooperative multiple access channels with delayed CSIAbdellatif Zaidi, Shlomo Shamai. 982-986 [doi]
- Degrees of freedom of time-correlated broadcast channels with delayed CSIT: The MIMO caseXinping Yi, David Gesbert, Sheng Yang, Mari Kobayashi. 987-991 [doi]
- MISO broadcast channel with delayed and evolving CSITJinyuan Chen, Petros Elia. 992-996 [doi]
- On the fundamental feedback-vs-performance tradeoff over the MISO-BC with imperfect and delayed CSITJinyuan Chen, Sheng Yang, Petros Elia. 997-1001 [doi]
- Robust streaming erasure codes based on deterministic channel approximationsAhmed Badr, Ashish Khisti, Wai-tian Tan, John G. Apostolopoulos. 1002-1006 [doi]
- Multi-rate sequential data transmissionCheuk Ting Li, Shenghao Yang, Raymond W. Yeung. 1007-1011 [doi]
- On coding for real-time streaming under packet erasuresDerek Leong, Asma Qureshi, Tracey Ho. 1012-1016 [doi]
- Exploiting user mobility for wireless content deliveryKonstantinos Poularakis, Leandros Tassiulas. 1017-1021 [doi]
- Sparse phase retrieval: Convex algorithms and limitationsKishore Jaganathan, Samet Oymak, Babak Hassibi. 1022-1026 [doi]
- Volume ratio, sparsity, and minimaxity under unitarily invariant normsZongming Ma, Yihong Wu. 1027-1031 [doi]
- Minimax universal sampling for compound multiband channelsYuxin Chen, Andrea J. Goldsmith, Yonina C. Eldar. 1032-1036 [doi]
- Tractability of interpretability via selection of group-sparse modelsNirav Bhan, Luca Baldassarre, Volkan Cevher. 1037-1041 [doi]
- Incorrigible set distributions and unsuccessful decoding probability of linear codesYong Jiang, Shu-Tao Xia, Xin-Ji Liu, Fang-Wei Fu. 1042-1046 [doi]
- Spherically punctured Reed-Muller codesOlga Kapralova, Ilya Dumer. 1047-1051 [doi]
- On decoding Interleaved Chinese Remainder codesWenhui Li, Vladimir Sidorenko, Johan S. R. Nielsen. 1052-1056 [doi]
- Codes for network switchesZhiying Wang, Omer Shaked, Yuval Cassuto, Jehoshua Bruck. 1057-1061 [doi]
- Retired-page utilization in write-once memory - A coding perspectiveAmit Berman, Yitzhak Birk. 1062-1066 [doi]
- Joint rewriting and error correction in write-once memoriesAnxiao Andrew Jiang, Yue Li, Eyal En Gad, Michael Langberg, Jehoshua Bruck. 1067-1071 [doi]
- Constructions of multiple error correcting WOM-CodeHidetoshi Ustunomiya, Hiroshi Kamabe. 1072-1076 [doi]
- Fundamental limits of cachingMohammad Ali Maddah-Ali, Urs Niesen. 1077-1081 [doi]
- Building consensus via iterative votingFarzad Farnoud Hassanzadeh, Eitan Yaakobi, Behrouz Touri, Olgica Milenkovic, Jehoshua Bruck. 1082-1086 [doi]
- Information-theoretic study of voting systemsEitan Yaakobi, Michael Langberg, Jehoshua Bruck. 1087-1091 [doi]
- Averaging consensus over erasure channels via local synchronizationSaber Salehkaleybar, S. Jamaloddin Golestani. 1092-1096 [doi]
- On the capacity region of Gaussian interference channels with stateRuchen Duan, Yingbin Liang, Shlomo Shamai. 1097-1101 [doi]
- The GDOF of 3-user MIMO Gaussian interference channelJung Hyun Bae, Jungwon Lee, Inyup Kang. 1102-1106 [doi]
- Unified secure DoF analysis of K-user Gaussian interference channelsJianwei Xie, Sennur Ulukus. 1107-1111 [doi]
- Interference canceling power control games in Gaussian interference channelsLiang Zhou, Kalle Ruttik, Olav Tirkkonen, Randall Berry. 1112-1116 [doi]
- A new polar coding scheme for strong security on wiretap channelsEren Sasoglu, Alexander Vardy. 1117-1121 [doi]
- Successive cancellation decoding of polar codes for the two-user binary-input MACSaygun Onay. 1122-1126 [doi]
- Polar codes for broadcast channelsNaveen Goela, Emmanuel Abbe, Michael Gastpar. 1127-1131 [doi]
- Lossless polar compression of g-ary sourcesSemih Cayci, Orhan Ankan. 1132-1136 [doi]
- General index coding with side information: Three decoder caseSinem Unal, Aaron B. Wagner. 1137-1141 [doi]
- Pliable Index Coding: The multiple requests caseSiddhartha Brahma, Christina Fragouli. 1142-1146 [doi]
- The multi-sender multicast index codingLawrence Ong, Fabian Lim, Chin Keong Ho. 1147-1151 [doi]
- Local graph coloring and index codingKarthikeyan Shanmugam, Alexandros G. Dimakis, Michael Langberg. 1152-1156 [doi]
- Distributed base station cooperation with finite alphabet and QoS constraintsMin Li, Chunshan Liu, Stephen V. Hanly. 1157-1161 [doi]
- On layered transmission in clustered cooperative cellular architecturesGil Katz, Benjamin M. Zaidel, Shlomo Shamai. 1162-1166 [doi]
- SINR-based k-coverage probability in cellular networks with arbitrary shadowingHolger Paul Keeler, Bartlomiej Blaszczyszyn, Mohamed Kadhem Karray. 1167-1171 [doi]
- Robust uplink communications over fading channels with variable backhaul connectivityRoy Karasik, Osvaldo Simeone, Shlomo Shamai. 1172-1176 [doi]
- Approaching the rate-distortion limit by spatial coupling with belief propagation and decimationVahid Aref, Nicolas Macris, Marc Vuffray. 1177-1181 [doi]
- Lossy compression via sparse linear regression: Computationally efficient encoding and decodingRamji Venkataramanan, Tuhin Sarkar, Sekhar Tatikonda. 1182-1186 [doi]
- Noise-shaped quantization for nonuniform samplingAdam Mashiach, Ram Zamir. 1187-1191 [doi]
- Blahut-Arimoto algorithm and code design for action-dependent source coding problemsKasper F. Trillingsgaard, Osvaldo Simeone, Petar Popovski, Torben Larsen. 1192-1196 [doi]
- Adaptive collaborating filtering: The low noise regimeOnkar Dabeer. 1197-1201 [doi]
- Low separation rank covariance estimation using Kronecker product expansionsTheodoros Tsiligkaridis, Alfred O. Hero. 1202-1206 [doi]
- First order Markov chain approximation of microgrid renewable generators covariance matrixNavid Tafaghodi Khajavi, Anthony Kuh. 1207-1211 [doi]
- Reverse Berlekamp-Massey decodingJiun-Hung Yu, Hans-Andrea Loeliger. 1212-1216 [doi]
- Coding for combined block-symbol error correctionRon M. Roth, Pascal O. Vontobel. 1217-1221 [doi]
- Iterative soft-decision decoding of Reed-Solomon convolutional concatenated codesLi Chen, Xiao Ma. 1222-1226 [doi]
- On the dimension of graph codes with Reed-Solomon component codesPeter Beelen, Tom Høholdt, Fernando Pinero, Jørn Justesen. 1227-1231 [doi]
- Proactive Content Distribution for dynamic contentJohn Tadrous, Atilla Eryilmaz, Hesham El Gamal. 1232-1236 [doi]
- Non-homogeneous two-rack model for distributed storage systemsJaume Pernas, Chau Yuen, Bernat Gaston, Jaume Pujol. 1237-1241 [doi]
- Symmetry in distributed storage systemsSatyajit Thakor, Terence Chan, Kenneth W. Shum. 1242-1246 [doi]
- Capacity and security of heterogeneous distributed storage systemsToni Ernvall, Salini El Rouayheb, Camilla Hollanti, H. Vincent Poor. 1247-1251 [doi]
- Fundamental limits of identification: Identification rate, search and memory complexity trade-offFarzad Farhadzadeh, Frans M. J. Willems, Sviatoslav Voloshynovskiy. 1252-1256 [doi]
- Brute force searching, the typical set and GuessworkMark M. Christiansen, Ken R. Duffy, Flávio du Pin Calmon, Muriel Médard. 1257-1261 [doi]
- Two-dimensional visual searchMohammad Naghshvar, Tara Javidi. 1262-1266 [doi]
- Rate-reliability-complexity tradeoff for ML and lattice decoding of full-rate codesArun Kumar Singh, Petros Elia, Joakim Jalden. 1267-1271 [doi]
- Improved cardinality bounds on the auxiliary random variables in Marton's inner boundVenkat Anantharam, Amin Aminzadeh Gohari, Chandra Nair. 1272-1276 [doi]
- Achievable rate region for three user discrete broadcast channel based on coset codesArun Padakandla, S. Sandeep Pradhan. 1277-1281 [doi]
- Marton-Marton coding for a broadcast relay networkLanying Zhao, Sae-Young Chung. 1282-1286 [doi]
- A technique for deriving one-shot achievability results in network information theoryMohammad Hossein Yassaee, Mohammad Reza Aref, Amin Gohari. 1287-1291 [doi]
- Polar lattices: Where Arıkan meets ForneyYanfei Yan, Cong Ling, Xiaofu Wu. 1292-1296 [doi]
- Polarization theorems for arbitrary DMCsRajai Nasser, Emre Telatar. 1297-1301 [doi]
- Multilevel polar-coded modulationMathis Seidl, Andreas Schenk, Clemens Stierstorfer, Johannes B. Huber. 1302-1306 [doi]
- Controlled polarization for q-ary alphabetsWoomyoung Park, Alexander Barg. 1307-1311 [doi]
- Lattice coding for the Two-way Two-relay channelYiwei Song, Natasha Devroye, Huai-Rong Shao, Chiu Ngo. 1312-1316 [doi]
- Asymptotic sum-capacity of MIMO two-way relay channels within 1/2 log 5/4 bit per user-antennaXiaojun Yuan, Tao Yang. 1317-1321 [doi]
- Scalar Quantize-and-Forward for symmetric half-duplex Two-Way Relay ChannelsMichael Heindlmaier, Onurcan Iscan, Christopher Rosanka. 1322-1326 [doi]
- Joint opportunistic scheduling and network coding for bidirectional relay channelMohammad Shaqfeh, Ammar Zafar, Hussein M. Alnuweiri, Mohamed-Slim Alouini. 1327-1331 [doi]
- A statistical physics approach to the wiretap channelInaki Esnaola, Antonia Maria Tulino, H. Vincent Poor. 1332-1336 [doi]
- Secure degrees of freedom of the Gaussian multiple access wiretap channelJianwei Xie, Sennur Ulukus. 1337-1341 [doi]
- Capacity results, coordination resources, and super-activation in wiretap channelsHolger Boche, Rafael F. Schaefer. 1342-1346 [doi]
- Fading wiretap channel with no CSI anywherePritam Mukherjee, Sennur Ulukus. 1347-1351 [doi]
- The zero-delay Wyner-Ziv problemYonatan Kaspi, Neri Merhav. 1352-1356 [doi]
- Universal Wyner-Ziv coding for distortion constrained general side-informationShun Watanabe, Shigeaki Kuzuoka. 1357-1361 [doi]
- Distributed source coding in absence of common componentsFarhad Shirani Chaharsooghi, Aria Ghasemian Sahebi, S. Sandeep Pradhan. 1362-1366 [doi]
- On the role of common codewords in quadratic Gaussian multiple descriptions codingKumar Viswanatha, Emrah Akyol, Kenneth Rose. 1367-1371 [doi]
- A perturbation proof of the vector Gaussian one-help-one problemYinfei Xu, Qiao Wang. 1372-1376 [doi]
- Denoising as well as the best of any two denoisersErik Ordentlich. 1377-1381 [doi]
- Noisy subspace clustering via thresholdingReinhard Heckel, Helmut Bölcskei. 1382-1386 [doi]
- A universal probability assignment for prediction of individual sequencesYuval Lomnitz, Meir Feder. 1387-1391 [doi]
- Time-series information and learningDaniil Ryabko. 1392-1395 [doi]
- Least squares superposition codes with Bernoulli dictionary are still reliable at rates up to capacityYoshinari Takeishi, Masanori Kawakita, Jun-ichi Takeuchi. 1396-1400 [doi]
- On Chebyshev radius of a set in Hamming space and the closest string problemArya Mazumdar, Yury Polyanskiy, Barna Saha. 1401-1405 [doi]
- Analysis and practice of uniquely decodable one-to-one codeChin-Fu Liu, Hsiao-feng Francis Lu, Po-Ning Chen. 1406-1410 [doi]
- Efficient determination of the unique decodability of a stringArnold Filtser, Jiaxi Jin, Aryeh Kontorovich, Ari Trachtenberg. 1411-1415 [doi]
- Achieving the AWGN channel capacity with lattice Gaussian codingCong Ling, Jean-Claude Belfiore. 1416-1420 [doi]
- The secrecy capacity of minimum bandwidth cooperative regenerating codesOnur Ozan Koyluoglu, Ankit Singh Rawat, Sriram Vishwanath. 1421-1425 [doi]
- Rate region of the (4, 3, 3) exact-repair regenerating codesChao Tian. 1426-1430 [doi]
- Exact-repair regenerating codes via layered erasure correction and block designsChao Tian, Vaneet Aggarwal, Vinay A. Vaishampayan. 1431-1435 [doi]
- Update-efficient regenerating codes with minimum per-node storageYunghsiang S. Han, Hung-Ta Pai, Rong Zheng, Pramod K. Varshney. 1436-1440 [doi]
- Repairing multiple failures in the Suh-Ramchandran regenerating codesJunyu Chen, Kenneth W. Shum. 1441-1445 [doi]
- On the achievable region with point-to-point codes for generalized interference networksJung Hyun Bae, Jungwon Lee, Inyup Kang. 1446-1450 [doi]
- Information theoretic cut-set bounds on the capacity of poisson wireless networksGeorgios Rodolakis. 1451-1455 [doi]
- Lower bounding models for wireless networksJinfeng Du, Muriel Médard, Ming Xiao, Mikael Skoglund. 1456-1460 [doi]
- Optimal throughput-outage trade-off in wireless one-hop caching networksMingyue Ji, Giuseppe Caire, Andreas F. Molisch. 1461-1465 [doi]
- Multiple access channel with state uncertainty at transmittersShaofeng Zou, Yingbin Liang, Shlomo Shamai. 1466-1470 [doi]
- On the adaptive sum-capacity of fading MACs with distributed CSI and non-identical linksSreejith Sreekumar, Bikash K. Dey, Sibi Raj B. Pillai. 1471-1475 [doi]
- The capacity region of three user Gaussian inverse-compute-and-forward channelsYanying Chen, Yiwei Song, Natasha Devroye. 1476-1480 [doi]
- On Orthogonal signalling in Gaussian Multiple Access Channel with peak constraintsKamyar Moshksar, Babak Mamandipoor, Amir K. Khandani. 1481-1485 [doi]
- Linear programming decoding of spatially coupled codesLouay Bazzi, Badih Ghazi, Rüdiger L. Urbanke. 1486-1490 [doi]
- Towards combinatorial LP turbo decodingMichael Helmling, Stefan Ruzika. 1491-1495 [doi]
- Improved linear programming decoding using frustrated cyclesShrinivas Kudekar, Jason K. Johnson, Misha Chertkov. 1496-1500 [doi]
- Efficient iterative LP decoding of LDPC codes with alternating direction method of multipliersXiaojie Zhang, Paul H. Siegel. 1501-1505 [doi]
- Second order asymptotics for random number generationWataru Kumagai, Masahito Hayashi. 1506-1510 [doi]
- Fixed-to-variable length distribution matchingRana Ali Amjad, Georg Böcherer. 1511-1515 [doi]
- Extendable MDLPeter Harremoës. 1516-1520 [doi]
- Minimum description length principle for maximum entropy model selectionGaurav Pandey, Ambedkar Dukkipati. 1521-1525 [doi]
- Bounds on the second-order coding rate of the MIMO Rayleigh block-fading channelJakob Hoydis, Romain Couillet, Pablo Piantanida. 1526-1530 [doi]
- Quasi-static SIMO fading channels at finite blocklengthWei Yang, Giuseppe Durisi, Tobias Koch, Yury Polyanskiy. 1531-1535 [doi]
- A tight upper bound for the third-order asymptotics of discrete memoryless channelsMarco Tomamichel, Vincent Y. F. Tan. 1536-1540 [doi]
- Asymptotic Neyman-Pearson games for converse to the channel coding theoremPierre Moulin. 1541-1545 [doi]
- The Kraft inequality for EPS systemsChinthani Uduwerelle, Terence Chan, Siu-Wai Ho. 1546-1550 [doi]
- Exhaustive search for small dimension recursive MDS diffusion layers for block ciphers and hash functionsDaniel Augot, Matthieu Finiasz. 1551-1555 [doi]
- Unfair coin tossingGregory Demay, Ueli Maurer. 1556-1560 [doi]
- Channel upgrading for semantically-secure encryption on wiretap channelsIdo Tal, Alexander Vardy. 1561-1565 [doi]
- On degrees of freedom scaling in layered interference networks with delayed CSIMohammad Javad Abdoli, Amir Salman Avestimehr. 1566-1570 [doi]
- Degrees of freedom of completely-connected multi-way interference networksNamyoon Lee, Robert W. Heath. 1571-1575 [doi]
- Degrees of freedom for the MIMO multi-way relay channelYe Tian, Aylin Yener. 1576-1580 [doi]
- The degrees of freedom of the MIMO Y-channelAnas Chaaban, Karlheinz Ochs, Aydin Sezgin. 1581-1585 [doi]
- On optimal online power policies for energy harvesting with finite-state Markov channelsMasoud Badiei Khuzani, Hamidreza Ebrahimzadeh Saffar, Ehsan Haj Mirza Alian, Patrick Mitran. 1586-1590 [doi]
- Binary energy harvesting channel with finite energy storageKaya Tutuncuoglu, Omur Ozel, Aylin Yener, Sennur Ulukus. 1591-1595 [doi]
- Throughput maximization for energy harvesting two-hop networksOner Orhan, Elza Erkip. 1596-1600 [doi]
- Low-complexity scheduling policies for energy harvesting communication networksPol Blasco, Deniz Gündüz, Mischa Dohler. 1601-1605 [doi]
- Codes with local regenerationGovinda M. Kamath, N. Prakash, V. Lalitha, P. Vijay Kumar. 1606-1610 [doi]
- High-rate regenerating codes through layeringBirenjith Sasidharan, P. Vijay Kumar. 1611-1615 [doi]
- A new sub-packetization bound for minimum storage regenerating codesSreechakra Goparaju, A. Robert Calderbank. 1616-1620 [doi]
- BASIC regenerating code: Binary addition and shift for exact repairHanxu Hou, Kenneth W. Shum, Minghua Chen, Hui Li. 1621-1625 [doi]
- PREMIER - PRobabilistic error-correction using Markov inference in errored readsXin Yin, Zhao Song, Karin S. Dorman, Aditya Ramamoorthy. 1626-1630 [doi]
- Message passing algorithm for inferring consensus sequence from next-generation sequencing dataXiaohu Shen, Manohar Shamaiah, Haris Vikalo. 1631-1634 [doi]
- Reference-based DNA shotgun sequencing: Information theoretic limitsSoheil Mohajer, Abolfazl S. Motahari, David Tse. 1635-1639 [doi]
- Optimal DNA shotgun sequencing: Noisy reads are as good as noiseless readsAbolfazl S. Motahari, Kannan Ramchandran, David Tse, Nan Ma. 1640-1644 [doi]
- Reliable uncoded communication in the SIMO MAC via low-complexity decodingMainak Chowdhury, Andrea Goldsmith, Tsachy Weissman. 1645-1649 [doi]
- Converse coding theorems for identification via multiple access channelsYasutada Oohama. 1650-1654 [doi]
- Generalized construction of signature code for multiple-access adder channelShan Lu, Jun Cheng, Wei Hou, Yoichiro Watanabe. 1655-1659 [doi]
- Achievable rate regions of cognitive multiple access channel with sensing errorsGozde Ozcan, Mustafa Cenk Gursoy. 1660-1664 [doi]
- Distributed cognitive multiple access networks: Power control, scheduling and multiuser diversityEhsan Nekouei, Hazer Inaltekin, Subhrakanti Dey. 1665-1669 [doi]
- Minimum distance distribution of irregular generalized LDPC code ensemblesIan P. Mulholland, Mark F. Flanagan, Enrico Paolini. 1670-1674 [doi]
- New results on Construction A lattices based on very sparse parity-check matricesNicola di Pietro, Gilles Zémor, Joseph Jean Boutros. 1675-1679 [doi]
- Deterministic constructions for large girth protograph LDPC codesAsit Kumar Pradhan, Arunkumar Subramanian, Andrew Thangaraj. 1680-1684 [doi]
- Correcting combinations of errors and erasures with Euclidean geometry LDPC codesQiuju Diao, Ying Yu Tai, Shu Lin, Khaled A. S. Abdel-Ghaffar. 1685-1689 [doi]
- Asymptotic analysis of LDPC codes with depth-2 connectivity distributions over BECMin Jang, Jin Whan Kang, Jong-Hwan Kim, Sang-Hyo Kim. 1690-1694 [doi]
- Square Root approximation to the Poisson ChannelAnagnostis Tsiatmas, Frans M. J. Willems, Constant P. M. J. Baggen. 1695-1699 [doi]
- A general upper bound for FSO channel capacity with input-dependent Gaussian noise and the corresponding optimal input distributionKobra Akbari Dadamahalleh, Ghosheh Abed Hodtani. 1700-1704 [doi]
- Integrable communication channels and the nonlinear fourier transformMansoor I. Yousefi, Frank R. Kschischang. 1705-1709 [doi]
- Communication over fiber-optic channels using the nonlinear Fourier transformMansoor I. Yousefi, Frank R. Kschischang. 1710-1714 [doi]
- Quantum noise limited optical communication with low probability of detectionBoulat A. Bash, Saikat Guha, Dennis Goeckel, Don Towsley. 1715-1719 [doi]
- Converse bounds for assorted codes in the finite blocklength regimeYanina Shkel, Vincent Y. F. Tan, Stark C. Draper. 1720-1724 [doi]
- The importance of tie-breaking in finite-blocklength boundsEli Haim, Yuval Kochman, Uri Erez. 1725-1729 [doi]
- The meta-converse bound is tightGonzalo Vazquez-Vilar, Adrià Tauste Campo, Albert Guillen i Fabregas, Alfonso Martinez. 1730-1733 [doi]
- Channels with cost constraints: Strong converse and dispersionVictoria Kostina, Sergio Verdú. 1734-1738 [doi]
- Optimal lossless compression: Source varentropy and dispersionIoannis Kontoyiannis, Sergio Verdú. 1739-1743 [doi]
- Lossless compression with moderate error probabilityYucel Altug, Aaron B. Wagner, Ioannis Kontoyiannis. 1744-1748 [doi]
- On the redundancy of Huffman codes with exponential objectivesMichael B. Baer. 1749-1753 [doi]
- On antidictionary coding based on compacted substring automatonTakahiro Ota, Hiroyoshi Morita. 1754-1758 [doi]
- Almost instantaneous FV codesHirosuke Yamamoto, Xiaofeng Wei. 1759-1763 [doi]
- Two-user MISO broadcast channel: Synergistic benefits of alternating CSITRavi Tandon, Syed Ali Jafar, Shlomo Shamai, H. Vincent Poor. 1764-1768 [doi]
- Generalized degrees of freedom for network-coded cognitive interference channelSong-Nam Hong, Giuseppe Caire. 1769-1773 [doi]
- Degrees of freedom of MIMO cellular networks with two cells and two users per cellGokul Sridharan, Wei Yu. 1774-1778 [doi]
- Generalized degrees of freedom region for MIMO interference channel with feedbackMehdi Ashraphijuo, Vaneet Aggarwal, Xiaodong Wang. 1779-1783 [doi]
- Optimal scheduling for energy harvesting transmitters with hybrid energy storageOmur Ozel, Khurram Shahzad, Sennur Ulukus. 1784-1788 [doi]
- On the capacity of a communication system with energy harvesting and a limited batteryWei Mao, Babak Hassibi. 1789-1793 [doi]
- Delay-constrained distortion minimization for energy harvesting transmission over a fading channelOner Orhan, Deniz Gündüz, Elza Erkip. 1794-1798 [doi]
- Energy harvesting receivers: Finite battery capacityHajar Mahdavi-Doost, Roy D. Yates. 1799-1803 [doi]
- Quasi-cyclic regenerating codes for distributed storage: Existence and near-MSR examplesG. Vignesh, Andrew Thangaraj. 1804-1808 [doi]
- Robust multiple description coding - Joint Coding for source and storageTerence H. Chan, Siu-Wai Ho. 1809-1813 [doi]
- Optimal locally repairable codes and connections to matroid theoryItzhak Tamo, Dimitris S. Papailiopoulos, Alexandros G. Dimakis. 1814-1818 [doi]
- Optimal locally repairable codes via rank-metric codesNatalia Silberstein, Ankit Singh Rawat, Onur Ozan Koyluoglu, Sriram Vishwanath. 1819-1823 [doi]
- Energy efficient neurons with generalized inverse Gaussian conditional and marginal hitting timesJie Xing, Toby Berger. 1824-1828 [doi]
- On the capacity-achieving input for additive inverse Gaussian channelsHui Li, Dongning Guo. 1829-1833 [doi]
- Capacity of a simple intercellular signal transduction channelAndrew W. Eckford, Peter J. Thomas. 1834-1838 [doi]
- Signaling with identical tokens: Lower bounds with energy constraintsChristopher Rose, I. Saira Mian. 1839-1843 [doi]
- Relaying in diffusion-based molecular communicationArash Einolghozati, Mohsen Sardari, Faramarz Fekri. 1844-1848 [doi]
- Non-asymptotic output statistics of Random Binning and its applicationsMohammad Hossein Yassaee, Mohammad Reza Aref, Amin Gohari. 1849-1853 [doi]
- On the dispersions of the discrete memoryless interference channelSy-Quoc Le, Vincent Y. F. Tan, Mehul Motani. 1859-1863 [doi]
- An improved bound on information loss due to finite block length in a Gaussian line networkRamanan Subramanian, Badri N. Vellambi, Ingmar Land. 1864-1868 [doi]
- Coded cooperation using rate-compatible spatially-coupled codesLai Wei, Daniel J. Costello Jr., Thomas E. Fuja. 1869-1873 [doi]
- On the minimum distance of generalized spatially coupled LDPC codesDavid G. M. Mitchell, Michael Lentmaier, Daniel J. Costello Jr.. 1874-1878 [doi]
- Performance bounds for spatially-coupled LDPC codes over the block erasure channelAlan Jule, Iryna Andriyanova. 1879-1883 [doi]
- Universal multiple access via spatially coupling data transmissionDmitri V. Truhachev. 1884-1888 [doi]
- Balanced Sparsest generator matrices for MDS codesSon Hoang Dau, Wentu Song, Zheng Dong, Chau Yuen. 1889-1893 [doi]
- Separating redundancy of linear MDS codesKhaled A. S. Abdel-Ghaffar, Jos H. Weber. 1894-1898 [doi]
- New pattern erasure codesSheng Lin, Kai Shi, Douglas S. Stones, Guangping Xu, Jinsong Wang. 1899-1903 [doi]
- A lattice singleton boundSrikanth B. Pai, B. Sundar Rajan. 1904-1908 [doi]
- Universal coding in order structures and isotone regressionFlemming Topsøe. 1909-1913 [doi]
- Redundancy analysis in lossless compression of a binary tree via its minimal DAG representationJie Zhang, En-Hui Yang, John C. Kieffer. 1914-1918 [doi]
- Average redundancy of the Shannon code for Markov sourcesNeri Merhav, Wojciech Szpankowski. 1919-1923 [doi]
- Space-efficient representation of truncated suffix trees, with applications to Markov order estimationLuciana Vitale, Alvaro Martín, Gadiel Seroussi. 1924-1928 [doi]
- A randomized probing scheme for increasing the stability region of multicarrier systemsApostolos Destounis, Mohamad Assaad, Mérouane Debbah, Bessem Sayadi. 1929-1933 [doi]
- Channel probing in communication systems: Myopic policies are not always optimalMatthew Johnston, Eytan Modiano, Isaac Keslassy. 1934-1938 [doi]
- Energy efficiency of Gaussian channel with random data arrivalJavad Behrouzi Moghaddam, Amir K. Khandani. 1939-1943 [doi]
- Utility optimal scheduling and admission control for adaptive video streaming in small cell networksDilip Bethanabhotla, Giuseppe Caire, Michael J. Neely. 1944-1948 [doi]
- On efficient min-cut approximations in half-duplex relay networksRaúl H. Etkin, Farzad Parvaresh, Ilan Shomorony, Amir Salman Avestimehr. 1949-1953 [doi]
- Relay positioning for multicast relay networksMohit Thakur, Gerhard Kramer. 1954-1958 [doi]
- Relay scheduling and interference cancellation for quantize-map-and-forward cooperative relayingMilos Jorgovanovic, M. Weiner, David Tse, Borivoje Nikolic, I-Hsiang Wang, Vinayak Nagpal. 1959-1963 [doi]
- Efficient incremental relayingMuhammad Mehboob Fareed, Mohamed-Slim Alouini. 1964-1668 [doi]
- Uniquely decodable and directly accessible non-prefix-free codes via wavelet treesM. Oguzhan Külekci. 1969-1973 [doi]
- Second-order Slepian-Wolf coding theorems for non-mixed and mixed sourcesRyo Nomura, Te Sun Han. 1974-1978 [doi]
- Data compression with nearly uniform outputRemi A. Chou, Matthieu R. Bloch. 1979-1983 [doi]
- On achievability of linear source coding over finite ringsSheng Huang, Mikael Skoglund. 1984-1988 [doi]
- Improved exponents and rates for bit-interleaved coded modulationLi Peng, Albert Guillen i Fabregas, Alfonso Martinez. 1989-1993 [doi]
- A reduced-complexity multilevel coded modulation for APSK signalingDaiki Yoda, Hideki Ochiai. 1994-1998 [doi]
- Threshold optimization for capacity-achieving discrete input one-bit output quantizationRudolf Mathar, Meik Dorpinghaus. 1999-2003 [doi]
- Improved MIMO detection based on successive tree approximationsJacob Goldberger. 2004-2008 [doi]
- Secrecy capacity region of a class of two-user Gaussian MIMO BC with degraded message setsHon-Fah Chong, Ying-Chang Liang. 2009-2013 [doi]
- Probability bounds for an eavesdropper's correct decision over a MIMO wiretap channelDavid A. Karpuk, Iván Blanco-Chacón, Camilla Hollanti. 2014-2018 [doi]
- Further results on optimal signaling over secure MIMO channelsSergey Loyka, Charalambos D. Charalambous. 2019-2023 [doi]
- On secrecy outage capacity of fading channels under relaxed delay constraintsOnur Güngör 0002, Can Emre Koksal, Hesham El Gamal. 2024-2028 [doi]
- The K-user interference channel: Strong interference regimeReza Khosravi-Farsani. 2029-2033 [doi]
- On the K-user cognitive interference channel with cumulative message sharing sum-capacityDiana Maamari, Daniela Tuninetti, Natasha Devroye. 2034-2038 [doi]
- On the capacity of interference channels with partial codebook knowledgeAlex Dytso, Natasha Devroye, Daniela Tuninetti. 2039-2043 [doi]
- On the capacity of the state-dependent cognitive interference channelMohammad Kazemi, Azadeh Vosoughi. 2044-2048 [doi]
- A new outer bound on the capacity region of a class of Z-interference channelsNan Liu, Wei Kang. 2049-2053 [doi]
- Obtaining extra coding gain for short codes by block Markov superposition transmissionXiao Ma, Chulong Liang, Kechao Huang, Qiutao Zhuang. 2054-2058 [doi]
- Pseudocodewords from Bethe permanentsRoxana Smarandache. 2059-2063 [doi]
- Anytime reliable LDPC convolutional codes for networked control over wireless channelAlberto Tarable, Alessandro Nordio, Fabrizio Dabbene, Roberto Tempo. 2064-2068 [doi]
- MDPC-McEliece: New McEliece variants from Moderate Density Parity-Check codesRafael Misoczki, Jean-Pierre Tillich, Nicolas Sendrier, Paulo S. L. M. Barreto. 2069-2073 [doi]
- Rate maximization of multilayer transmission over Rayleigh fading channelsWessam Mesbah, Mohammad Shaqfeh, Hussein M. Alnuweiri. 2074-2078 [doi]
- Characterization and optimization of the constrained capacity of coherent fading channels driven by arbitrary inputs: A Mellin transform based asymptotic approachAlberto Gil C. P. Ramos, Miguel R. D. Rodrigues. 2079-2083 [doi]
- Generic correlation increases noncoherent MIMO capacityGünther Koliander, Erwin Riegler, Giuseppe Durisi, Franz Hlawatsch. 2084-2088 [doi]
- Sharpened capacity lower bounds of fading MIMO channels with imperfect CSIAdriano Pastore, Jakob Hoydis, Javier R. Fonollosa. 2089-2093 [doi]
- Information regular and ψ-mixing channelsMartin Mittelbach, Eduard A. Jorswieck. 2094-2098 [doi]
- Non-linear smoothers for discrete-time, finite-state Markov chainsDaphney-Stavroula Zois, Marco Levorato, Urbashi Mitra. 2099-2103 [doi]
- Estimation in slow mixing, long memory channelsMeysam Asadi, Ramezan Paravi Torghabeh, Narayana P. Santhanam. 2104-2108 [doi]
- A randomized approach to the capacity of finite-state channelsGuangyue Han. 2109-2113 [doi]
- Concavity of mutual information rate of finite-state channelsYonglong Li, Guangyue Han. 2114-2118 [doi]
- Stabilizing multi-channel slotted aloha for machine-type communicationsOlga Galinina, Andrey M. Turlikov, Sergey D. Andreev, Yevgeni Koucheryavy. 2119-2123 [doi]
- Ergodic sum-rate of proportional fair scheduling with multiple antennasDavid Morales-Jiménez, Angel Lozano. 2124-2128 [doi]
- On spatial capacity in Ad-Hoc networks with threshold based schedulingYue Ling Che, Rui Zhang 0006, Yi Gong. 2129-2133 [doi]
- Optimal measurement matrices for neighbor discoveryArash Saber Tehrani, Alexandros G. Dimakis, Giuseppe Caire. 2134-2138 [doi]
- Computation over Gaussian networks with orthogonal componentsSang-Woon Jeon, Chien-Yi Wang, Michael Gastpar. 2139-2143 [doi]
- Computing sum of sources over an arbitrary multiple access channelArun Padakandla. 2144-2148 [doi]
- Empirical coordination in a triangular multiterminal networkAli Bereyhi, Mohsen Bahrami, Mahtab Mirmohseni, Mohammad Reza Aref. 2149-2153 [doi]
- Multi-round computation of type-threshold functions in collocated Gaussian networksChien-Yi Wang, Sang-Woon Jeon, Michael Gastpar. 2154-2158 [doi]
- Two-way communication with adaptive data acquisitionBehzad Ahmadi, Osvaldo Simeone. 2159-2163 [doi]
- Conveying discrete memoryless sources over networks: When are zero-rate edges dispensable?Badri N. Vellambi. 2164-2168 [doi]
- Real-time streaming of Gauss-Markov sources over sliding window burst-erasure channelsFarrokh Etezadi, Ashish Khisti. 2169-2173 [doi]
- Extended subspace error localization for rate-adaptive distributed source codingMojtaba Vaezi, Fabrice Labeau. 2174-2178 [doi]
- Distributed sensing and transmission of sporadic random samplesAyse Ünsal, Raymond Knopp. 2179-2183 [doi]
- Rumor source detection under probabilistic samplingNikhil Karamchandani, Massimo Franceschetti. 2184-2188 [doi]
- Optimal channel switching in the presence of stochastic signalingBerkan Dulek, Pramod K. Varshney, Mehmet Emin Tutay, Sinan Gezici. 2189-2193 [doi]
- Some worst-case bounds for Bayesian estimators of discrete distributionsSteffen Schober. 2194-2198 [doi]
- Controlled sensing for multihypothesis testing based on Markovian observationsSirin Nitinawarat, Venugopal V. Veeravalli. 2199-2203 [doi]
- On secure source coding with side information at the encoderYeow-Khiang Chia, Kittipong Kittichokechai. 2204-2208 [doi]
- Secure source coding with a public helperKittipong Kittichokechai, Yeow-Khiang Chia, Tobias J. Oechtering, Mikael Skoglund, Tsachy Weissman. 2209-2213 [doi]
- Source coding with side information for error free perfect secrecy systemsSiu-Wai Ho, Lifeng Lai, Alex J. Grant. 2214-2218 [doi]
- Rate-distortion theory for secrecy systemsCurt Schieler, Paul Cuff. 2219-2223 [doi]
- Secure locally repairable codes for distributed storage systemsAnkit Singh Rawat, Onur Ozan Koyluoglu, Natalia Silberstein, Sriram Vishwanath. 2224-2228 [doi]
- Structured lattice codes for 2×2×2 MIMO interference channelSong-Nam Hong, Giuseppe Caire. 2229-2233 [doi]
- Lattice codes for many-to-one cognitive interference networksJingge Zhu, Michael Gastpar. 2234-2238 [doi]
- Barnes-Wall lattices for the symmetric interference channelMaría Constanza Estela, Cong Ling, Jean-Claude Belfiore. 2239-2243 [doi]
- Gaussian sampling based lattice decodingTanumay Datta, A. Chockalingam, Emanuele Viterbo. 2244-2248 [doi]
- Belief Propagation for Linear ProgrammingAndrew E. Gelfand, Jinwoo Shin, Michael Chertkov. 2249-2253 [doi]
- Robust directed tree approximations for networks of stochastic processesChristopher J. Quinn, Jalal Etesami, Negar Kiyavash, Todd P. Coleman. 2254-2258 [doi]
- Efficient Bayesian inference methods via convex optimization and optimal transportSanggyun Kim, Rui Ma, Diego Mesa, Todd P. Coleman. 2259-2263 [doi]
- Optimal bounded-degree approximations of joint distributions of networks of stochastic processesChristopher J. Quinn, Ali Pinar, Negar Kiyavash. 2264-2268 [doi]
- The asymptotic capacity of noncoherent single-input multiple-output fading channels with memory and feedbackYuan-Zhu Guo, Hsuan-Yin Lin, Stefan M. Moser. 2269-2273 [doi]
- High-SNR asymptotics of mutual information for discrete constellationsAlex Alvarado, Fredrik Brannstrom, Erik Agrell, Tobias Koch. 2274-2278 [doi]
- On Wiener phase noise channels at high Signal-to-Noise RatioHassan Ghozlan, Gerhard Kramer. 2279-2283 [doi]
- Tight upper and lower bounds to the information rate of the phase noise channelLuca Barletta, Maurizio Magarini, Arnaldo Spalvieri. 2284-2288 [doi]
- Classification of Markov sources through joint string complexity: Theory and experimentsPhilippe Jacquet, Dimitris Milioris, Wojciech Szpankowski. 2289-293 [doi]
- Memoryless representation of Markov processesAmichai Painsky, Saharon Rosset, Meir Feder. 2294-298 [doi]
- Hidden Markov model identifiability via tensorsPaul Tune, Hung X. Nguyen, Matthew Roughan. 2299-2303 [doi]
- Partition function of the Ising model via factor graph dualityMehdi Molkaraie, Hans-Andrea Loeliger. 2304-2308 [doi]
- Cyclic Interference Neutralization on the full-duplex relay-interference channelHenning Maier, Rudolf Mathar. 2309-2313 [doi]
- Two-hop interference channels: Impact of linear time-varying schemesIbrahim Issa, Silas L. Fong, Amir Salman Avestimehr. 2309-2313 [doi]
- Amplify-and-compute: Function computation over layered networksMatthew S. Nokleby, Bobak Nazer. 2314-2318 [doi]
- Strong coordination over a line networkMatthieu R. Bloch, Jörg Kliewer. 2319-2323 [doi]
- Mixed Noisy Network CodingArash Behboodi, Pablo Piantanida. 2324-2328 [doi]
- Interactive function computationChangho Suh, Michael Gastpar. 2329-2333 [doi]
- Multi-terminal function multicasting in undirected graphsSreeram Kannan, Pramod Viswanath. 2334-2338 [doi]
- Physical-layer network coding on the random-access channelJasper Goseling, Michael Gastpar, Jos H. Weber. 2339-2343 [doi]
- Compute-and-Forward: Multiple bi-directional sessions on the line networkZhijie Ren, Jasper Goseling, Jos H. Weber, Michael Gastpar. 2344-2348 [doi]
- Randomized quantization and optimal design with a marginal constraintNaci Saldi, Tamás Linder, Serdar Yüksel. 2349-2353 [doi]
- Lossy source code using a constrained random number generatorJun Muramatsu. 2354-2358 [doi]
- Sequential functional quantizationVinith Misra, Krishnamurthy Viswanathan. 2359-2363 [doi]
- Rate loss in distributed functional source codingJohn Z. Sun, Vivek K. Goyal. 2364-2368 [doi]
- In-memory computing of Akers logic arrayEitan Yaakobi, Anxiao Andrew Jiang, Jehoshua Bruck. 2369-2373 [doi]
- Redundancy allocation of partitioned linear block codesYongjune Kim, B. V. K. Vijaya Kumar. 2374-2378 [doi]
- Compression for fixed-width memoriesOri Rottenstreich, Amit Berman, Yuval Cassuto, Isaac Keslassy. 2379-2383 [doi]
- An efficient interpolation-based systematic encoder for low-rate Blaum-Roth codesQian Guo, Haibin Kan. 2384-2388 [doi]
- On connectivity thresholds in superposition of random key graphs on random geometric graphsB. Santhana Krishnan, Ayalvadi Ganesh, D. Manjunath. 2389-2393 [doi]
- Simultaneously generating multiple keys in many to one networksLifeng Lai, Lauren M. Huie. 2394-2398 [doi]
- Using feedback for secrecy over graphsShaunak Mishra, Christina Fragouli, Vinod M. Prabhakaran, Suhas N. Diggavi. 2399-2403 [doi]
- Secure network coding for distributed secret sharing with low communication costNihar B. Shah, K. V. Rashmi, Kannan Ramchandran. 2404-2408 [doi]
- On the sum-rate capacity of the phase fading z-interference channel with a relay in the weak interference regimeDaniel Zahavi, Ron Dabora. 2414-2418 [doi]
- A new achievable scheme for interference relay channelsByungjun Kang, Si-Hyeon Lee, Sae-Young Chung, Changho Suh. 2419-2423 [doi]
- On the capacity region of the partially cooperative relay cognitive interference channelMohammad Kazemi, Azadeh Vosoughi. 2424-2427 [doi]
- Diversity-multiplexing tradeoff for the interference channel with a relayDaniel Zahavi, Lili Zhang, Ivana Maric, Ron Dabora, Andrea J. Goldsmith, Shuguang Cui. 2428-2432 [doi]
- Spatially-coupled multi-edge type LDPC codes with bounded degrees that achieve capacity on the BEC under BP decodingNaruomi Obata, Yung-Yih Jian, Kenta Kasai, Henry D. Pfister. 2433-2437 [doi]
- Spatially-coupled precoded rateless codesKosuke Sakata, Kenta Kasai, Kohichi Sakaniwa. 2438-2442 [doi]
- And now to something completely different: Spatial coupling as a proof techniqueAndrei Giurgiu, Nicolas Macris, Rüdiger L. Urbanke. 2443-2447 [doi]
- Multi-dimensional spatially-coupled codesRyunosuke Ohashi, Kenta Kasai, Keigo Takeuchi. 2448-2452 [doi]
- The space of solutions of coupled XORSAT formulaeSeyed Hamed Hassani, Nicolas Macris, Rüdiger L. Urbanke. 2453-2457 [doi]
- A formula for the capacity of the general Gel'fand-Pinsker channelVincent Y. F. Tan. 2458-2462 [doi]
- Channel code using a constrained Random number generatorJun Muramatsu. 2463-2467 [doi]
- Achieving capacity of large alphabet discrete memoryless channelsYuguang Gao, Aaron B. Wagner. 2468-2472 [doi]
- A general formula for capacity of channels with action-dependent statesTetsunao Matsuta, Tomohiko Uyematsu. 2473-2477 [doi]
- Capacity of a Structural Binary Symmetric ChannelLan V. Truong, Wojciech Szpankowski. 2478-2482 [doi]
- Recursive FMP for distributed inference in Gaussian graphical modelsYing Liu, Alan S. Willsky. 2483-2487 [doi]
- Reconstructing a graph from path tracesVincent Gripon, Michael Rabbat. 2488-2492 [doi]
- On the difficulty of learning power law graphical modelsRashish Tandon, Pradeep D. Ravikumar. 2493-2497 [doi]
- Sampling from Gaussian graphical models using subgraph perturbationsYing Liu, Oliver Kosut, Alan S. Willsky. 2498-2502 [doi]
- Inferring neural connectivity via measured delay in directed information estimatesNima Soltani, Andrea Goldsmith. 2503-2507 [doi]
- On the minimum energy of sending Gaussian multiterminal sources over the Gaussian MACNan Jiang, Yang Yang, Anders Høst-Madsen, Zixiang Xiong. 2508-2512 [doi]
- "Information-friction" and its impact on minimum energy per communicated bitPulkit Grover. 2513-2517 [doi]
- Energy and sampling constrained asynchronous communicationAslan Tchamkerten, Venkat Chandar, Giuseppe Caire. 2518-2522 [doi]
- On the capacity of multiple access and broadcast fading Channels with full channel state information at low power regimeZouheir Rezki, Mohamed-Slim Alouini. 2523-2527 [doi]
- Matched filter decoding of random binary and Gaussian codes in broadband Gaussian channelVitaly Abdrashitov, Muriel Médard, Dana Moshkovitz. 2528-2523 [doi]
- Upper bounds on error probabilities for continuous-time white Gaussian channels with feedbackShunsuke Ihara. 2533-2537 [doi]
- Capacity of a POST channel with and without feedbackHimanshu Asnani, Haim H. Permuter, Tsachy Weissman. 2538-2542 [doi]
- Using a Gaussian channel TwiceBo Bernhardsson. 2543-2546 [doi]
- Variable-length coding with feedback: Finite-length codewords and periodic decodingTsung-Yi Chen, Adam R. Williamson, Richard D. Wesel. 2547-2551 [doi]
- Reliability-based error detection for feedback communication with low latencyAdam R. Williamson, Tsung-Yi Chen, Richard D. Wesel. 2552-2556 [doi]
- Rate-distortion function for gamma sources under absolute-log distortion measureKazuho Watanabe, Shiro Ikeda. 2557-2561 [doi]
- A rate-distortion theory for permutation spacesDa Wang, Arya Mazumdar, Gregory W. Wornell. 2562-2566 [doi]
- A bit of secrecy for Gaussian source compressionEva C. Song, Paul Cuff, H. Vincent Poor. 2567-2571 [doi]
- Privacy of smart meter systems with an alternative energy sourceJesús Gómez-Vilardebó, Deniz Gündüz. 2572-2576 [doi]
- Variational equalities of directed information and applicationsPhotios Stavrou, Charalambos D. Charalambous. 2577-2581 [doi]
- Quickest search over multiple sequences with mixed observationsJun Geng, Weiyu Xu, Lifeng Lai. 2582-2586 [doi]
- Decentralized data-efficient quickest change detectionTaposh Banerjee, Venugopal V. Veeravalli, Alexander G. Tartakovsky. 2587-2591 [doi]
- Asymptotically optimal and bandwith-efficient decentralized detectionYasin Yilmaz, Xiaodong Wang. 2592-2596 [doi]
- Optimal sequential parameter estimationYasin Yilmaz, George V. Moustakides, Xiaodong Wang. 2597-2601 [doi]
- Social teaching: Being informative vs. being right in sequential decision makingJoong Bum Rhim, Vivek K. Goyal. 2602-2606 [doi]
- Low-density random matrices for secret key extractionHongchao Zhou, Venkat Chandar, Gregory W. Wornell. 2607-2611 [doi]
- Wiretap encoding of lattices from number fields using codes over FpWittawat Kositwattanarerk, Soon Sheng Ong, Frédérique E. Oggier. 2612-2616 [doi]
- Wiretap codes: Families of lattices satisfying the Belfiore-Solé secrecy function conjectureJulia Pinchak. 2617-2620 [doi]
- Secret key generation from Gaussian sources using lattice hashingCong Ling, Laura Luzzi, Matthieu R. Bloch. 2621-2625 [doi]
- On fading MAC channels with asymmetric CSIKamal Singh, Sibi Raj B. Pillai, Bikash K. Dey. 2626-2630 [doi]
- Multiple access channels with intermittent feedback and side informationAshish Khisti, Amos Lapidoth. 2631-2635 [doi]
- Multiple-access relay channels with non-causal side information at the relayMohammad Osmani-Bojd, Assadallah Sahebalam, Ghosheh Abed Hodtani. 2636-2640 [doi]
- Achievable rate region based on coset codes for multiple access channel with statesArun Padakandla, S. Sandeep Pradhan. 2641-2645 [doi]
- LT-AF codes: LT codes with Alternating FeedbackAli Talari, Nazanin Rahnavard. 2646-2650 [doi]
- Combinatorial optimization for improving QC LDPC codes performanceIrina E. Bocharova, Boris D. Kudryashov, Rolf Johannesson. 2651-2655 [doi]
- A revolving iterative algorithm for decoding algebraic quasi-cyclic LDPC codesKeke Liu, Shu Lin, Khaled A. S. Abdel-Ghaffar. 2656-2660 [doi]
- Necessary conditions for quasi-cyclic LDPC codes to have a given girthKyung-Joong Kim, Jin-Ho Chung, Kyeongcheol Yang. 2661-2665 [doi]
- Universal outlier hypothesis testingYun Li, Sirin Nitinawarat, Venugopal V. Veeravalli. 2666-2670 [doi]
- Rooting out the rumor culprit from suspectsWenxiang Dong, Wenyi Zhang, Chee-Wei Tan. 2671-2675 [doi]
- The capacity of adaptive group testingLeonardo Baldassini, Oliver Johnson, Matthew Aldridge. 2676-2680 [doi]
- An analysis on non-adaptive group testing based on sparse pooling graphsTadashi Wadayama. 2681-2685 [doi]
- Capacity of compound MIMO Gaussian channels with additive uncertaintyYin Sun, Can Emre Koksal, Ness B. Shroff. 2686-2690 [doi]
- On the capacity of the MIMO cognitive interference channelStefano Rini, Andrea Goldsmith. 2691-2695 [doi]
- Capacity of a class of relay channel with orthogonal components and non-causal channel stateZhixiang Deng, Fei Lang, Bao-Yun Wang, Sheng-mei Zhao. 2696-2700 [doi]
- Precoding based network Alignment and the capacity of a finite field X channelSundar R. Krishnamurthy, Syed A. Jafar. 2701-2705 [doi]
- The one-time pad revisitedChristian Matt, Ueli Maurer. 2706-2710 [doi]
- Authentication amplification by synchronizationUeli Maurer. 2711-2714 [doi]
- Non-asymptotic analysis of privacy amplification via Rényi entropy and inf-spectral entropyShun Watanabe, Masahito Hayashi. 2715-2719 [doi]
- Formalization of information-theoretic security for key agreement, revisitedJunji Shikata. 2720-2724 [doi]
- Distributed optimization for wireless networks with inter-session network codingZiyu Shao, Shuo-Yen Robert Li. 2725-2729 [doi]
- On uniform matroidal networksMing He, Zongpeng Li, Chuan Wu, Xunrui Yin. 2730-2734 [doi]
- On the Generalized Network Sharing bound and edge-cut bounds for network codingSudeep U. Kamath, David N. C. Tse. 2735-2739 [doi]
- Round-robin overlapping generations coding for fast content downloadGauri Joshi, Emina Soljanin. 2740-2744 [doi]
- GMI and mismatched-CSI outage exponents in MIMO block-fading channelsA. Taufiq Asyhari, Albert Guillen i Fabregas. 2745-2749 [doi]
- Generalized diversity-multiplexing tradeoff of half-duplex relay networksRitesh Kolte, Ayfer Özgür. 2750-2754 [doi]
- Nonlinear approximations for motion and subspace segmentationAli Sekmen, Akram Aldroubi. 2755-2759 [doi]
- Weighted rank aggregation via relaxed integer programmingFardad Raisali, Farzad Farnoud Hassanzadeh, Olgica Milenkovic. 2765-2769 [doi]
- Quality sensitive price competition in spectrum oligopolyArnob Ghosh, Saswati Sarkar. 2770-2774 [doi]
- Lattice coding for strongly secure compute-and-forward in a bidirectional relayV. Shashank, Navin Kashyap. 2775-2779 [doi]
- A coding approach to guarantee information integrity against a Byzantine relayEric Graves, Tan F. Wong. 2780-2784 [doi]
- Cooperation with an untrusted relay in broadcast channelsLiang Chen. 2785-2789 [doi]
- Secure k-connectivity in wireless sensor networks under an on/off channel modelJun Zhao, Osman Yagan, Virgil D. Gligor. 2790-2794 [doi]
- Two way communication over exponential family type channelsLav R. Varshney. 2795-2799 [doi]
- On The effect of self-interference in Gaussian two-way channels with erased outputsSeyed Ershad Banijamali, Kamyar Moshksar, Amir K. Khandani. 2800-2804 [doi]
- Delay-exponent of decode-forward streamingKhoa D. Nguyen, Lars K. Rasmussen. 2805-2809 [doi]
- Error exponents for the relay channelVincent Y. F. Tan. 2810-2814 [doi]
- Analysis and enumeration of absorbing sets for non-binary graph-based codesBehzad Amiri, Jörg Kliewer, Lara Dolecek. 2815-2819 [doi]
- Approaching multiple-access channel capacity by nonbinary coding-spreadingYuta Tsujii, Guanghui Song, Jun Cheng, Yoichiro Watanabe. 2820-2824 [doi]
- Message passing algorithm with MAP decoding on zigzag cycles for non-binary LDPC codesTakayuki Nozaki, Kenta Kasai, Kohichi Sakaniwa. 2825-2829 [doi]
- Weight distribution for non-binary cluster LDPC code ensembleTakayuki Nozaki, Masaki Maehara, Kenta Kasai, Kohichi Sakaniwa. 2830-2834 [doi]
- Exponential error bounds on Parameter Modulation-Estimation for Memoryless ChannelsNeri Merhav. 2835-2839 [doi]
- Interactive hypothesis testing against independenceYu Xiang, Young Han Kim. 2840-2844 [doi]
- Mismatched estimation and relative entropy in vector Gaussian channelsMinhua Chen, John D. Lafferty. 2845-2849 [doi]
- The role of lookahead in estimation under Gaussian noiseKartik Venkat, Tsachy Weissman, Yair Carmon, Shlomo Shamai. 2850-2854 [doi]
- Soft-encoding distributed coding for parallel relay systemsXuanxuan Lu, Tiffany Jing Li, Yang Liu. 2855-2859 [doi]
- Coded splitting tree protocolsJesper H. Sørensen, Cedomir Stefanovic, Petar Popovski. 2860-2864 [doi]
- To obtain or not to obtain CSI in the presence of hybrid adversaryYuksel Ozan Basciftci, Can Emre Koksal, Füsun Özgüner. 2865-2869 [doi]
- Matrix codes and multitone frequency shift keying for power line communicationsYeow Meng Chee, Han Mao Kiah, Punarbasu Purkayastha. 2870-2874 [doi]
- Tight bounds for universal compression of large alphabetsJayadev Acharya, Hirakendu Das, Ashkan Jafarpour, Alon Orlitsky, Ananda Theertha Suresh. 2875-2879 [doi]
- On large deviation property of recurrence timesSiddharth Jain, Rakesh Kumar Bansal. 2880-2884 [doi]
- On match lengths and the asymptotic behavior of Sliding Window Lempel-Ziv algorithm for zero entropy sequencesSiddharth Jain, Rakesh Kumar Bansal. 2885-2889 [doi]
- Communication over finite-ring matrix channelsChen Feng, Roberto W. Nobrega, Frank R. Kschischang, Danilo Silva. 2890-2894 [doi]
- An analysis on minimum s-t cut capacity of random graphs with specified degree distributionYuki Fujii, Tadashi Wadayama. 2895-2899 [doi]
- Linear network coding capacity for broadcast erasure channels with feedback, receiver coordination, and arbitrary security requirementChih-Chun Wang. 2900-2904 [doi]
- Stable and capacity achieving XOR-based policies for the Broadcast Erasure Channel with feedbackSophia Athanasiadou, Marios Gatzianas, Leonidas Georgiadis, Leandros Tassiulas. 2905-2909 [doi]
- Fast-decodable MIDO codes with large coding gainK. Pavan Srinath, B. Sundar Rajan. 2910-2914 [doi]
- Full-rate, full-diversity, finite feedback space-time schemes with minimum feedback and transmission durationLakshmi Prasad Natarajan, B. Sundar Rajan. 2915-2919 [doi]
- Variable-length channel quantizers for maximum diversity and array gainsErdem Koyuncu, Hamid Jafarkhani. 2920-2924 [doi]
- Counting sequences obtained from the synchronization channelFrederic Sala, Lara Dolecek. 2925-2929 [doi]
- Synchronization from insertions and deletions under a non-binary, non-uniform sourceNicolas Bitouze, Lara Dolecek. 2930-2934 [doi]
- Energy-efficient communication in the presence of synchronization errorsYu-Chih Huang, Urs Niesen, Piyush Gupta. 2935-2939 [doi]
- An upper bound on the capacity of non-binary deletion channelsMojtaba Rahmati, Tolga M. Duman. 2940-2944 [doi]
- Reliable deniable communication: Hiding messages in noisePak Hou Che, Mayank Bakshi, Sidharth Jaggi. 2945-2949 [doi]
- Artificial intersymbol interference (ISI) to exploit receiver imperfections for secrecyAzadeh Sheikholeslami, Dennis Goeckel, Hossein Pishro-Nik. 2950-2954 [doi]
- Secure cascade channel synthesisSanket Satpathy, Paul Cuff. 2955-2959 [doi]
- On the impact of network-state knowledge on the Feasibility of secrecySamir Medina Perlaza, Arsenia Chorti, H. Vincent Poor, Zhu Han. 2960-2964 [doi]
- The degraded broadcast channel with non-causal action-dependent side informationYossef Steinberg. 2965-2969 [doi]
- A comparison of superposition coding schemesLele Wang, Eren Sasoglu, Bernd Bandemer, Young Han Kim. 2970-2974 [doi]
- A block Markov encoding scheme for broadcasting nested message setsShirin Saeedi Bidokhti, Vinod M. Prabhakaran, Suhas N. Diggavi. 2975-2979 [doi]
- Cooperative broadcasting with successive refinement based compressionSeckin Anil Yildinm, Melda Yuksel. 2980-2984 [doi]
- Successive refinement with conditionally less noisy side informationRoy Timo, Tobias J. Oechtering, Michele A. Wigger. 2985-2989 [doi]
- Improving the BP estimate over the AWGN channel using Tree-structured expectation propagationLuis Salamanca, Juan José Murillo-Fuentes, Pablo M. Olmos, Fernando Pérez-Cruz. 2990-2994 [doi]
- Comparison of belief propagation and iterative threshold decoding based on dynamical systemsMohamad Mostafa, Werner G. Teich, Jürgen Lindner. 2995-2999 [doi]
- On the relevance of graph covers and zeta functions for the analysis of SPA decoding of cycle codesHenry D. Pfister, Pascal O. Vontobel. 3000-3004 [doi]
- Near maximum-likelihood decoding of Generalized LDPC and woven graph codesIrina E. Bocharova, Boris D. Kudryashov, Nikolay I. Makarov, Rolf Johannesson. 3005-3009 [doi]
- Gallager B LDPC Decoder with Transient and permanent errorsChu-Hsiang Huang, Yao Li, Lara Dolecek. 3010-3014 [doi]
- Equidistant codes meeting the Plotkin bound are Not optimal on the binary symmetric channelPo-Ning Chen, Hsuan-Yin Lin, Stefan M. Moser. 3015-3019 [doi]
- Extending Divsalar's bound to nonbinary codes with two dimensional constellationsDariush Divsalar. 3020-3024 [doi]
- An "Umbrella" bound of the Lovász-Gallager typeMarco Dalai. 3025-3029 [doi]
- Finite length analysis on listing failure probability of Invertible Bloom Lookup TablesDaichi Yugawa, Tadashi Wadayama. 3030-3034 [doi]
- Energy efficient power allocation for MIMO multihop networksKalle Lahetkangas, Marian Codreanu, Behnaam Aazhang. 3035-3039 [doi]
- Coded power control: Performance analysisBenjamin Larrousse, Samson Lasaulce. 3040-3044 [doi]
- The capacity of wireless channels: A physical approachWonseok Jeon, Sae-Young Chung. 3045-3049 [doi]
- Media-based modulation: A new approach to wireless transmissionAmir K. Khandani. 3050-3054 [doi]
- Non-asymptotic and second-order achievability bounds for source coding with side-informationShun Watanabe, Shigeaki Kuzuoka, Vincent Y. F. Tan. 3055-3059 [doi]
- Source coding with in-block memory and controllable causal side informationOsvaldo Simeone. 3060-3064 [doi]
- Utility of encoder side information for the lossless Kaspi/Heegard-B erger problemThomas Laich, Michele A. Wigger. 3065-3069 [doi]
- One-shot source coding with coded side information available at the decoderNaqueeb Ahmad Warsi. 3070-3074 [doi]
- The Ahlswede-Han conjecture on channel with coded side information at the decoderWei Kang, Nan Liu. 3075-3079 [doi]
- Joint channel/network coding for star networksChristian Koller, Martin Haenggi, Jörg Kliewer, Daniel J. Costello Jr.. 3080-3084 [doi]
- On the tightness of the generalized network sharing bound for the two-unicast-Z networkWeifei Zeng, Viveck R. Cadambe, Muriel Médard. 3085-3089 [doi]
- Rapprochement between instantly decodable and random linear network codingMingchao Yu, Neda Aboutorab, Parastoo Sadeghi. 3090-3094 [doi]
- Instantly decodable network coding for delay reduction in cooperative data exchange systemsNeda Aboutorab, Parastoo Sadeghi, Shahriar Etemadi Tajbakhsh. 3095-3099 [doi]
- Cooperative relaying in a poisson field of interferers: A diversity order analysisRalph Tanbourgi, Holger Jaekel, Friedrich K. Jondral. 3100-3104 [doi]
- Optimality range of Largest Eigenmode Relaying with partial channel state information in the relayMehdi M. Molu, Norbert Goertz. 3105-3109 [doi]
- How sensitive is compute-and-forward to channel estimation errors?Koralia N. Pappi, George K. Karagiannidis, Robert Schober. 3110-3114 [doi]
- Fractionally spaced equalization for broadband amplify-and-forward cooperative systemsMohammad Reza Heidarpour, Murat Uysal, Mohamed Oussama Damen. 3115-3119 [doi]
- Autocorrelation and linear complexity of quaternary sequences of period 2p based on cyclotomic classes of order fourVladimir Edemskiy, Andrew Ivanov. 3120-3124 [doi]
- On optimal binary Z-complementary pair of odd periodZi-Long Liu, Yong Liang Guan, Udaya Parampalli. 3125-3129 [doi]
- Quadratic weight vector for tighter aperiodic Levenshtein boundZi-Long Liu, Yong Liang Guan, Udaya Parampalli, Serdar Boztas. 3130-3134 [doi]
- Large zero correlation zone of Golay pairs and QAM Golay pairsGuang Gong, Fei Huo, Yang Yang. 3135-3139 [doi]
- An upper bound on the partial-period correlation of Zadoff-Chu sequencesTae-Kyo Lee, Jin-Ho Chung, Kyeongcheol Yang. 3140-3144 [doi]
- To surprise and informLav R. Varshney. 3145-3149 [doi]
- Conditional equivalence of random systems and indistinguishability proofsUeli Maurer. 3150-3154 [doi]
- Assisted sampling of correlated sourcesVinod M. Prabhakaran, Anand D. Sarwate. 3155-3159 [doi]
- Information-theoretically secure three-party computation with One corrupted partyYe Wang, Prakash Ishwar, Shantanu Rane. 3160-3164 [doi]
- How many queries will resolve common randomness?Himanshu Tyagi, Prakash Narayan. 3165-3169 [doi]