Table of Contents

• A relation between network computation and functional index coding problemsAnindya Gupta, B. Sundar Rajan. 1-5 [doi]
• On distributed computing for functions with certain structuresShigeaki Kuzuoka, Shun Watanabe. 6-10 [doi]
• An improved upper bound on network function computation using cut-set partitionXuan Guang, Shenghao Yang, Congduan Li. 11-15 [doi]
• A Tight Upper Bound on the Mutual Information of Two Boolean FunctionsGeorg Pichler, Gerald Matz, Pablo Piantanida. 16-20 [doi]
• On secure computation over the binary modulo-2 adder multiple-access wiretap channelMario Goldenbaum, Holger Boche, H. Vincent Poor. 21-25 [doi]
• Information-theoretic analysis of stability and bias of learning algorithmsMaxim Raginsky, Alexander Rakhlin, Matthew Tsao, Yihong Wu, Aolin Xu. 26-30 [doi]
• K-user degraded broadcast channel with secrecy outside a bounded rangeShaofeng Zou, Yingbin Liang, Lifeng Lai, H. Vincent Poor, Shlomo Shamai. 31-35 [doi]
• On the secrecy capacity of the broadcast wiretap channel with limited CSI feedbackAmal Hyadi, Zouheir Rezki, Mohamed-Slim Alouini. 36-40 [doi]
• MIMO Gaussian broadcast channels with common, private and confidential messagesZiv Goldfeld. 41-45 [doi]
• Jamming-resistant frequency hopping system with secret key generation from channel observationsChia-Yu Liu, Y.-W. Peter Hong, Pin-Hsun Lin, Eduard A. Jorswieck. 46-50 [doi]
• Symmetries in the entropy spaceJayant Apte, Qi Chen, John MacLaren Walsh. 51-55 [doi]
• A universal bound on the ϵ-entropy of bandlimited radiationMassimo Franceschetti. 56-60 [doi]
• A totally geodesic submanifold of the multivariate normal distributions and bounds for the Fisher-Rao distanceJoão E. Strapasson, Julianna Pinele, Sueli I. R. Costa. 61-65 [doi]
• On the applications of the minimum mean p-th error (MMPE) to information theoretic quantitiesAlex Dytso, Ronit Bustin, Daniela Tuninetti, Natasha Devroye, H. Vincent Poor, Shlomo Shamai. 66-70 [doi]
• Mutual information in rank-one matrix estimationFlorent Krzakala, Jiaming Xu, Lenka Zdeborová. 71-75 [doi]
• Threshold saturation of spatially coupled sparse superposition codes for all memoryless channelsJean Barbier, Mohamad Dia, Nicolas Macris. 76-80 [doi]
• Polar coding for empirical coordination of signals and actions over noisy channelsGiulia Cervia, Laura Luzzi, Matthieu R. Bloch, Maël Le Treust. 81-85 [doi]
• Nonasymptotic coding-rate bounds for binary erasure channels with feedbackRahul Devassy, Giuseppe Durisi, Benjamin Lindqvist, Wei Yang, Marco Dalai. 86-90 [doi]
• Improving Belief Propagation decoding of polar codes using scattered EXIT chartsA. Elkelesh, M. Ebada, Sebastian Cammerer, Stephan ten Brink. 91-95 [doi]
• MacWilliams' Identity for metrics determined by directed graphsRoberto Assis Machado, Marcelo Firer. 96-100 [doi]
• A lower bound for the rate-distortion function of spike sources that is asymptotically tightLars Palzer, Roy Timo. 101-105 [doi]
• Constant-width rate-distortion bounds for power distortion measuresKazuho Watanabe. 106-110 [doi]
• Optimal rate allocation in multiterminal compress-and-estimate source codingRuiyang Song, Stefano Rini, Alon Kipnis, Andrea J. Goldsmith. 111-115 [doi]
• On point-wise redundancy rate of Bender-Wolf's variant of SWLZ algorithmAyush Jain, Rakesh K. Bansal. 116-120 [doi]
• CROMqs: an infinitesimal successive refinement lossy compressor for the quality scoresIdoia Ochoa, Albert No, Mikel Hernaez, Tsachy Weissman. 121-125 [doi]
• Strong converse for state dependent channels with full state information at the sender and partial state information at the receiverYasutada Oohama. 126-130 [doi]
• On the optimality of randomized time division and superposition coding for the broadcast channelChandra Nair, Hyeji Kim, Abbas El Gamal. 131-135 [doi]
• Dual capacity upper bounds for noisy runlength constrained channelsAndrew Thangaraj. 136-140 [doi]
• Network equivalence for a joint compound-arbitrarily-varying network modelOliver Kosut, Jörg Kliewer. 141-145 [doi]
• Binary distributed hypothesis testing via Körner-Marton codingEli Haim, Yuval Kochman. 146-150 [doi]
• Multispectral image compression using universal vector quantizationDiego Valsesia, Petros T. Boufounos. 151-155 [doi]
• A framework for low-complexity signal recovery and its application to structured sparsityYann Traonmilin, Rémi Gribonval. 156-160 [doi]
• On the optimality of uncoded cache placementKai Wan, Daniela Tuninetti, Pablo Piantanida. 161-165 [doi]
• Correlation-aware distributed caching and coded deliveryParisa Hassanzadeh, Antonia Maria Tulino, Jaime Llorca, Elza Erkip. 166-170 [doi]
• Coded caching for a large number of usersMohammad Mohammadi Amiri, Qianqian Yang, Deniz Gündüz. 171-175 [doi]
• Consistent distributed storage of correlated data updates via multi-version codingRamy E. Ali, Viveck R. Cadambe. 176-180 [doi]
• General performance metrics for the LASSOEhsan Abbasi, Christos Thrampoulidis, Babak Hassibi. 181-185 [doi]
• Online learning for sparse PCA in high dimensions: Exact dynamics and phase transitionsChuang Wang, Yue M. Lu. 186-190 [doi]
• Keyless asynchronous covert communicationKeerthi Suria Kumar Arumugam, Matthieu R. Bloch. 191-195 [doi]
• Secret key generation through a relayKittipong Kittichokechai, Rafael F. Schaefer, Giuseppe Caire. 196-200 [doi]
• Keyless authentication in the presence of a simultaneously transmitting adversaryEric Graves, Paul Yu, Predrag Spasojevic. 201-205 [doi]
• Simultaneously generating multiple keys over a cascade of a noiseless channel and a wiretap channelWenwen Tu, Mario Goldenbaum, Lifeng Lai, H. Vincent Poor. 206-210 [doi]
• Clustering subgaussian mixtures with k-meansDustin G. Mixon, Soledad Villar, Rachel Ward. 211-215 [doi]
• Anomaly identification with limited sampling budgetJulia Kuhn, Michel Mandjes, Thomas Taimre. 216-220 [doi]
• Sequential measurement-dependent noisy searchSung-En Chiu, Tara Javidi. 221-225 [doi]
• Learning adaptive multiscale approximations to data and functions near low-dimensional setsWenjing Liao, Mauro Maggioni, Stefano Vigogna. 226-230 [doi]
• Doubly threshold graphs for social network modelingVida Ravanmehr, Sadegh Bolouki, Gregory J. Puleo, Olgica Milenkovic. 231-235 [doi]
• On the block error rate performance of spatially coupled LDPC codes for streaming applicationsDavid G. M. Mitchell, Ali Emre Pusane, Michael Lentmaier, Daniel J. Costello Jr.. 236-240 [doi]
• Beyond double transitivity: Capacity-achieving cyclic codes on erasure channelsSanthosh Kumar, A. Robert Calderbank, Henry D. Pfister. 241-245 [doi]
• The velocity of the propagating wave for general coupled scalar systemsRafah El-Khatib, Nicolas Macris. 246-250 [doi]
• Asymptotics of the random-coding union bound in quasi-static fading channelsJosep Font-Segura, Alfonso Martinez, Albert Guillen i Fabregas. 251-254 [doi]
• An outer bound on the storage-bandwidth tradeoff of exact-repair regenerating codes and its asymptotic optimality in high ratesHyuk Lee, Jungwoo Lee. 255-259 [doi]
• Robust nonnegative sparse recovery and 0/1-Bernoulli measurementsRichard Kueng, Peter Jung. 260-264 [doi]
• Inferring sparsity: Compressed sensing using generalized restricted Boltzmann machinesEric W. Tramel, Andre Manoel, Francesco Caltagirone, Marylou Gabrié, Florent Krzakala. 265-269 [doi]
• Optimal sparse recovery for multi-sensor measurementsIl Yong Chun, Ben Adcock. 270-274 [doi]
• Rate-distortion lower bound for compressed sensing via conditional remote source codingMarkus Leinonen, Marian Codreanu, Markku J. Juntti, Gerhard Kramer. 275-279 [doi]
• Orthogonal AMP for compressed sensing with unitarily-invariant matricesJunjie Ma, Li Ping. 280-284 [doi]
• Cost of local cooperation in hierarchical virtual MIMO transmission schemesJinfeng Du, Muriel Médard, Shlomo Shamai. 285-289 [doi]
• Dynamic pilot allocation over Markovian fading channels: A restless bandit approachMaialen Larrañaga, Mohamad Assaad, Apostolos Destounis, Georgios S. Paschos. 290-294 [doi]
• Lossy compression for compute-and-forward in limited backhaul wireless relay networksInaki Estella Aguerri, Abdellatif Zaidi. 295-299 [doi]
• Optimally bridging the gap from delayed to perfect CSIT in the K-user MISO BCPaul de Kerret, David Gesbert, Jingjing Zhang, Petros Elia. 300-304 [doi]
• On MIMO phase noise channels at high SNRSheng Yang, Shlomo Shamai. 305-309 [doi]
• Algorithms for structured matrix-vector product of optimal bilinear complexityKe Ye, Lek-Heng Lim. 310-314 [doi]
• On the identifiability and stable recovery of deep/multi-layer structured matrix factorizationFrançois Malgouyres, Joseph Landsberg. 315-319 [doi]
• Approximate file synchronization: Upper bounds and interactive algorithmsAmirhossein Reisizadehmobarakeh, Clayton Schoeny, Chi-Yo Tsai, Lara Dolecek. 320-324 [doi]
• Pliable Index COding: Novel lower bound on the fraction of satisfied clients with a single transmission and its applicationTang Liu, Daniela Tuninetti. 325-329 [doi]
• Distributed index codingParastoo Sadeghi, Fatemeh Arbabjolfaei, Young-Han Kim 0001. 330-334 [doi]
• Complete interference mitigation through receiver-caching in Wyner's networksMichele A. Wigger, Roy Timo, Shlomo Shamai. 335-339 [doi]
• The geometry of invariants for generalized coherence testsStephen D. Howard, Douglas Cochran, Songsri Sirianunpiboon. 340-344 [doi]
• Scaling laws and phase transitions for target detection in MIMO radarLu Wei, Zhong Zheng, Alfred Hero, Vahid Tarokh. 345-348 [doi]
• A new multiple access wiretap channel modelMohamed S. Nafea, Aylin Yener. 349-353 [doi]
• When is omniscience a rate-optimal strategy for achieving secret key capacity?Chung Chan, Manuj Mukherjee, Navin Kashyap, Qiaoqiao Zhou. 354-358 [doi]
• Well-rounded lattices for reliability and security in Rayleigh fading SISO channelsOliver Wilhelm Gnilke, Ha Thanh Nguyen Tran, Alex Karrila, Camilla Hollanti. 359-363 [doi]
• Optimal throughput for covert communication over a classical-quantum channelLigong Wang. 364-368 [doi]
• On lossy source coding with equivocation constraintsMeryem Benammar, Abdellatif Zaidi. 369-373 [doi]
• A lower bound on the entropy rate for a large class of stationary processes and its relation to the hyperplane conjectureMeik Dorpinghaus. 374-378 [doi]
• RSB decoupling property of MAP estimatorsAli Bereyhi, Ralf Muller, Hermann Schulz-Baldes. 379-383 [doi]
• A universal coding scheme for remote generation of continuous random variablesCheuk Ting Li, Abbas El Gamal. 384-388 [doi]
• Randomized Kaczmarz for rank aggregation from pairwise comparisonsVivek S. Borkar, Nikhil Karamchandani, Sharad Mirani. 389-393 [doi]
• Symmetric Metropolis-within-Gibbs algorithm for lattice Gaussian samplingZheng Wang 0013, Cong Ling. 394-398 [doi]
• A generalized erasure channel in the sense of polarization for binary erasure channelsYuta Sakai, Ken-ichi Iwata. 399-403 [doi]
• Hamming codes as error-reducing codesWilliam Rurik, Arya Mazumdar. 404-408 [doi]
• Balanced Reed-Solomon codes for all parametersWael Halbawi, Zihan Liu, Babak Hassibi. 409-413 [doi]
• Low-complexity Chase decoding of algebraic-geometric codes using Koetter's interpolationSiyuan Wu, Li Chen, Martin Johnston. 414-418 [doi]
• Channels with state information and mismatched decodingYafit Feldman, Anelia Somekh-Baruch. 419-423 [doi]
• Achieving super-resolution in multi-rate sampling systems via efficient semidefinite programmingMaxime Ferreira Da Costa, Wei Dai. 424-428 [doi]
• Sub-linear time compressed sensing for support recovery using left and right regular sparse-graph codesAvinash Vem, Nagaraj Thenkarai Janakiraman, Krishna R. Narayanan. 429-433 [doi]
• Efficient compression algorithm for file updates under random insertions and deletionsQiwen Wang, Muriel Médard, Mikael Skoglund. 434-438 [doi]
• The dispersion of the mean excess distortionYuval Kochman, Gregory W. Wornell. 439-443 [doi]
• Using compression codes in compressed sensingFarideh Ebrahim Rezagah, Shirin Jalali, Elza Erkip, H. Vincent Poor. 444-448 [doi]
• Zero-delay joint source-channel coding with a 1-bit ADC front end and receiver side informationMorteza Varasteh, Borzoo Rassouli, Osvaldo Simeone, Deniz Gündüz. 449-453 [doi]
• On ergodic fading Gaussian interference channels with statistical CSITPin-Hsun Lin, Eduard A. Jorswieck, Rafael F. Schaefer. 454-458 [doi]
• Algebraic lattices achieving the capacity of the ergodic fading channelAntonio Campello, Cong Ling, Jean-Claude Belfiore. 459-463 [doi]
• On the achievable degrees of freedom of the MIMO X-channel with delayed CSITAlexey Buzuverov, Hussein Al-Shatri, Anja Klein 0002. 464-468 [doi]
• Asymmetric degrees of freedom of the full-duplex MIMO 3-way channelAdel M. Elmahdy, Amr El-Keyi, Yahya Mohasseb, Tamer A. ElBatt, Mohammed Nafie, Karim G. Seddik. 469-473 [doi]
• Approximate capacity of the Gaussian interference channel with noisy channel-output feedbackVictor Quintero, Samir Medina Perlaza, Inaki Esnaola, Jean-Marie Gorce. 474-478 [doi]