Table of Contents

• Trapping set ontologyBane Vasic, Shashi Kiran Chilappagari, Dung Viet Nguyen, Shiva Kumar Planjery. 1-7 [doi]
• LP decoding meets LP decoding: A connection between channel coding and compressed sensingAlexandros G. Dimakis, Pascal O. Vontobel. 8-15 [doi]
• The compound capacity of polar codesS. Hamed Hassani, Satish Babu Korada, Rüdiger L. Urbanke. 16-21 [doi]
• Optimal interleaving algorithms for generalized concatenated codesHessam Mahdavifar, Alexander Vardy. 22-29 [doi]
• Compressed sensing with probabilistic measurements: A group testing solutionMahdi Cheraghchi, Ali Hormati, Amin Karbasi, Martin Vetterli. 30-35 [doi]
• Sequential Sparse Matching PursuitRadu Berinde, Piotr Indyk. 36-43 [doi]
• Compressive sensing of streams of pulsesChinmay Hegde, Richard G. Baraniuk. 44-51 [doi]
• A single-letter characterization of optimal noisy compressed sensingDongning Guo, Dror Baron, Shlomo Shamai. 52-59 [doi]
• Sparse signal recovery with exponential-family noiseIrina Rish, Genady Grabarnik. 60-66 [doi]
• Interference alignment via random codes and he capacity of a class of deterministic interference channelsViveck R. Cadambe, Syed Ali Jafar. 67-74 [doi]
• An achievable rate region for the Gaussian Z-interference channel with conferencingHieu T. Do, Tobias J. Oechtering, Mikael Skoglund. 75-81 [doi]
• K-user fading interference channels: The ergodic very strong caseLalitha Sankar, Jan Vondrák, H. Vincent Poor. 82-87 [doi]
• Algebraic lattice alignment for K-user interference channelsAmin Jafarian, Jubin Jose, Sriram Vishwanath. 88-93 [doi]
• Cognitive interference management in retransmission-based wireless networksMarco Levorato, Urbashi Mitra, Michele Zorzi. 94-101 [doi]
• Implementing utility-optimal CSMAJinsung Lee, Junhee Lee 0002, Yung Yi, Song Chong, Alexandre Proutière, Mung Chiang. 102-111 [doi]
• Scheduling policies for single-hop networks with heavy-tailed trafficMihalis G. Markakis, Eytan H. Modiano, John N. Tsitsiklis. 112-120 [doi]
• Why segregating short jobs from long jobs under high variability is not always a winMor Harchol-Balter, Alan Scheller-Wolf, Andrew R. Young. 121-127 [doi]
• Network anomaly confirmation, diagnosis and remediationDavid Plonka, Paul Barford. 128-135 [doi]
• Stability of networks under general file size distribution with alpha fair rate allocationFernando Paganini, Ao Tang, Andrés Ferragut, Lachlan L. H. Andrew. 136-142 [doi]
• Asymptotic rate limits for randomized broadcasting with network codingDi Niu, Baochun Li. 143-150 [doi]
• Decentralized team decision via codingSachin Adlakha, Seyed Reza Mirghaderi, Sanjay Lall, Andrea Goldsmith. 151 [doi]
• Feedback capacity of a class of symmetric finite-state Markov channelsNevroz Sen, Fady Alajaji, Serdar Yüksel. 152-159 [doi]
• Optimal state estimation in the presence of communication costs and packet dropsGabriel M. Lipsa, Nuno C. Martins. 160-169 [doi]
• Signal detection in sparse multipath channelsMatthew Malloy, Akbar M. Sayeed. 170-177 [doi]
• Distributed detection and localization of events in large ad hoc wireless sensor networksKarumbu Premkumar, Anurag Kumar 0001, Joy Kuri. 178-185 [doi]
• A convex optimization approach of multi-step sensor selection under correlated noiseYilin Mo, Roberto Ambrosino, Bruno Sinopoli. 186-193 [doi]
• Generalizing Kronecker graphs in order to model searchable networksElizabeth Bodine-Baron, Babak Hassibi, Adam Wierman. 194-201 [doi]
• Distributed localization and tracking with coordinated and uncoordinated motion modelsUsman A. Khan, Soummya Kar, José M. F. Moura. 202-208 [doi]
• Network coding is highly non-approximableHongyi Yao, Elad Verbin. 209-213 [doi]
• Enhancing data persistence for energy constrained networks by network modulationWei Zhang 0003, Xiaoli Ma, Giwan Choi. 214-221 [doi]
• On the multiple unicast network coding, conjectureMichael Langberg, Muriel Médard. 222-227 [doi]
• Low-complexity non-uniform demand multicast network coding problemsJoseph C. Koo, John T. Gill III. 228-235 [doi]
• Coherence analysis of iterative thresholding algorithmsArian Maleki. 236-243 [doi]
• Model-based compressive sensing for signal ensemblesMarco F. Duarte, Volkan Cevher, Richard G. Baraniuk. 244-250 [doi]
• Minimax rates of convergence for high-dimensional regression under ℓq-ball sparsityGarvesh Raskutti, Martin J. Wainwright, Bin Yu 0001. 251-257 [doi]
• Performance analysis of support recovery with joint sparsity constraintsGongguo Tang, Arye Nehorai. 258-264 [doi]
• 3 User interference channel: Degrees of freedom as a function of channel diversityGuy Bresler, David N. C. Tse. 265-271 [doi]
• Capacity bounds for two-hop interference networksYi Cao, Biao Chen. 272-279 [doi]
• Interference channel capacity region for randomized fixed-composition codesCheng Chang. 280-287 [doi]
• Optimal multiplexing gain of K-user line-of-sight interference channels with polarizationSung Ho Chae, Sang Won Choi, Sae-Young Chung. 288-293 [doi]
• An algorithmic framework for wireless information flowMichel X. Goemans, Satoru Iwata 0001, Rico Zenklusen. 294-300 [doi]
• Conditions for a unique non-negative solution to an underdetermined systemMeng Wang 0003, Ao Tang. 301-307 [doi]
• Compressed neighbor discovery for wireless ad hoc networks: The Rayleigh fading caseJun Luo, Dongning Guo. 308-313 [doi]
• Distributed collaborative localization of multiple vehicles from relative pose measurementsJoseph Knuth, Prabir Barooah. 314-321 [doi]
• Social optima in mean field LQG control: Centralized and decentralized strategiesMinyi Huang, Peter E. Caines, Roland P. Malhamé. 322-329 [doi]
• Sequential team form and its simplification using graphical modelsAditya Mahajan, Sekhar Tatikonda. 330-339 [doi]
• Synthesis of H2 optimal static structured controllers: Primal and dual formulationsFu Lin, Makan Fardad, Mihailo R. Jovanovic. 340-346 [doi]
• Optimization and analysis of distributed averaging with memoryBoris N. Oreshkin, Mark J. Coates, Michael G. Rabbat. 347-354 [doi]
• Noisy group testing: An information theoretic perspectiveGeorge K. Atia, Venkatesh Saligrama. 355-362 [doi]
• Robust linear dimensionality reduction for hypothesis testing with application to sensor selectionDragana Bajovic, Bruno Sinopoli, João Xavier 0001. 363-370 [doi]
• Fading cognitive multiple-access channels with confidential messagesRuoheng Liu, Yingbin Liang, H. Vincent Poor. 371-377 [doi]
• P2P streaming capacity: Survey and recent resultsMinghua Chen 0001, Mung Chiang, Phil Chou, Jin Li 0001, Shao Liu, Sudipta Sengupta. 378-387 [doi]
• Degrees of freedom of multi-source relay networksSang-Woon Jeon, Sae-Young Chung, Syed Ali Jafar. 388-393 [doi]
• Distributed algorithm for collaborative detection in cognitive radio networksYingbin Liang, Lifeng Lai, John Halloran. 394-399 [doi]
• On systematic design of universally capacity approaching rate-compatible sequences of LDPC code ensembles over binary-input output-symmetric memoryless channelsHamid Saeedi, Hossein Pishro-Nik, Amir H. Banihashemi. 400-407 [doi]
• Can iterative decoding for erasure correlated sources be universal?Arvind Yedla, Henry D. Pfister, Krishna R. Narayanan. 408-415 [doi]
• Iterative maximum likelihood on networksElchanan Mossel, Omer Tamuz. 416-423 [doi]
• A binary message-passing decoding algorithm for LDPC codesChao-Yu Chen, Qin Huang, Jingyu Kang, Li Zhang 0030, Shu Lin 0001. 424-430 [doi]
• Message quantization in belief propagation: Structural results in the low-rate regimeO. Patrick Kreidl, Alan S. Willsky. 431-438 [doi]
• A low density lattice decoder via non-parametric belief propagationDanny Bickson, Alexander T. Ihler, Harel Avissar, Danny Dolev. 439-446 [doi]
• When do only sources need to compute? On functional compression in tree networksSoheil Feizi, Muriel Médard. 447-454 [doi]
• On scheduling in multi-channel wireless downlink networks with limited feedbackMing Ouyang, Lei Ying 0001. 455-461 [doi]
• Queue length analysis for multicast: Limits of performance and achievable queue length with random linear codingRandy Cogill, Brooke Shrader. 462-468 [doi]
• On channel access delay of CSMA policies in wireless networks with primary interference constraintsMahdi Lotfinezhad, Peter Marbach. 469-476 [doi]
• On fair sharing of spectrum via CSMAMurat Alanyali, Maxim Dashouk. 477-482 [doi]
• Is it enough to drain the heaviest bottlenecks?Gagan Raj Gupta, Sujay Sanghavi, Ness B. Shroff. 483-490 [doi]
• Auction-based dynamic spectrum trading market - Spectrum allocation and profit sharingSung Hyun Chun, Richard J. La. 491-498 [doi]
• Complementarities in spectrum marketsHang Zhou 0004, Randall A. Berry, Michael L. Honig, Rakesh Vohra. 499-506 [doi]
• Pricing, competition, and routing in relay networksYufang Xi, Edmund M. Yeh. 507-514 [doi]
• Mechanism design and implementation theoretic perspective of interference coupled wireless systemsHolger Boche, Siddharth Naik. 515-522 [doi]
• Information theoretic adaptive tracking of epidemics in complex networksPatrick L. Harrington, Alfred O. Hero III. 523-530 [doi]
• The importance of dilution in the inference of biological networksAlejandro Lage-Castellanos, Andrea Pagnani, Martin Weigt. 531-538 [doi]
• Compressed sensing approach for high throughput carrier screenYaniv Erlich, Noam Shental, Amnon Amir, Or Zuk. 539-544 [doi]
• A recursive construction of the set of binary entropy vectorsJohn MacLaren Walsh, Steven Weber 0001. 545-552 [doi]
• Improving the Sphere-Packing Bound for binary codes over memoryless symmetric channelsKaveh Mahdaviani, Shervin Shahidi, Shima Haddadi, Masoud Ardakani, Chintha Tellambura. 553-557 [doi]
• Source and channel simulation using arbitrary randomnessYücel Altug, Aaron B. Wagner. 558-565 [doi]
• Channels that dieLav R. Varshney, Sanjoy K. Mitter, Vivek K. Goyal. 566-573 [doi]
• The Poisson channel with side informationShraga I. Bross, Amos Lapidoth, Ligong Wang 0002. 574-578 [doi]
• Distributed universally optimal strategies for interference channels with partial message passingVaneet Aggarwal, Salman Avestimehr, Ashutosh Sabharwal. 579-584 [doi]
• Interference channels with arbitrarily correlated sourcesWei Liu 0017, Biao Chen. 585-592 [doi]
• Nonlinear network coding is necessary to combat general Byzantine attacksOliver Kosut, Lang Tong, David Tse. 593-599 [doi]
• FPGA-based low-complexity high-throughput tri-mode decoder for quasi-cyclic LDPC codesXiaoheng Chen, Qin Huang, Shu Lin 0001, Venkatesh Akella. 600-606 [doi]
• Adaptive Slepian-Wolf decoding using particle filtering based belief propagationSamuel Cheng 0001, Shuang Wang 0002, Lijuan Cui. 607-612 [doi]
• A locally encodable and decodable compressed data structureVenkat Chandar, Devavrat Shah, Gregory W. Wornell. 613-619 [doi]
• LDPC codes for the cascaded BSC-BAWGN channelAravind R. Iyengar, Paul H. Siegel, Jack K. Wolf. 620-627 [doi]
• A random time stochastic drift result and application to stochastic stabilization over noisy channelsSerdar Yüksel. 628-635 [doi]
• Approximation guarantees for fictitious playVincent Conitzer. 636-643 [doi]
• Optimizing the decision to expel attackers from an information systemNing Bao, John Musacchio. 644-651 [doi]
• Choice-point nets: A discrete-event modelling technique for analyzing health care protocolsSarah-Jane Whittaker, Karen Rudie, James McLellan, Stefan Haar. 652-659 [doi]
• Limited lookahead supervisory control of probabilistic discrete-event systemsCreag Winacott, Karen Rudie. 660-667 [doi]
• Sequential window diagnoser for discrete-event systems under unreliable observationsWen-Chiao Lin, Humberto E. Garcia, David Thorsley, Tae-Sic Yoo. 668-675 [doi]
• Controlling errors in the process of molecular self-assemblyYa Meng, Navin Kashyap. 676-677 [doi]
• Limits of performance of real-time DNA microarraysHaris Vikalo, Babak Hassibi. 678-683 [doi]
• How do the structure and the parameters of Gaussian tree models affect structure learning?Vincent Y. F. Tan, Animashree Anandkumar, Alan S. Willsky. 684-691 [doi]
• Compound relay channel with informed relay and destinationOsvaldo Simeone, Deniz Gündüz, Shlomo Shamai. 692-699 [doi]
• Universal capacity of channels with given rate-distortion in absence of common randomness, and failure of universal source-channel separationMukul Agarwal, Swastik Kopparty, Sanjoy K. Mitter. 700-707 [doi]
• Joint source-channel with side information coding error exponentsCheng Chang. 708-715 [doi]
• The lossy one-helper conjecture is falseAaron B. Wagner, Benjamin G. Kelly, Yücel Altug. 716-723 [doi]
• Distributed function computation in asymmetric communication scenariosSamar Agnihotri, Rajesh Venkatachalapathy, H. S. Jamadagni. 724-731 [doi]
• Reaching consensus in wireless networks with probabilistic broadcastTuncer C. Aysal, Anand D. Sarwate, Alexandros G. Dimakis. 732-739 [doi]
• Minimum energy per bit for Gaussian broadcast channels with common message and cooperating receiversAman Jain, Sanjeev R. Kulkarni, Sergio Verdú. 740-747 [doi]
• Power savings from half-duplex relaying in downlink cellular systemsChandrasekharan Raman, Gerard J. Foschini, Reinaldo A. Valenzuela, Roy D. Yates, Narayan B. Mandayam. 748-753 [doi]
• A note on information-theoretic secret key exchange over wireless channelsMurtaza Zafer, Dakshi Agrawal, Mudhakar Srivatsa. 754-761 [doi]
• Efficient algorithms for outage minimization in parallel fading channels with limited feedbackYuanyuan He 0001, Subhrakanti Dey. 762-770 [doi]
• Distributed strategies for making a digraph weight-balancedBahman Gharesifard, Jorge Cortés 0001. 771-777 [doi]
• Asymptotic analysis of quadratic error of consensus in large-scale random directed networksVictor M. Preciado, Alireza Tahbaz-Salehi, Ali Jadbabaie. 778-782 [doi]
• Grassmannian predictive coding for delayed limited feedback MIMO systemsTakao Inoue, Robert W. Heath Jr.. 783-788 [doi]
• A sequential transmission scheme for the multiple access channel with noiseless feedbackAchilleas Anastasopoulos. 789-794 [doi]
• Distributed MIMO network optimization based on duality and local message passingAn Liu 0001, Ashutosh Sabharwal, Youjian Liu, Haige Xiang, Wu Luo. 795-802 [doi]
• Information complexity of black-box convex optimization: A new look via feedback information theoryMaxim Raginsky, Alexander Rakhlin. 803-510 [doi]
• Interference channels with strong secrecyXiang He, Aylin Yener. 811-818 [doi]
• A new achievable ergodic secrecy rate region for the fading multiple access wiretap channelRaef Bassily, Sennur Ulukus. 819-826 [doi]
• Secure function evaluation based on secret sharing and homomorphic encryptionShantanu Rane, Wei Sun 0008, Anthony Vetro. 827-834 [doi]
• Joint compression and data protectionJoão Almeida 0004, João Barros. 835-842 [doi]
• Interference alignment at finite SNR: General message setsBobak Nazer, Michael Gastpar, Syed Ali Jafar, Sriram Vishwanath. 843-848 [doi]
• A simple upper bound on random access transport capacityJeffrey G. Andrews, Steven Weber 0001, Marios Kountouris, Martin Haenggi. 849-856 [doi]
• Distributed analog coding of correlated Gaussian sourcesIñaki Esnaola, Javier Garcia-Frías. 857-864 [doi]
• Upper bounds to error probability with feedbackBaris Nakiboglu, Lizhong Zheng. 865-871 [doi]
• On the sum capacity of the Gaussian multiple access channel with feedbackEhsan Ardetsanizadeh, Tara Javidi, Young-Han Kim 0001, Michèle A. Wigger. 872-878 [doi]
• On the endogenous formation of energy efficient cooperative wireless networksFatemeh Fazel, D. Richard Brown. 879-886 [doi]
• On capacity of deterministic wireless networks under node half-duplexity constraintAlireza Keshavarz-Haddad, Mohammad Ali Khojastepour. 887-891 [doi]
• Asymptotic capacity of randomly-failing relay networks with DF strategyChuan Huang 0001, Jinhua Jiang, Shuguang Cui. 892-898 [doi]
• Diversity-multiplexing tradeoff of network coding with bidirectional random relayingChun-Hung Liu, Jeffrey G. Andrews. 899-905 [doi]
• Distributed event-triggered control strategies for multi-agent systemsDimos V. Dimarogonas, Emilio Frazzoli. 906-910 [doi]
• Secure control against replay attacksYilin Mo, Bruno Sinopoli. 911-918 [doi]
• On the large-deviations optimality of scheduling policies minimizing the drift of a Lyapunov functionXiaojun Lin 0001, V. J. Venkataramanan. 919-926 [doi]
• Concurrency control generation for dynamic threads using Discrete-Event SystemsAnthony Auer, Juergen Dingel, Karen Rudie. 927-934 [doi]
• Posterior matching variants and fixed-point eliminationOfer Shayevitz. 935-939 [doi]
• Loss of continuity in cellular networks under stabilizing transmit power controlVishwesh V. Kulkarni 0001, Vincent Fromion, Tansu Alpcan, Michael G. Safonov. 940-946 [doi]
• Optimal feedback allocation algorithms for multi-user uplinkHarish Ganapathy, Siddhartha Banerjee, Nedialko B. Dimitrov, Constantine Caramanis. 947-954 [doi]
• Capacity region of a state dependent degraded broadcast channel with noncausal transmitter CSIHimanshu Tyagi. 955-961 [doi]
• Sparse and low-rank matrix decompositionsVenkat Chandrasekaran, Sujay Sanghavi, Pablo A. Parrilo, Alan S. Willsky. 962-967 [doi]
• Dynamic self-organization and clustering in distributed networked systems for performance improvementJohn S. Baras, Pedram Hovareshti, Senni Perumal. 968-975 [doi]
• An entropy-based framework for dynamic clustering and coverage problemsPuneet Sharma. 976-983 [doi]
• Game-theoretic learning algorithm for a spatial coverage problemKetan Savla, Emilio Frazzoli. 984-990 [doi]
• Interference alignment with asymmetric complex signalingSyed Ali Jafar, Viveck R. Cadambe, Chenwei Wang 0001. 991-996 [doi]
• Beyond network equivalenceRalf Koetter, Michelle Effros, Muriel Médard. 997-1004 [doi]
• A restricted isometry property for structurally-subsampled unitary matricesWaheed U. Bajwa, Akbar M. Sayeed, Robert Nowak 0001. 1005-1012 [doi]
• Solving low-rank matrix completion problems efficientlyDonald Goldfarb, Shiqian Ma, Zaiwen Wen. 1013-1020 [doi]
• Random channel coding and blind deconvolutionM. Salman Asif, William Mantzel, Justin Romberg. 1021-1025 [doi]
• Breaking the ℓ1 recovery thresholds with reweighted ℓ1 optimizationWeiyu Xu, M. Amin Khajehnejad, Amir Salman Avestimehr, Babak Hassibi. 1026-1030 [doi]
• Data movement in flash memoriesAnxiao Jiang, Michael Langberg, Robert Mateescu, Jehoshua Bruck. 1031-1038 [doi]
• Modulation codes for flash memory based on load-balancing theoryFan Zhang 0096, Henry D. Pfister. 1039-1046 [doi]
• Novel burst error correcting algorithms for Reed-Solomon codesYingquan Wu. 1047-1052 [doi]
• Violating the Ingleton inequality with finite groupsWei Mao 0003, Babak Hassibi. 1053-1060 [doi]
• Secure source coding with a helperRavi Tandon, Sennur Ulukus, Kannan Ramchandran. 1061-1068 [doi]
• Arbitrary jamming can preclude secure communicationEbrahim MolavianJazi, Matthieu R. Bloch, J. Nicholas Laneman. 1069-1075 [doi]
• Secure relaying: Can publicly transferred keys increase degrees of freedom?Tùng T. Kim, H. Vincent Poor. 1076-1081 [doi]
• Maximum throughput of clandestine relayTing He 0001, Lang Tong, Ananthram Swami. 1082-1089 [doi]
• On physically secure and stable slotted ALOHA systemYunus Sarikaya, Özgür Erçetin. 1090-1096 [doi]
• Throughput optimality of delay-driven MaxWeight scheduler for a wireless system with flow dynamicsBilal Sadiq, Gustavo de Veciana. 1097-1102 [doi]
• The impact of queue length information on buffer overflow in parallel queuesKrishna Jagannathan 0001, Eytan H. Modiano. 1103-1110 [doi]
• Stable and utility-maximizing scheduling for stochastic processing networksLibin Jiang, Jean C. Walrand. 1111-1119 [doi]
• Almost budget-balanced mechanisms for allocation of divisible resourcesAnil Kumar Chorppath, Srikrishna Bhashyam, Rajesh Sundaresan. 1120-1125 [doi]
• A flexible framework for polynomial-time resource allocation in multiflow wireless networksGareth Middleton, Behnaam Aazhang, Jorma Lilleberg. 1126-1133 [doi]
• Utility of beamforming strategies for secrecy in multiuser MIMO wiretap channelsAmitav Mukherjee, A. Lee Swindlehurst. 1134-1141 [doi]
• Limits on the robustness of MIMO joint source-channel codesMahmoud Taherzadeh, H. Vincent Poor. 1142-1144 [doi]
• Multiclass support vector machines for adaptation in MIMO-OFDM wireless systemsSungho Yun, Constantine Caramanis. 1145-1152 [doi]
• MIMO wireless communications under statistical queueing constraintsMustafa Cenk Gursoy. 1153-1160 [doi]
• Interference suppression in the presence of quantization errorsOmar Bakr, Mark Johnson, Raghuraman Mudumbai, Upamanyu Madhow. 1161-1168 [doi]
• Codes against online adversariesBikash Kumar Dey, Sidharth Jaggi, Michael Langberg. 1169-1176 [doi]
• Minimal error certificates for detection of faulty sensors using convex optimizationChristian G. Claudel, Matthieu Nahoum, Alexandre M. Bayen. 1177-1186 [doi]
• A power control game with smooth reduction of SINR objectivesOmur Ozel, Elif Uysal-Biyikoglu. 1187-1194 [doi]
• Interference networks with local view: A distributed optimization approachJun Xiao, Vaneet Aggarwal, Ashutosh Sabharwal, Youjian Liu. 1195-1202 [doi]
• Competition of wireless providers for atomic users: Equilibrium and social optimalityVojislav Gajic, Jianwei Huang 0001, Bixio Rimoldi. 1203-1210 [doi]
• Enhanced CDMA communications using compressed-sensing reconstruction methodsVaneet Aggarwal, Lorne Applebaum, Amir Bennatan, A. Robert Calderbank, Stephen D. Howard, Stephen J. Searle. 1211-1215 [doi]
• Low-rank matrix completion with noisy observations: A quantitative comparisonRaghunandan H. Keshavan, Andrea Montanari, Sewoong Oh. 1216-1222 [doi]
• Accurate low-rank matrix recovery from a small number of linear measurementsEmmanuel J. Candès, Yaniv Plan. 1223-1230 [doi]
• Distributed transmission of functions of correlated sources over a fading multiple access channelRamachandran Rajesh, Vinod Sharma. 1225-1232 [doi]
• Expander codes over reals, Euclidean sections, and compressed sensingVenkatesan Guruswami, James R. Lee, Avi Wigderson. 1231-1234 [doi]
• A rate-distortion perspective on multiple decoding attempts for Reed-Solomon codesPhong S. Nguyen, Henry D. Pfister, Krishna R. Narayanan. 1235-1242 [doi]
• Explicit construction of optimal exact regenerating codes for distributed storageK. V. Rashmi, Nihar B. Shah, P. Vijay Kumar, Kannan Ramchandran. 1243-1249 [doi]
• Distortion exponent for multiple description codingSongqing Zhao, Daniela Tuninetti, Rashid Ansari, Dan Schonfeld. 1250-1255 [doi]
• Multiple description coding of discrete ergodic sourcesShirin Jalali, Tsachy Weissman. 1256-1261 [doi]
• Highly parallel decoding of space-time codes on graphics processing unitsKalyana C. Bollapalli, Yiyue Wu, Kanupriya Gulati, Sunil P. Khatri, A. Robert Calderbank. 1262-1269 [doi]
• A detection theoretic approach to digital fingerprinting with focused receivers under uniform linear averaging Gaussian attacksOzgur Dalkilic, Ersen Ekrem, S. Eray Varlik, M. Kivanç Mihçak. 1270-1277 [doi]
• Secrecy capacity region of the degraded compound multi-receiver wiretap channelErsen Ekrem, Sennur Ulukus. 1278-1285 [doi]
• On the relationship between the multi-antenna secrecy communications and cognitive radio communicationsLan Zhang 0007, Rui Zhang 0006, Ying-Chang Liang, Yan Xin 0001, Shuguang Cui. 1286-1292 [doi]
• Spectral analysis of dynamically evolving networks with linear preferential attachmentVictor M. Preciado, Ali Jadbabaie. 1293-1299 [doi]
• Bursty fluid approximation of TCP for modeling internet congestion at the flow levelDaniel Genin, Vladimir Marbukh. 1300-1306 [doi]
• TCP with feed-forward source coding for wireless downlink networksJung Ryu, Sandeep Bhadra, Sanjay Shakkottai. 1307-1314 [doi]
• Performance analysis of MAC protocols in wireless line networks using statistical mechanicsKa-Hung Hui, Dongning Guo, Randall Berry, Martin Haenggi. 1315-1322 [doi]
• Efficient linear precoding in downlink cooperative cellular networks with soft interference nullingChris T. K. Ng, Howard C. Huang. 1323-1329 [doi]
• Rotational coding achieves multicast capacity of deterministic wireless networksMohammad Ali Khojastepour, Alireza Keshavarz-Haddad. 1330-1337 [doi]
• Isotropic MIMO interference channels without CSIT: The loss of degrees of freedomYan Zhu 0003, Dongning Guo. 1338-1344 [doi]
• Distributed MIMO network optimization based on duality and local message passingAn Liu 0001, Ashutosh Sabharwal, Youjian Liu, Haige Xiang, Wu Luo. 1345-1352 [doi]
• Economics of malware: Epidemic risks model, network externalities and incentivesMarc Lelarge. 1353-1360 [doi]
• Multi-channel opportunistic access: A case of restless bandits with multiple playsSahand Haji Ali Ahmad, Mingyan Liu. 1361-1368 [doi]
• Supermodular network gamesVahideh H. Manshadi, Ramesh Johari. 1369-1376 [doi]
• An individually rational, budget-balanced mechanism that implements in Nash equilibria the solution of the unicast service provisioning problemAli Kakhbod, Demosthenis Teneketzis. 1377-1386 [doi]
• Network error correction with unequal link capacitiesSukwon Kim, Tracey Ho, Michelle Effros, Salman Avestimehr. 1387-1394 [doi]
• A general class of throughput optimal routing policies in multi-hop wireless networksMohammad Naghshvar, Hairuo Zhuang, Tara Javidi. 1395-1402 [doi]
• Sharing information in time-division duplexing channels: A network coding approachDaniel E. Lucani, Muriel Médard, Milica Stojanovic, David R. Karger. 1403-1410 [doi]
• On the capacity of the symbol-asynchronous relay channelChiranjib Choudhuri, Urbashi Mitra. 1411-1418 [doi]
• Rateless codes for single-server streaming to diverse usersYao Li 0007, Emina Soljanin. 1419-1426 [doi]
• Connections between probability estimation and graph theoryN. P. Santhanam. 1427-1429 [doi]
• Impact of region-based faults on the connectivity of wireless networksArunabha Sen, Sujogya Banerjee, Pavel Ghosh, Shahrzad Shirazipourazad. 1430-1437 [doi]
• Swarming secretsShlomi Dolev, Juan A. Garay, Niv Gilboa, Vladimir Kolesnikov. 1438-1445 [doi]
• Replication schemes for opportunistic networks with impatient usersJoshua Reich, Augustin Chaintreau. 1446-1451 [doi]
• Data aggregation in sensor networks: No more a slave to routingRavi Prakash 0001, Ehsan Nourbakhsh, Kunal Sahu. 1452-1459 [doi]
• Neighbor discovery in mobile ad hoc networks using an abstract MAC layerAlejandro Cornejo, Nancy A. Lynch, Saira Viqar, Jennifer L. Welch. 1460-1467 [doi]
• Robust detection of random variables using sparse measurementsBalakrishnan Narayanaswamy, Rohit Negi, Pradeep K. Khosla. 1468-1475 [doi]
• Quickest change detection in multiple on-off processes: Switching with memoryJia Ye, Qing Zhao. 1476-1481 [doi]
• Outlier detection via localized p-value estimationManqi Zhao, Venkatesh Saligrama. 1482-1489 [doi]
• Target detection in MIMO radar using Golay complementary sequences in the presence of DopplerTariq R. Qureshi, Michael D. Zoltowski, A. Robert Calderbank. 1490-1493 [doi]
• On detection with partial information in the Gaussian setupOnur Özyesil, M. Kivanç Mihçak, Yücel Altug. 1494-1501 [doi]
• Interactive encoding and decoding based on syndrome accumulation over binary LDPC ensembles: Universality and rate-adaptivityJin Meng 0001, En-Hui Yang. 1502-1509 [doi]
• Infinite-message distributed source coding for two-terminal interactive computingNan Ma, Prakash Ishwar. 1510-1517 [doi]
• LDGM-based codes for successive refinementYing Zhang, Sorina Dumitrescu, Jun Chen 0005, Zhibin Sun. 1518-1524 [doi]
• Asymptotically optimal policies for hard-deadline scheduling over fading channelsJuyul Lee, Nihar Jindal. 1533-1540 [doi]
• Information rates of the noncoherent frequency selective fading channelJing Huang, Sundeep Venkatraman, Krishnan Padmanabhan, Oliver M. Collins. 1541-1548 [doi]
• A training based scheme for communicating over unknown channels with feedbackAditya Mahajan, Sekhar Tatikonda. 1549-1553 [doi]
• The sum-rate bound for a new class of quadratic Gaussian multiterminal source coding problemsYang Yang 0003, Zixiang Xiong. 1554-1561 [doi]
• Scaling limits for continuous opinion dynamics systemsGiacomo Como, Fabio Fagnani. 1562-1566 [doi]
• On the existence of triangles in random key graphsOsman Yagan, Armand M. Makowski. 1567-1574 [doi]
• Distributed agreement in the presence of noiseJing Wang 0073, Nicola Elia. 1575-1581 [doi]
• Distributed anonymous function computation in information fusion and multiagent systemsJulien M. Hendrickx, Alex Olshevsky, John N. Tsitsiklis. 1582-1589 [doi]
• Graph covers and quadratic minimizationNicholas Ruozzi, Justin Thaler, Sekhar Tatikonda. 1590-1596 [doi]
• Cost sharing with network coding in two-way relay networksErtugrul Necdet Ciftcioglu, Yalin Evren Sagduyu, Randall Berry, Aylin Yener. 1597-1604 [doi]