Abstract is missing.
- Generalized Reed-Solomon Codes with Sparsest and Balanced Generator MatricesWentu Song, Kui Cai. 1-5 [doi]
- A Linear Algebraic Approach to Subfield Subcodes of GRS CodesChristian Senger, Rohit Bohara. 6-10 [doi]
- Progressive Algebraic Soft Decoding of Reed-Solomon Codes Using Module MinimizationJiongyue Xing, Li Chen, Martin Bossert. 11-15 [doi]
- Further Progress on the GM-MDS Conjecture for Reed-Solomon CodesHikmet Yildiz, Babak Hassibi. 16-20 [doi]
- Universal Batch Learning with Log-LossYaniv Fogel, Meir Feder. 21-25 [doi]
- The Informativeness of k-Means for Learning Mixture ModelsZhaoqiang Liu, Vincent Y. F. Tan. 26-30 [doi]
- Sparsity-based Defense Against Adversarial Attacks on Linear ClassifiersZhinus Marzi, Soorya Gopalakrishnan, Upamanyu Madhow, Ramtin Pedarsani. 31-35 [doi]
- Sparse Coding and AutoencodersAkshay Rangamani, Anirbit Mukherjee, Amitabh Basu, Ashish Arora, Tejaswini Ganapathi, Sang Peter Chin, Trac D. Tran. 36-40 [doi]
- Fog Massive MIMO with On-the-Fly Pilot Contamination ControlRatheesh Kumar Mungara, Giuseppe Caire, Ozgun Y. Bursalioglu, Chenwei Wang, Haralabos C. Papadopoulos. 41-45 [doi]
- Coverage Analysis in Cellular Networks with Planar and Vehicular Base StationsChang-sik Choi, François Baccelli. 46-50 [doi]
- Trajectory Processes that Preserve Uniformity: A Stochastic Geometry PerspectiveSaeede Enayati, Hamid Saeedi, Hossein Pishro-Nik. 51-55 [doi]
- Asymptotic Analysis of Area Spectral Efficiency in Dense Cellular NetworksAhmad AlAmmouri, Jeffrey G. Andrews, François Baccelli. 56-60 [doi]
- Multiple Orthogonal Least Squares for Joint Sparse RecoveryJunhan Kim, Byonghyo Shim. 61-65 [doi]
- Success Probability of a Suboptimal Solution to the Sparse MAP DetectionXiao-Wen Chang, Victor Jukic Prevost. 66-70 [doi]
- Single Letter Formulas for Quantized Compressed Sensing with Gaussian CodebooksAlon Kipnis, Galen Reeves, Yonina C. Eldar. 71-75 [doi]
- Sep]ration-Free Super-Resolution from Compressed Measurements is Possible: an Orthonormal Atomic Norm Minimization ApproachWeiyu Xu, Jirong Yi, Soura Dasgupta, Jian-Feng Cai, Mathews Jacob, Myung Cho. 76-80 [doi]
- Descent Moment Distributions for Permutation Deletion Codes via Levenshtein CodesManabu Hagiwara, Justin Kong. 81-85 [doi]
- On the List Decodability of Insertions and DeletionsTomohiro Hayashi, Kenji Yasunaga. 86-90 [doi]
- Efficient Systematic Encoding of Non-binary VT CodesMahed Abroshan, Ramji Venkataramanan, Albert Guillén i Fàbregas. 91-95 [doi]
- Codes Correcting Limited-Shift Errors in Racetrack MemoriesYeow Meng Chee, Han Mao Kiah, Alexander Vardy, Van Khu Vu, Eitan Yaakobi. 96-100 [doi]
- Rate-Distortion Theory for General Sets and MeasuresErwin Riegler, Helmut Bölcskei, Günther Koliander. 101-105 [doi]
- Variable Packet-Error Coding: the Point-to-Point CaseXiaoqing Fan, Aaron B. Wagner. 106-110 [doi]
- Joint State Sensing and Communication: Optimal Tradeoff for a Memoryless CaseMari Kobayashi, Giuseppe Caire, Gerhard Kramer. 111-115 [doi]
- Discrete Reconstruction Alphabets in Discrete Memoryless Source Rate-Distortion ProblemsMustafa Sungkar, Toby Berger. 116-120 [doi]
- A Useful Analogy Between Wiretap and Gelfand - Pinsker ChannelsZiv Goldfeld, Haim H. Permuter. 121-125 [doi]
- On the Direction of Discrimination: An Information-Theoretic Analysis of Disparate Impact in Machine LearningHao Wang, Berk Ustun, Flávio du Pin Calmon. 126-130 [doi]
- Inner Bound for the Capacity Region of Noisy Channels with an Authentication RequirementJake B. Perazzone, Eric Graves, Paul L. Yu, Rick S. Blum. 126-130 [doi]
- A Coding Scheme for Colored Gaussian Wiretap Channels with FeedbackChong Li, Yingbin Liang, H. Vincent Poor, Shlomo Shamai. 131-135 [doi]
- Key-Message Security over State-Dependent Wiretap ChannelsAlexander Bunin, Ziv Goldfeld, Haim H. Permuter, Shlomo Shamai, Paul Cuff, Pablo Piantanida. 136-140 [doi]
- Computing the Unique InformationPradeep Kr. Banerjee, Johannes Rauh, Guido Montúfar. 141-145 [doi]
- Dynamic Programming Approach of Optimal Upgradation Algorithm for an Auxiliary Random Variable of a Bernoulli Random VariableYuta Sakai, Ken-ichi Iwata. 146-150 [doi]
- New Results on the Equality of Exact and Wyner Common Information RatesBadri N. Vellambi, Jörg Kliewer. 151-155 [doi]
- Wyner's Common Information under Renyi Divergence MeasuresLei Yu 0003, Vincent Y. F. Tan. 156-160 [doi]
- Symmetric Generalized Gaussian Multiterminal Source CodingJun Chen 0005, Li Xie, Yameng Chang, Jia Wang, Yizhong Wang. 161-165 [doi]
- Distributed Hypothesis Testing with Concurrent DetectionsPierre Escamilla, Michele A. Wigger, Abdellatif Zaidi. 166-170 [doi]
- The Quadratic Gaussian One-Help-Two Source-Coding Problem with MarkovityOmer Bilgen, Aaron B. Wagner. 171-175 [doi]
- Fairness in Supervised Learning: An Information Theoretic ApproachAmirEmad Ghassami, Sajad Khodadadian, Negar Kiyavash. 176-180 [doi]
- Testing Against Conditional Independence Under Security ConstraintsSreejith Sreekumar, Deniz Gündüz. 181-185 [doi]
- Privacy-Utility Trade-off of Linear Regression under Random Projections and Additive NoiseMehrdad Showkatbakhsh, Can Karakus, Suhas N. Diggavi. 186-190 [doi]
- Physical Layer Secure Communications over Wireless Channels via Common ZerosPhilipp Walk, Urbashi Mitra. 191-195 [doi]
- Secure Communication over 1-2-1 NetworksGaurav Kumar Agarwal, Yahya H. Ezzeldin, Christina Fragouli, Martina Cardone. 196-200 [doi]
- On the Secure Degrees of Freedom of the K-user Interference Channel with Delayed CSITMohamed Seif, Ravi Tandon, Ming Li. 201-205 [doi]
- Universal Compression, List Decoding, and Logarithmic LossYanina Shkel, Maxim Raginsky, Sergio Verdú. 206-210 [doi]
- Redundancy of Unbounded Memory Markov Classes with Continuity ConditionsChanglong Wu, Maryam Hosseini, Narayana Santhanam. 211-215 [doi]
- Minimax Redundancy for Markov Chains with Large State SpaceKedar Tatwawadi, Jiantao Jiao, Tsachy Weissman. 216-220 [doi]
- Typicality Matching for Pairs of Correlated GraphsFarhad Shirani, Siddharth Garg, Elza Erkip. 221-225 [doi]
- Channel Input Adaptation via Natural Type SelectionSergey Tridenski, Ram Zamir. 226-230 [doi]
- Variations on the Guessing ProblemRobert Graczyk, Amos Lapidoth. 231-235 [doi]
- Multicast Networks Solvable over Every Finite FieldNiranjana Ambadi. 236-240 [doi]
- Grassmannian Codes with New Distance Measures for Network CodingTuvi Etzion, Hui Zhang. 241-245 [doi]
- On the Langberg-Médard k-Unicast Conjecture with $k=3, 4$Kai Cai, Guangyue Han. 246-250 [doi]
- Superadditivity in Trade-Off Capacities of Quantum ChannelsElton Yechao Zhu, Quntao Zhuang, Min-Hsiu Hsieh, Peter W. Shor. 251-255 [doi]
- Identification over Channels with Feedback: Discontinuity Behavior and Super-ActivationHolger Boche, Rafael F. Schaefer, H. Vincent Poor. 256-260 [doi]
- Asymptotically Decoupling and Mixing Properties in Quantum SystemYuuya Yoshida, Masahito Hayashi. 261-265 [doi]
- Boolean Functions: Noise Stability, Non-Interactive Correlation, and Mutual InformationJiange Li, Muriel Médard. 266-270 [doi]
- Guessing with a Boolean HelperNir Weinberger, Ofer Shayevitz. 271-275 [doi]
- Self-Predicting Boolean FunctionsNir Weinberger, Ofer Shayevitz. 276-280 [doi]
- A Relaying Graph and Special Strong Product for Zero-Error Problems in Primitive Relay ChannelsMeysam Asadi, Kenneth Palacio-Bans, Natasha Devroye. 281-285 [doi]
- Error-Free Communication Over State-Dependent Channels with Variable-Length FeedbackCarol Wang, Mladen Kovacevic 0001, Vincent Y. F. Tan. 286-290 [doi]
- Separable Codes for the Symmetric Multiple-Access ChannelArkadii G. D'yachkov, Nikita Polyanskii, Vladislav Yu. Shchukin, Ilya Vorobyev. 291-295 [doi]
- One-shot Capacity Bounds on the Simultaneous Transmission of Public and Private Information Over Quantum ChannelsFarzin Salek, Anurag Anshu, Min-Hsiu Hsieh, Rahul Jain 0001, Javier R. Fonollosa. 296-300 [doi]
- Dual Capacity Upper Bounds for Binary-input ISI and Constrained BIBO ChannelsAjay Mohanan, Aswin Rajagopalan, Andrew Thangaraj. 301-305 [doi]
- Sum-Rate Capacity for Symmetric Gaussian Multiple Access Channels with FeedbackErixhen Sula, Michael Gastpar, Gerhard Kramer. 306-310 [doi]
- Almost Optimal Scaling of Reed-Muller Codes on BEC and BSC ChannelsS. Hamed Hassani, Shrinivas Kudekar, Or Ordentlich, Yury Polyanskiy, Rüdiger L. Urbanke. 311-315 [doi]
- Diversity Combining via Universal Dimension-Reducing Space-Time TransformationsElad Domanovitz, Uri Erez. 316-320 [doi]
- Bit-wise Sequential Coding with FeedbackSung-En Chiu, Anusha Lalitha, Tara Javidi. 321-325 [doi]
- Improved Bounds for Minimax Risk of Estimating Missing MassJayadev Acharya, Yelun Bao, Yuheng Kang, Ziteng Sun. 326-330 [doi]
- On Identifying a Massive Number of DistributionsSara Shahi, Daniela Tuninetti, Natasha Devroye. 331-335 [doi]
- Unlimited Sampling of Sparse Sinusoidal MixturesAyush Bhandari, Felix Krahmer, Ramesh Raskar. 336-340 [doi]
- On Multiuser Systems with Queue-Length Dependent Service QualityDaewon Seo, Avhishek Chatterjee, Lav R. Varshney. 341-345 [doi]
- The Explicit Coding Rate Region of Symmetric Multilevel Diversity CodingTao Guo, Raymond W. Yeung. 346-350 [doi]
- A New Coding Paradigm for the Primitive Relay ChannelMarco Mondelli, S. Hamed Hassani, Rüdiger L. Urbanke. 351-355 [doi]
- A Multi-Hop Framework for Multi-Source Multi-Relay All-Cast ChannelsJonathan Ponniah, Liang-Liang Xie. 356-360 [doi]
- Maximum Entropy Low-Rank Matrix RecoverySimon Mak, Yao Xie. 361-365 [doi]
- Low Permutation-Rank Matrices: Structural Properties and Noisy CompletionNihar B. Shah, Sivaraman Balakrishnan, Martin J. Wainwright. 366-370 [doi]
- Fast Low-Rank Matrix Estimation for Ill-Conditioned MatricesMohammadreza Soltani, Chinmay Hegde. 371-375 [doi]
- Provable Dynamic Robust PCA or Robust Subspace TrackingPraneeth Narayanamurthy, Namrata Vaswani. 376-380 [doi]
- Improved Scaling Law for Activity Detection in Massive MIMO SystemsSaeid Haghighatshoar, Peter Jung 0001, Giuseppe Caire. 381-385 [doi]
- Multi-Band Covariance Interpolation with Applications in Massive MIMOSaeid Haghighatshoar, Mahdi Barzegar Khalilsarai, Giuseppe Caire. 386-390 [doi]
- Spatially-Stationary Propagating Random Field Model for Massive MIMO Small-Scale FadingThomas L. Marzetta. 391-395 [doi]
- Joint User Scheduling, Power Allocation, and Precoding Design for Massive MIMO Systems: A Principal Component Analysis ApproachJiwook Choi, Namyoon Lee, Song-Nam Hong, Giuseppe Caire. 396-400 [doi]
- Performance Analysis of L1-Norm Minimization for Compressed Sensing with Non-Zero-Mean Matrix ElementsToshiyuki Tanaka. 401-405 [doi]
- Empirical Bayes Estimators for Sparse SequencesK. Pavan Srinath, Ramji Venkataramanan. 406-410 [doi]
- A Note on Reductions Between Compressed Sensing GuaranteesTom Morgan, Jelani Nelson. 411-415 [doi]
- Compressive Imaging Via One-Shot MeasurementsShirin Jalali, Xin Yuan. 416-420 [doi]
- Two Deletion Correcting Codes from Indicator VectorsJin Sima, Netanel Raviv, Jehoshua Bruck. 421-425 [doi]
- Codes Correcting Two DeletionsRyan Gabrys, Frederic Sala. 426-430 [doi]
- Weight Enumerators of Some Classes of Deletion Correcting CodesKhodakhast Bibak, Olgica Milenkovic. 431-435 [doi]
- On Maximum Likelihood Reconstruction over Multiple Deletion ChannelsSundara Rajan Srinivasavaradhan, Michelle Du, Suhas N. Diggavi, Christina Fragouli. 436-440 [doi]
- Linear Codes for Broadcasting with Noisy Side Information: Bounds and Code ConstructionsSuman Ghosh, Lakshmi Natarajan. 441-445 [doi]
- On Locally Decodable Index CodesLakshmi Natarajan, Prasad Krishnan, V. Lalitha. 446-450 [doi]
- Layered Space- Time Index CodingYu-Chih Huang, Yi Hong 0001, Emanuele Viterbo, Lakshmi Natarajan. 451-455 [doi]
- Simplified Composite Coding for Index CodingYucheng Liu, Parastoo Sadeghi, Fatemeh Arbabjolfaei, Young-Han Kim 0001. 456-460 [doi]
- The Arbitrarily Varying Relay ChannelUzi Pereg, Yossef Steinberg. 461-465 [doi]
- Arbitrarily Varying Wiretap Channel: a New Scheme for the Proof of Strong SecrecyDan He, Yuan Luo, Wangmei Guo. 466-470 [doi]
- Capacity of the Gaussian Arbitrarily-Varying Channel with List DecodingFatemeh Hosseinigoki, Oliver Kosut. 471-475 [doi]
- Explicit Codes for the Wiretap Channel with Uncertainty on the Eavesdropper's ChannelRemi A. Chou. 476-480 [doi]
- Low-Density Parity-Check Codes over Finite Gaussian Integer FieldsDaniel Rohweder, Jürgen Freudenberger, Sergo Shavgulidze. 481-485 [doi]
- A Message-Passing Algorithm for Counting Short Cycles in Nonbinary LDPC CodesSunghye Cho, Kyungwhoon Cheun, Kyeongcheol Yang. 486-490 [doi]
- Rank Analysis of Parity-Check Matrices for Quasi-Cyclic LDPC CodesPo-Chun Yang, Chung-Hsuan Wang, Chi-Chao Chao. 491-495 [doi]
- EBP-GEXIT Charts Over the Binary-Input AWGN Channel for Generalized and Doubly-Generalized LDPC CodesArti D. Yardi, Iryna Andriyanova, Charly Poulliat. 496-500 [doi]
- Decentralized Chernoff Test in Sensor NetworksAnshuka Rangi, Massimo Franceschetti, Stefano Maranò 0001. 501-505 [doi]
- Distributed Statistical Estimation of High-Dimensional and Nonparametric DistributionsYanjun Han, Pritam Mukherjee, Ayfer Özgür, Tsachy Weissman. 506-510 [doi]
- Distributed Estimation of Gaussian CorrelationsUri Hadar, Ofer Shayevitz. 511-515 [doi]
- CREDO: A Communication-Efficient Distributed Estimation AlgorithmAnit Kumar Sahu, Dusan Jakovetic, Soummya Kar. 516-520 [doi]
- Entropy Under Additive Bernoulli and Spherical NoisesOr Ordentlich, Yury Polyanskiy. 521-525 [doi]
- Information Bottleneck on General AlphabetsGeorg Pichler, Günther Koliander. 526-530 [doi]
- Generalizing Bottleneck ProblemsHsiang Hsu, Shahab Asoodeh, Salman Salamatian, Flávio du Pin Calmon. 531-535 [doi]
- Regularized Discriminant Analysis: A Large Dimensional StudyXiaoke Yang, Khalil Elkhalil, Abla Kammoun, Tareq Y. Al-Naffouri, Mohamed-Slim Alouini. 536-540 [doi]
- Minimax Learning for Remote PredictionCheuk Ting Li, Xiugang Wu, Ayfer Özgür, Abbas El Gamal. 541-545 [doi]
- Generalization Error Bounds for Noisy, Iterative AlgorithmsAnkit Pensia, Varun Jog, Po-Ling Loh. 546-550 [doi]
- Optimal Active Sensing for Process TrackingArpan Chattopadhyay, Urbashi Mitra. 551-555 [doi]
- Design of Discrete Constellations for Peak-Power-Limited complex Gaussian ChannelsWasim Huleihel, Ziv Goldfeld, Tobias Koch, Mokshay M. Madiman, Muriel Médard. 556-560 [doi]
- Estimation in the Group Action ChannelEmmanuel Abbe, João M. Pereira, Amit Singer. 561-565 [doi]
- Improved Bounds on Guessing Moments via Rényi MeasuresIgal Sason, Sergio Verdú. 566-570 [doi]
- Generalized Estimating Equation for the Student-t DistributionsAtin Gayen, M. Ashok Kumar. 571-575 [doi]
- Computable Bounds on the Exploration BiasIbrahim Issa, Michael Gastpar. 576-580 [doi]
- Information Theoretical Analysis of Side-Channel Attacks to the Shannon Cipher SystemYasutada Oohama, Bagus Santoso. 581-585 [doi]
- Noisy Feedback and Loss Unlimited Private CommunicationDawei Ding, Saikat Guha. 586-590 [doi]
- The Role of Interaction and Common Randomness in Two-User Secure ComputationGowtham R. Kurri, Vinod M. Prabhakaran, Jithin Ravi. 591-595 [doi]
- Private Index CodingVarun Narayanan, Vinod M. Prabhakaran, Jithin Ravi, Vivek K. Mishra, Bikash Kumar Dey, Nikhil Karamchandani. 596-600 [doi]
- A New Upperbound on the Broadcast Rate and Near-Optimal Vector Linear Codes for Index Coding Problems with Symmetric Neighboring InterferenceMahesh Babu Vaddi, B. Sundar Rajan. 601-605 [doi]
- On the Conjectures on Optimality of Index Codes from Interlinked Cycle Cover SchemeMahesh Babu Vaddi, B. Sundar Rajan. 606-610 [doi]
- Quadratically Constrained Myopic Adversarial ChannelsYihan Zhang, Shashank Vatedka, Sidharth Jaggi, Anand D. Sarwate. 611-615 [doi]
- Communication over an Arbitrarily Varying Channel under a State-Myopic EncoderAmitalok J. Budkuley, Sidharth Jaggi. 616-620 [doi]
- Quadratically Constrained Channels with Causal AdversariesTongxin Li, Bikash Kumar Dey, Sidharth Jaggi, Michael Langberg, Anand D. Sarwate. 621-625 [doi]
- Low-Complexity Multilevel LDPC Lattices and a a Generalization of Construction $\mathrm{D}^{\prime}$Paulo Ricardo Branco da Silva, Danilo Silva. 626-630 [doi]
- Concatenated Spatially Coupled LDPC Codes for Joint Source-Channel CodingAhmad Golmohammadi, David G. M. Mitchell. 631-635 [doi]
- Construction of Multiple-Burst-Correction Codes in Transform DomainQin Huang, Liyuan Song, Zulin Wang. 636-640 [doi]
- PCA in Sparse Data-Dependent NoiseNamrata Vaswani, Praneeth Narayanamurthy. 641-645 [doi]
- Correction of Simultaneous Bad Measurements by Exploiting the Low-rank Hankel StructureShuai Zhang, Meng Wang 0003. 646-650 [doi]
- Fundamental Limits of Database AlignmentDaniel Cullina, Prateek Mittal, Negar Kiyavash. 651-655 [doi]
- Comparing Massive Networks via Moment MatricesHayoung Choi, Yifei Shen, Yuanming Shi. 656-660 [doi]
- Permuted Linear Model for Header-Free Communication via Symmetric PolynomialsXuming Song, Hayoung Choi, Yuanming Shi. 661-665 [doi]
- Nonconvex Demixing from Bilinear MeasurementsJialin Dong, Yuanming Shi. 666-670 [doi]
- Guessing noise, not code-wordsKen R. Duffy, Jiange Li, Muriel Médard. 671-675 [doi]
- Approximate Enumerative Sphere ShapingYunus Can Gultekin, Frans M. J. Willems, Wim J. van Houtum, Semih Serbetli. 676-680 [doi]
- Fundamental Limits on Data Acquisition: Trade-offs Between Sample Complexity and Query DifficultyHye Won Chung, Ji Oon Lee, Alfred O. Hero III. 681-685 [doi]
- Some Properties of Successive Minima and Their ApplicationsJinming Wen. 686-690 [doi]
- Maximal Guessing Coupling and Its ApplicationsLei Yu. 691-695 [doi]
- Preserving Privacy and Fidelity via Ehrhart TheoryArun Padakandla, P. R. Kumar, Wojciech Szpankowski. 696-700 [doi]
- A Tunable Measure for Information LeakageJiachun Liao, Oliver Kosut, Lalitha Sankar, Flávio du Pin Calmon. 701-705 [doi]
- The Utility Cost of Robust Privacy GuaranteesHao Wang, Mario Diaz, Flavio P. Calmon, Lalitha Sankar. 706-710 [doi]
- Coded Computation Against Straggling Decoders for Network Function VirtualizationMalihe Aliasgari, Jörg Kliewer, Osvaldo Simeone. 711-715 [doi]
- On the Fundamental Limits of Coded Data ShufflingAdel Elmahdy, Soheil Mohajer. 716-720 [doi]
- Approximately Optimal Distributed Data ShufflingMohamed Adel Attia, Ravi Tandon. 721-725 [doi]
- A New Combinatorial Design of Coded Distributed ComputingNicholas Woolsey, Rong-Rong Chen, Mingyue Ji. 726-730 [doi]
- Convergence of Binarized Context-tree Weighting for Estimating Distributions of Stationary SourcesBadri N. Vellambi, Marcus Hutter. 731-735 [doi]
- Non-parametric Estimation of Mutual Information with Application to Nonlinear Optical FibersTommaso Catuogno, Menelaos Ralli Camara, Marco Secondini. 736-740 [doi]
- Lower Bounds on Exponential Moments of the Quadratic Error in Parameter EstimationNeri Merhav. 741-745 [doi]
- Information Geometric Approach to Bayesian Lower Error BoundsM. Ashok Kumar, Kumar Vijay Mishra. 746-750 [doi]
- The Capacity of Anonymous CommunicationsHua Sun. 751-755 [doi]
- The Continuous-Time Poisson Channel Has Infinite Covert Communication CapacityLigong Wang. 756-760 [doi]
- Multipath Stealth Communication with JammersJianhan Song, Qiaosheng Eric Zhang, Mayank Bakshi, Sidharth Jaggi, Swanand Kadhe. 761-765 [doi]
- Covert Communication over a Physically Degraded Relay Channel with Non-Colluding WardensKeerthi Suria Kumar Arumugam, Matthieu R. Bloch, Ligong Wang. 766-770 [doi]
- Device-to-Device Aided MulticastingThomas Varela Santana, Richard Combes, Mari Kobayashi. 771-775 [doi]
- Density-Based Multiple Access for Detection in Wireless Sensor NetworksKobi Cohen, Amir Leshem. 776-780 [doi]
- ARQ for Interference Packet NetworksAlireza Vahid, A. Robert Calderbank. 781-785 [doi]
- Cost of Path Loss and Local Cooperation in Capacity Scaling of Extended Wireless NetworksJinfeng Du, Muriel Médard, Shlomo Shamai Shitz. 786-790 [doi]
- Synthesis of Logical Clifford Operators via Symplectic GeometryNarayanan Rengaswamy, A. Robert Calderbank, Henry D. Pfister, Swanand Kadhe. 791-795 [doi]
- Hybrid CodesAndrew Nemec, Andreas Klappenecker. 796-800 [doi]
- A new construction of Quantum Error Correcting codes based on Difference SetTejas Gandhi. 801-805 [doi]
- Expected Communication Cost of Distributed Quantum TasksAnurag Anshu, Ankit Garg, Aram Wettroth Harrow, Penghui Yao. 806-810 [doi]
- The Stability Condition of LDPC Codes Under MAP DecodingWei Liu, Rüdiger L. Urbanke. 811-815 [doi]
- m)Ji Zhang, Baoming Bai, Dixia Deng, Min Zhu, Hengzhou Xu, Mengsheng Guan. 816-820 [doi]
- Elimination of Cyclic Stopping Sets for Enhanced Decoding of LDPC CodesAnxiao Jiang. 821-825 [doi]
- Performance Bounds for Quantized Spatially Coupled LDPC Decoders Based on Absorbing SetsHomayoon Hatami, David G. M. Mitchell, Daniel J. Costello Jr., Thomas E. Fuja. 826-830 [doi]
- Privacy in Index Coding: Improved Bounds and Coding SchemesMohammed Karmoose, Linqi Song, Martina Cardone, Christina Fragouli. 831-835 [doi]
- Network Error Correction Coding for Time-Varying Adversarial Errors in a Unicast NetworkWangmei Guo, Dan He, Ning Cai 0001. 836-840 [doi]
- Secure Network-Index Code Equivalence: Extension to Non-zero Error and LeakageLawrence Ong, Jörg Kliewer, Badri N. Vellambi. 841-845 [doi]
- Trade-offs between Rate and Security in Linear Multicast Network CodingDebaditya Chaudhuri, Michael Langberg. 846-850 [doi]
- Fast Polarization for Processes with MemoryBoaz Shuval, Ido Tal. 851-855 [doi]
- Asymptotic Distribution of Multilevel Channel Polarization for a Certain Class of Erasure ChannelsYuta Sakai, Ken-ichi Iwata, Hiroshi Fujisaki. 856-860 [doi]
- Information Coupled Polar CodesXiaowei Wu, Lei Yang 0027, Jinhong Yuan. 861-865 [doi]
- SWIPT Signalling over Complex AWGN Channels with Two Nonlinear Energy Harvester ModelsMorteza Varasteh, Borzoo Rassouli, Hamdi Joudeh, Bruno Clerckx. 866-870 [doi]
- Non-Asymptotic Achievable Rates for Gaussian Energy-Harvesting Channels: Best-Effort and Save-and-TransmitSilas L. Fong, Jing Yang 0002, Aylin Yener. 871-875 [doi]
- Achieving the Age-Energy Tradeoff with a Finite-Battery Energy Harvesting SourceBaran Tan Bacinoglu, Yin Sun, Elif Uysal-Biyikoglu, Volkan Mutlu. 876-880 [doi]
- Cumulant Generating Function of Codeword Lengths in Variable-Length Lossy Compression Allowing Positive Excess Distortion ProbabilityShota Saito, Toshiyasu Matsushima. 881-885 [doi]
- Fairness in Multiterminal Data Compression: Decomposition of Shapley ValueNi Ding, David Smith, Thierry Rakotoarivelo, Parastoo Sadeghi. 886-890 [doi]
- On Universal Compression with Constant Random AccessKedar Tatwawadi, Shirin Saeedi Bidokhti, Tsachy Weissman. 891-895 [doi]
- Bounds on Information Combining with Quantum Side InformationChristoph Hirche, David Reeb. 896-900 [doi]
- A Tight Converse to the Spectral Resolution Limit via Convex ProgrammingMaxime Ferreira Da Costa, Wei Dai. 901-905 [doi]
- Bounds on the Zero-Error List-Decoding Capacity of the q/(q-1) ChannelSiddharth Bhandari, Jaikumar Radhakrishnan. 906-910 [doi]
- Causal Asymmetric State Communication Over the Degraded Broadcast ChannelShraga I. Bross. 911-915 [doi]
- The Capacity of the Optical Broadcast Channel with Peak and Average Intensity ConstraintsMorteza Soltani, Zouheir Rezki. 916-920 [doi]
- Transmitting Arbitrary Sources with Finite Error Over a Broadcast Channel with Confidential CommunicationsEric Graves, Tan F. Wong. 921-925 [doi]
- Bayesian Learning with Random ArrivalsTho Ngoc Le, Vijay G. Subramanian, Randall A. Berry. 926-930 [doi]
- Online Learning with Graph-Structured Feedback against Adaptive AdversariesZhili Feng, Po-Ling Loh. 931-935 [doi]
- On the Universality of the Logistic Loss FunctionAmichai Painsky, Gregory W. Wornell. 936-940 [doi]
- The Decoding Failure Probability of MDPC CodesJean-Pierre Tillich. 941-945 [doi]
- Structural Properties of Twisted Reed-Solomon Codes with Applications to CryptographyPeter Beelen, Martin Bossert, Sven Puchinger, Johan Rosenkilde. 946-950 [doi]
- Hindering Reaction Attacks by Using Monomial Codes in the McEliece CryptosystemPaolo Santini, Marco Baldi, Giovanni Cancellieri, Franco Chiaraluce. 951-955 [doi]
- Generalized Optimal Storage Scaling via Network CodingYuchong Hu, Xiaoyang Zhang, Patrick P. C. Lee, Pan Zhou. 956-960 [doi]
- Lattice Erasure Codes of Low Rank with Noise MarginsVinay A. Vaishampayan. 961-965 [doi]
- An MDS-PIR Capacity-Achieving Protocol for Distributed Storage Using Non-MDS Linear CodesHsuan-Yin Lin, Siddhartha Kumar, Eirik Rosnes, Alexandre Graell i Amat. 966-970 [doi]
- Private Information Retrieval Through Wiretap Channel IIKarim A. Banawan, Sennur Ulukus. 971-975 [doi]
- A Precise Analysis of PhaseMax in Phase RetrievalFariborz Salehi, Ehsan Abbasi, Babak Hassibi. 976-980 [doi]
- Attack on the Edon-kKey Encapsulation MechanismMatthieu Lequesne, Jean-Pierre Tillich. 981-985 [doi]
- Minimum Guesswork with an Unreliable OracleNatan Ardimanov, Ofer Shayevitz, Itzhak Tamo. 986-990 [doi]
- Secret Sharing over a Public Channel from Correlated Random VariablesRemi A. Chou. 991-995 [doi]
- Uncertainty Principle for Quantum ChannelsLi Gao, Marius Junge, Nicholas LaRacuente. 996-1000 [doi]
- Learning Algorithms for Minimizing Queue Length RegretThomas Stahlbuhk, Brooke Shrader, Eytan Modiano. 1001-1005 [doi]
- Skyline Identification in Multi-Arm BanditsAlbert Cheu, Ravi Sundaram, Jonathan Ullman. 1006-1010 [doi]
- A Joint Detection and Decoding Receiver Design for Polar Coded MIMO Wireless TransmissionsAmin Jalali 0005, Zhi Ding 0001. 1011-1015 [doi]
- Spatially Coupled Sparse Regression Codes: Design and State Evolution AnalysisKuan Hsieh, Cynthia Rush, Ramji Venkataramanan. 1016-1020 [doi]
- Asymptotic Analysis on Spatial Coupling Coding for Two-Way Relay ChannelsSatoshi Takabe, Yuta Ishimatsu, Tadashi Wadayama, Masahito Havashi. 1021-1025 [doi]
- The DMT Classification of Real and Quaternionic Lattice CodesLaura Luzzi, Roope Vehkalahti. 1026-1030 [doi]
- Lossy Communication Subject to Statistical Parameter PrivacyGermán Bassi, Mikael Skoglund, Pablo Piantanida. 1031-1035 [doi]
- Privacy Against Statistical Matching: Inter-User CorrelationNazanin Takbiri, Amir Houmansadr, Dennis L. Goeckel, Hossein Pishro-Nik. 1036-1040 [doi]
- Minimax Optimal Additive Functional Estimation with Discrete Distribution: Slow Divergence Speed CaseKazuto Fukuchi, Jun Sakuma. 1041-1045 [doi]
- Data Privacy for a ρ-Recoverable FunctionAjaykrishnan Nageswaran, Prakash Narayan. 1046-1050 [doi]
- On the Identifiability of Parameters in the Population Stratification Problem: A Worst-Case AnalysisBehrooz Tahmasebi, Abolfazl S. Motahari, Mohammad Ali Maddah-Ali. 1051-1055 [doi]
- On the Fundamental Limits of Heterogeneous Distributed Detection: Price of AnonymityWei-Ning Chen, Ho-Chun Chen, I-Hsiang Wang. 1056-1060 [doi]
- Large Deviations for Products of Non-I.i.d. Stochastic Matrices with Application to Distributed DetectionDragana Bajovic, Dusan Jakovetic, Anit Kumar Sahu, Soummya Kar. 1061-1065 [doi]
- On the Reliability Function of Distributed Hypothesis Testing Under Optimal DetectionNir Weinberger, Yuval Kochman. 1066-1070 [doi]
- Effective Memory Shrinkage in EstimationAyush Jain, Himanshu Tyagi. 1071-1075 [doi]
- Adaptive Estimation of Generalized Distance to UniformityYi Hao, Alon Orlitsky. 1076-1080 [doi]
- On the Structure of the Least Favorable Prior DistributionsAlex Dytso, H. Vincent Poor, Ronit Bustin, Shlomo Shamai. 1081-1085 [doi]
- Sharp Gaussian Approximation Bounds for Linear Systems with $\alpha$ -stable NoiseMarina Riabiz, Tohid Ardeshiri, Ioannis Kontoyiannis, Simon J. Godsill. 1086-1090 [doi]
- Hybrid NOMA-TDMA for Multiple Access Channels with Non-Ideal Batteries and Circuit CostRajshekhar Vishweshwar Bhat, Mehul Motani, Teng Joon Lim. 1091-1095 [doi]
- Simple Bounds for the Symmetric Capacity of the Rayleigh Fading Multiple Access ChannelElad Domanovitz, Uri Erez. 1096-1100 [doi]
- Energy-limited Massive Random Access via Noisy Group TestingHuseyin A. Inan, Peter Kairouz, Ayfer Özgür. 1101-1105 [doi]
- Sparse NOMA: A Closed-Form CharacterizationBenjamin M. Zaidel, Ori Shental, Shlomo Shamai Shitz. 1106-1110 [doi]
- The Reliability Function of Lossy Source-Channel Coding of Variable-Length Codes with FeedbackLan V. Truong, Vincent Y. F. Tan. 1111-1115 [doi]
- Feedback Increases the Capacity of QueuesLaure Aptel, Aslan Tchamkerten. 1116-1120 [doi]
- Graph-based Encoders and their Achievable Rates for Channels with FeedbackOron Sabag, Bashar Huleihel, Haim H. Permuter. 1121-1125 [doi]
- Bounds on the Effective-length of Optimal Codes for Interference Channel with FeedbackMohsen Heidari, Farhad Shirani Chaharsooghi, S. Sandeep Pradhan. 1126-1130 [doi]
- Leakage-Resilient Algebraic Manipulation Detection Codes with Optimal ParametersDivesh Aggarwal, Tomasz Kazana, Maciej Obremski. 1131-1135 [doi]
- A Lower Bound on the Joint Capacity of Digital Fingerprinting Codes Using Score Functions Based on Log-Likelihood RatioHiroki Koga. 1136-1140 [doi]
- Distributed Multi-User Secret SharingMahdi Soleymani, Hessam Mahdavifar. 1141-1145 [doi]
- Wiretap Polar Codes in Encryption Schemes Based on Learning with Errors ProblemAswin Rajagopalan, Andrew Thangaraj, Shweta Agrawal. 1146-1150 [doi]
- LDPC Codes with Local and Global DecodingEshed Ram, Yuval Cassuto. 1151-1155 [doi]
- Reliability-Based-Layered Belief Propagation for Iterative Decoding of LDPC CodesRong Sun, Xiaogeng Hou, Jingyuan Sun, Hao Guan, Zhuyan Zhao. 1156-1160 [doi]
- Improved Redundant Parity-Check Based BP Decoding of LDPC CodesIrina E. Bocharova, Boris D. Kudryashov, Vitaly Skachek, Yauhen Yakimenka. 1161-1165 [doi]
- Linear Rate-Compatible Codes with Degree-1 Extending Variable Nodes Under Iterative DecodingSudarsan V. S. Ranganathan, Richard D. Wesel, Dariush Divsalar. 1166-1170 [doi]
- Mixed Delay Constraints in Wyner's Soft-Handoff NetworkHoma Nikbakht, Michele A. Wigger, Shlomo Shamai Shitz. 1171-1175 [doi]
- A Systematic Approach to Incremental Redundancy over Erasure ChannelsAnoosheh Heidarzadeh, Jean-François Chamberland, Parimal Parag, Richard D. Wesel. 1176-1180 [doi]
- A Monetary Mechanism for Stabilizing Cooperative Data Exchange with Selfish UsersAnoosheh Heidarzadeh, Ishan Tyagi, Srinivas Shakkottai, Alex Sprintson. 1181-1185 [doi]
- Signal Transduction for Two-Hop Molecular Communication NetworksPengfeng Hou, Andrew W. Eckford, Liqiang Zhao. 1186-1190 [doi]
- On Optimal Pseudo-cyclic ($r, \delta$) Locally Repairable CodesBin Chen 0011, Shu-Tao Xia, Jie Hao, Fang-Wei Fu. 1191-1195 [doi]
- Codes with Combined Locality and Regeneration Having Optimal Rate, $d_{\min}$ and Linear Field SizeM. Nikhil Krishnan, Anantha Narayanan R., P. Vijay Kumar. 1196-1200 [doi]
- Codes on Curves with Hierarchical LocalitySean Ballentine, Alexander Barg. 1201-1205 [doi]
- Learning in Restless Multi-Armed Bandits using Adaptive Arm Sequencing RulesTomer Gafni, Kobi Cohen. 1206-1210 [doi]
- Exact Calculation of Normalized Maximum Likelihood Code Length Using Fourier AnalysisAtsushi Suzuki, Kenji Yamanishi. 1211-1215 [doi]
- Coded Computing for Distributed Graph AnalyticsSaurav Prakash, Amirhossein Reisizadeh, Ramtin Pedarsani, Amir Salman Avestimehr. 1221-1225 [doi]
- Communication-Aware Scheduling of Serial Tasks for Dispersed ComputingChien-Sheng Yang, Amir Salman Avestimehr, Ramtin Pedarsani. 1226-1230 [doi]
- Limited-Sharing Multi-Party Computation for Massive Matrix OperationsHanzaleh Akbari Nodehi, Mohammad Ali Maddah-Ali. 1231-1235 [doi]
- Max-Product for Maximum Weight Matching - RevisitedMario Holldack. 1236-1240 [doi]
- A Cascade Code Construction for (n, k, d) Distributed Storage SystemsMehran Elyasi, Soheil Mohajer. 1241-1245 [doi]
- Optimal Lossless Source Codes for Timely UpdatesPrathamesh Mayekar, Parimal Parag, Himanshu Tyagi. 1246-1250 [doi]
- On the Capacity of 2-Dimensional ChannelsYonglong Li, Paul H. Siegzel. 1251-1255 [doi]
- Can Negligihle Cooperation Increase Capacity? The Average-Error CaseParham Noorzad, Michelle Effros, Michael Langberg. 1256-1260 [doi]
- Random Access Channel Coding in the Finite Blocklength RegimeMichelle Effros, Victoria Kostina, Recep Can Yavas. 1261-1265 [doi]
- A Compressed Sensing Approach for Distribution MatchingMohamad Dia, Vahid Aref, Laurent Schmalen. 1266-1270 [doi]
- Belief Propagation with Side Information for Recovering a Single CommunityHussein Saad, Aria Nosratinia. 1271-1275 [doi]
- Expectation Propagation for Approximate Inference: Free Probability FrameworkBurak Çakmak, Manfred Opper. 1276-1280 [doi]
- Distributed Computing Trade-offs with Random ConnectivitySundara Rajan Srinivasavaradhan, Linqi Song, Christina Fragouli. 1281-1285 [doi]
- Wireless MapReduce Distributed ComputingFan Li, Jinyuan Chen, Zhiying Wang. 1286-1290 [doi]
- Coded Distributed Computing with Node Cooperation Substantially Increases Speedup FactorsEmanuele Parrinello, Eleftherios Lampiris, Petros Elia. 1291-1295 [doi]
- Decoding Reed-Muller Codes Using Minimum- Weight Parity ChecksElia Santi, Christian Häger, Henry D. Pfister. 1296-1300 [doi]
- A soft-Input Bit-Flipping Decoder for Generalized Concatenated CodesJürgen Freudenberger, Mohammed Rajab, Sergo Shavgulidze. 1301-1305 [doi]
- LP Decoding of Quantum Stabilizer CodesJuly X. Li, Pascal O. Vontobel. 1306-1310 [doi]
- Bit-Labeling for Delayed BICM with Iterative DecodingLeijun Wang, Suihua Cai, Huixiao Ma, W. K. Leung, Xiao Ma. 1311-1315 [doi]
- Asymptotically MDS Array BP-XOR CodesSuayb S. Arslan. 1316-1320 [doi]
- Performance Analysis of Iteratively Decoded 3- Dimensional Product CodesThomas Mittelholzer. 1321-1325 [doi]
- On the Maximal Code Length of Optimal Linear Locally Repairable CodesJie Hao, Yi Xian Yang, Kenneth Shum, Shu-Tao Xia. 1326-1330 [doi]
- List Decoding of Locally Repairable CodesLukas Holzbaur, Antonia Wachter-Zeh. 1331-1335 [doi]
- On Distance Properties of $(r, t, x)$-LRC CodesStanislav Kruglik, Kamilla Nazirkhanova, Alexey Frolov. 1336-1339 [doi]
- On Taking Advantage of Multiple Requests in Error Correcting CodesPrasanna Ramakrishnan, Mary Wootters. 1340-1344 [doi]
- Outage Probability Conjecture Does Not Hold for Two-Input-Multiple-Output (TIM 0) SystemGen Li, Jingkai Yan, Yuantao Gu. 1345-1349 [doi]
- Bounds on the Capacity of MIMO Broadband Power Line Communications ChannelsNir Shlezinger, Roee Shaked, Ron Dabora. 1350-1354 [doi]
- On MIMO Channel Capacity with Output Quantization ConstraintsAbbas Khalili, Stefano Rini, Luca Barletta, Elza Erkip, Yonina C. Eldar. 1355-1359 [doi]
- MIMO Optical Intensity Channels with Peak Intensity Constraints: Low-SNR CapacityAnas Chaaban, Zouheir Rezki, Mohamed-Slim Alouini. 1360-1364 [doi]
- A Class of Low-Complexity Codes Based on Doubly Recursive Block Markov Superposition TransmissionShancheng Zhao, Xiao Ma, Qin Huang, Baoming Bai. 1365-1369 [doi]
- Optimal Streaming Codes for Channels with Burst and Arbitrary ErasuresSilas L. Fong, Ashish Khisti, Baochun Li, Wai-tian Tan, Xiaoqing Zhu, John G. Apostolopoulos. 1370-1374 [doi]
- Thresholds of Braided Convolutional Codes on the AWGN ChannelMuhammad Umar Farooq, Saeedeh Moloudi, Michael Lentmaier. 1375-1379 [doi]
- Combating Error Propagation in Window Decoding of Braided Convolutional CodesMin Zhu 0003, David G. M. Mitchell, Michael Lentmaier, Daniel J. Costello Jr., Baoming Bai. 1380-1384 [doi]
- Theoretical Bounds on MAP Estimation in Distributed Sensing NetworksAli Bereyhi, Saeid Haghighatshoar, Ralf R. Müller. 1385-1389 [doi]
- The Mutual Information in Random Linear Estimation Beyond i.i.d. MatricesJean Barbier, Nicolas Macris, Antoine Maillard, Florent Krzakala. 1390-1394 [doi]
- Statistical Inference and Exact Saddle Point ApproximationsPeter Harrcmoes. 1395-1399 [doi]
- Profile Maximum Likelihood is Optimal for Estimating KL DivergenceJayadev Acharya. 1400-1404 [doi]
- Capacity Region of Degraded Relay Broadcast ChannelKe Wang, Youlong Wu, Yingying Ma. 1405-1409 [doi]
- Sufficient Conditions for the Tightness of Shannon's Capacity Bounds for Two-Way ChannelsJian-Jia Weng, Fady Alajaji, Tamás Linder, Lin Song. 1410-1414 [doi]
- An Achievable Rate Region for the K-Receiver Two Nested Groupcast DM Broadcast Channel and a Capacity Result for the Combination NetworkMohamed Salman, Mahesh K. Varanasi. 1415-1419 [doi]
- The Capacity Region of the Three-Receiver Less Noisy Broadcast Channel with Message CognitionMohamed Salman, Mahesh K. Varanasi. 1420-1424 [doi]
- Fundamental Limits of Cloud and Cache-Aided Interference Management with Multi-Antenna Base StationsJingjing Zhang, Osvaldo Simeone. 1425-1429 [doi]
- Fundamental Limits of Decentralized Caching in Fog-RANs with Wireless FronthaulFan Xu, Meixia Tao. 1430-1434 [doi]
- Adding Transmitters Allows Unbounded Coded-Caching Gains with Bounded File SizesEleftherios Lampiris, Petros Elia. 1435-1439 [doi]
- Achieving Full Multiplexing and Unbounded Caching Gains with Bounded Feedback ResourcesEleftherios Lampiris, Petros Elia. 1440-1444 [doi]
- Optimal Active social Network De-anonymization Using Information ThresholdsFarhad Shirani, Siddharth Garg, Elza Erkip. 1445-1449 [doi]
- Ouroboros-E: An Efficient Lattice-based Key-Exchange ProtocolJean-Christophe Deneuville, Philippe Gaborit, Qian Guo 0001, Thomas Johansson 0001. 1450-1454 [doi]
- Ensemble Performance of Biometric Authentication Systems Based on Secret Key GenerationNeri Merhav. 1455-1459 [doi]
- A Multi-layer Recursive Residue Number SystemHenk D. L. Hollmann, Ronald Rietman, Sebastiaan de Hoogh, Ludo Tolhuizen, Paul Gorissen. 1460-1464 [doi]
- Sparse Graphs for Belief Propagation Decoding of Polar CodesSebastian Cammerer, Moustafa Ebada, Ahmed Elkelesh, Stephan ten Brink. 1465-1469 [doi]
- A Score Function for Sequential Decoding of Polar CodesPeter Trifonov. 1470-1474 [doi]
- Algebraic Matching Techniques for Fast Decoding of Polar Codes with Reed-Solomon KernelPeter Trifonov. 1475-1479 [doi]
- Convolutional Polar Codes: LLR-based Successive Cancellation Decoder and List Decoding PerformanceHamid Saber, Yiqun Ge, Ran Zhang, Wuxian Shi, Wen Tong. 1480-1484 [doi]
- When Does Feedback Improve the Second-Order Coding Rate in Discrete Memoryless Channels?Nirmal V. Shende, Aaron B. Wagner, Yucel Altug. 1485-1489 [doi]
- The Dispersion of the Gauss-Markov SourcePeida Tian, Victoria Kostina. 1490-1494 [doi]
- Second-Order Asymptotics of Rate-Distortion using Gaussian Codebooks for Arbitrary SourcesLin Zhou 0002, Vincent Y. F. Tan, Mehul Motani. 1495-1499 [doi]
- Second-Order Asymptotics of Universal JSCC for Arbitrary Sources and Additive ChannelsLin Zhou 0002, Vincent Y. F. Tan, Mehul Motani. 1500-1504 [doi]
- On the List-Decodability of Random Linear Rank-Metric CodesVenkatesan Guruswami, Nicolas Resch. 1505-1509 [doi]
- High-rate Spatially Coupled Codes for Channels with Synchronous ErrorsRyohei Goto, Kenta Kasai. 1510-1514 [doi]
- Sparse Regression Code with Sparse Dictionary for Absolute Error CriterionRyota Konabe, Kazuho Watanabe. 1515-1519 [doi]
- Spatially Correlated MIMO Broadcast Channel with Partially Overlapping Correlation EigenspacesFan Zhang, Aria Nosratinia. 1520-1524 [doi]
- Optimal Cell Associations and Degrees of Freedom of Locally Connected Interference Networks with Message Passing DecodingManik Singhal, Aly El Gamal. 1525-1529 [doi]
- On the Optimality of Treating Interference as Noise for Interfering Multiple Access ChannelsHamdi Joudeh, Bruno Clerckx. 1530-1534 [doi]
- A New Approach to Linear Degrees of Freedom: the MIMO Broadcast Channel with Hybrid CSITYao Wang, Mahesh K. Varanasi. 1535-1539 [doi]
- Robust Cache-Aided Interference Management Under Full Transmitter CooperationEnrico Piovano, Hamdi Joudeh, Bruno Clerckx. 1540-1544 [doi]
- Coded Caching with Heterogeneous Cache Sizes and Link Qualities: The Two-User CaseDaming Cao, Deyao Zhang, Pengyao Chen, Nan Liu, Wei Kang 0002, Deniz Gündüz. 1545-1549 [doi]
- On the Benefits of Asymmetric Coded Cache Placement in Combination Networks with End-User CachesKai Wan, Mingyue Ji, Pablo Piantanida, Daniela Tuninetti. 1550-1554 [doi]
- Placement Delivery Array Design for Combination Networks with Edge CachingQifa Yan, Michele A. Wigger, Sheng Yang. 1555-1559 [doi]
- An Explicit Convergence Rate for Nesterov's Method from SDPSam Safavi, Bikash Joshi, Guilherme França, José Bento. 1560-1564 [doi]
- Rejection Sampling and Noncausal Sampling Under Moment ConstraintsJingbo Liu, Sergio Verdú. 1565-1569 [doi]
- Queue-Aware Energy Efficient Control for Dense Wireless NetworksMaialen Larrañaga, Mohamad Assaad, Koen De Turck. 1570-1574 [doi]
- Coding for a Single Sparse Inverse ProblemYaoqing Yang, Pulkit Grover, Soummya Kar. 1575-1579 [doi]
- The Role of the Information Bottleneck in Representation LearningMatías Vera, Pablo Piantanida, Leonardo Rey Vega. 1580-1584 [doi]
- A Unified Coded Deep Neural Network Training Strategy based on Generalized PolyDot codesSanghamitra Dutta, Ziqian Bai, Haewon Jeong, Tze Meng Low, Pulkit Grover. 1585-1589 [doi]
- Deep Learning of the Nonlinear Schrödinger Equation in Fiber-Optic CommunicationsChristian Häger, Henry D. Pfister. 1590-1594 [doi]
- Deep Learning for Decoding of Linear Codes - A Syndrome-Based ApproachAmir Bennatan, Yoni Choukroun, Pavel Kisilev. 1595-1599 [doi]
- An Entropy Inequality for Symmetric Random VariablesJing Hao, Varun Jog. 1600-1604 [doi]
- Gaussian Extremality for Derivatives of Differential Entropy under the Additive Gaussian Noise FlowXiaobing Zhang, Venkat Anantharam, Yanlin Geng. 1605-1609 [doi]
- A Quantitative Entropic CLT for Radially Symmetric Random VectorsThomas A. Courtade. 1610-1614 [doi]
- Convexity of Mutual Information Along the Heat FlowAndre Wibisono, Varun Jog. 1615-1619 [doi]
- Hierarchical Coded ComputationNuwan S. Ferdinand, Stark C. Draper. 1620-1624 [doi]
- Codes for Distributed Finite Alphabet Matrix-Vector MultiplicationFarzin Haddadpour, Viveck R. Cadambe. 1625-1629 [doi]
- Hierarchical Coding for Distributed ComputingHyegyeong Park, Kangwook Lee, Jy-yong Sohn, Changho Suh, Jaekyun Moon. 1630-1634 [doi]
- Characterization and Efficient Search of Non-Elementary Trapping Sets of LDPC Codes with Applications to Stopping SetsYoones Hashemi, Amir H. Banihashemi. 1635-1639 [doi]
- From Cages to Trapping Sets: A New Technique to Derive Tight Upper Bounds on the Minimum Size of Trapping Sets and Minimum Distance of LDPC CodesAli Dehghan 0001, Amir H. Banihashemi. 1640-1644 [doi]
- Finding Leafless Elementary Trapping Sets and Elementary Absorbing Sets of LDPC Codes is HardAli Dehghan 0001, Amir H. Banihashemi. 1645-1649 [doi]
- Asymptotic Average Number of Different Categories of Trapping Sets, Absorbing Sets and Stopping Sets in Random LDPC Code EnsemblesAli Dehghan 0001, Amir H. Banihashemi. 1650-1654 [doi]
- Low-Power Cooling Codes with Efficient Encoding and DecodingYeow Meng Chee, Tuvi Etzion, Han Mao Kiah, Alexander Vardy, Hengjia Wei. 1655-1659 [doi]
- Error-Correcting WOM Constructions through Concatenation and Joint DesignAmit Solomon, Yuval Cassuto. 1660-1664 [doi]
- On Some New $\mathbb{Z}_{m}$ Linear Codes Based on Elementary Symmetric FunctionsLuca G. Tallini, Bella Bose. 1665-1669 [doi]
- SRAM Bit-line Swings Optimization using Generalized WaterfillingYongjune Kim, Mingu Kang, Lav R. Varshney, Naresh R. Shanbhag. 1670-1674 [doi]
- Error Exponents of Typical Random CodesNeri Merhav. 1675-1679 [doi]
- Exact Soft-Covering ExponentSemih Yagli, Paul Cuff. 1680-1684 [doi]
- Two-Way AWGN Channel Error Exponents at Zero RateKenneth Palacio-Baus, Natasha Devroye. 1685-1689 [doi]
- Exact Error and Erasure Exponents for the Asymmetric Broadcast ChannelDaming Cao, Vincent Y. F. Tan. 1690-1694 [doi]
- On a Simple Characterization of Secure Exact-repair Regenerating CodesFangwei Ye, Shiqiu Liu, Kenneth W. Shum, Raymond W. Yeung. 1695-1699 [doi]
- On the I/O Costs of Some Repair Schemes for Full-Length Reed-Solomon CodesHoang Dau, Iwan M. Duursma, Hien Chu. 1700-1704 [doi]
- Increasing Availability in Distributed Storage Systems via ClusteringSaeid Sahraei, Michael Gastpar. 1705-1709 [doi]
- Optimal Error Correcting Delivery Scheme for an Optimal Coded Caching Scheme with Small BuffersNujoom Sageer Karat, Anoop Thomas, B. Sundar Rajan. 1710-1714 [doi]
- Erasure Coding for Decentralized Coded CachingHadi Reisizadeh, Mohammad Ali Maddah-Ali, Soheil Mohajer. 1715-1719 [doi]
- The Wiretap Channel with a CacheAhmed A. Zewail, Aylin Yener. 1720-1724 [doi]
- Agglomerative Info-ClusteringChung Chan, Ali Al-Bashabsheh, Qiaoqiao Zhou. 1725-1729 [doi]
- A Simple and Efficient Strategy for the Coin Weighing Problem with a Spring ScaleEsmaeil Karimi, Fatemeh Kazemi, Anoosheh Heidarzadeh, Alex Sprintson. 1730-1734 [doi]
- A Deterministic Protocol for Sequential Asymptotic LearningYu Cheng, Wade Hann-Caruthers, Omer Tamuz. 1735-1738 [doi]
- Private Information Retrieval is Graph Based Replication SystemsNetanel Raviv, Itzhak Tamo. 1739-1743 [doi]
- Lifting Private Information Retrieval from Two to any Number of MessagesRafael G. L. D'Oliveira, Salim El Rouayheb. 1744-1748 [doi]
- Building Capacity-Achieving PIR Schemes with Optimal Sub-Packetization over Small FieldsJingke Xu, Zhifang Zhang. 1749-1753 [doi]
- Mutual Information as a Function of Matrix SNR for Linear Gaussian ChannelsGalen Reeves, Henry D. Pfister, Alex Dytso. 1754-1758 [doi]
- A Minimal Set of Shannon-type Inequalities for MRF Structures with Functional DependenciesTerence Chan, Satyajit Thakor, Alex J. Grant. 1759-1763 [doi]
- Maximum Entropy Interval AggregationsFerdinando Cicalese, Ugo Vaccaro. 1764-1768 [doi]
- Improved Capacity Upper Bounds for the Discrete-Time Poisson ChannelMahdi Cheraghchi, João Ribeiro. 1769-1773 [doi]
- Ozarow- Type Outer Bounds for Memoryless Sources and ChannelsYuval Kochman, Or Ordentlich, Yury Polyanskiy. 1774-1778 [doi]
- Bounds on the Capacity Region of the Three-User One-to-Three MIMO Interference ChannelYimin Pang, Mahesh K. Varanasi. 1779-1783 [doi]
- Random Private Quantum StatesMatthias Christandl, Roberto Ferrara, Cecilia Lancien. 1784-1788 [doi]
- Building Blocks for Communication Over Noisy Quantum NerworksAnurag Anshu, Rahul Jain 0001, Naqueeb Ahmad Warsi. 1789-1793 [doi]
- A Hypothesis Testing Approach for Communication Over Entanglement Assisted Compound Quantum ChannelAnurag Anshu, Rahul Jain 0001, Naqueeb Ahmad Warsi. 1794-1798 [doi]
- Skip-Sliding Window CodesTing-Yi Wu, Anshoo Tandon, Lav R. Varshney, Mehul Motani. 1799-1803 [doi]
- On Parity-Preserving Constrained CodingRon M. Roth, Paul H. Siegel. 1804-1808 [doi]
- Rate-Optimal Streaming Codes for Channels with Burst and Isolated ErasuresM. Nikhil Krishnan, P. Vijay Kumar. 1809-1813 [doi]
- A Classification of Functions in Multiterminal Distributed ComputingShun Watanabe. 1814-1818 [doi]
- An Enhanced Capacity Bound for Network Function ComputationXuan Guang, Raymond W. Yeung, Shenghao Yang, Congduan Li. 1819-1823 [doi]
- On the Tightness of a Cut-Set Bound on Network Function ComputationJie Wang, Shenghao Yang, Congduan Li. 1824-1828 [doi]
- Coding of Graphs with Application to Graph Anomaly DetectionAnders Høst-Madsen, June Zhang. 1829-1833 [doi]
- Inverted Leftover Hash LemmaMaciej Obremski, Maciej Skorski. 1834-1838 [doi]
- Consistent Tomography over Diffusion Networks under the Low-Observability RegimeAugusto Santos, Vincenzo Matta, Ali H. Sayed. 1839-1843 [doi]
- Exact Asymptotics of Random Coding Error Probability for General Memoryless ChannelsJunya Honda. 1844-1848 [doi]
- Strong Converse using Change of Measure ArgumentsHimanshu Tyagi, Shun Watanabe. 1849-1853 [doi]
- Dispersion Bound for the Wyner-Ahlswede-Körner Network via Reverse Hypercontractivity on TypesJingbo Liu. 1854-1858 [doi]
- Construction of Rate-Compatible Punctured Polar Codes Using Hierarchical PuncturingMin-Oh Jung, Song-Nam Hong. 1859-1863 [doi]
- Multilevel-Coded Pulse-Position Modulation for Covert CommunicationsIshaque Ashar Kadampot, Mehrdad Tahmasbi, Matthieu R. Bloch. 1864-1868 [doi]
- Polar Coding for Deletion Channels: Theory and ImplementationKuangda Tian, Arman Fazeli, Alexander Vardy. 1869-1873 [doi]
- Estimation in the Spiked Wigner Model: A Short Proof of the Replica FormulaAhmed El Alaoui, Florent Krzakala. 1874-1878 [doi]
- Adaptive Path Interpolation for Sparse Systems: Application to a Simple Censored Block ModelJean Barbier, Chun Lam Chan, Nicolas Macris. 1879-1883 [doi]
- Inference in Deep Networks in High DimensionsAlyson K. Fletcher, Sundeep Rangan, Philip Schniter. 1884-1888 [doi]
- Delayed Parity Generation in MDS Storage CodesSara Mousavi, Tianli Zhou, Chao Tian. 1889-1893 [doi]
- An Alternative Generic Transformation for Optimal Repair Bandwidth and Rebuilding Access in MDS CodesJie Li 0019, Xiaohu Tang, Chao Tian. 1894-1898 [doi]
- New Results on Multilevel Diversity Coding with Secure RegenerationShuo Shao, Tie Liu, Chao Tian, Cong Shen. 1899-1903 [doi]
- A Shannon-Theoretic Approach to the Storage-Retrieval Tradeoff in PIR SystemsChao Tian, Hua Sun, Jun Chen. 1904-1908 [doi]
- On the Capacity Region of a Cache-Aided Gaussian Broadcast Channel with Multi-Layer MessagesMohammad Mohammadi Amiri, Deniz Gündüz. 1909-1913 [doi]
- Multicast Beamformer Design for Coded CachingAntti Tölli, Seyed Pooya Shariatpanahi, Jarkko Kaleva, Babak Hossein Khalaj. 1914-1918 [doi]
- Utility Optimal Scheduling for Coded Caching in General TopologiesRichard Combes, Asma Ghorbel, Mari Kobayashi, Sheng Yang. 1919-1923 [doi]
- Two Freshness Metrics for Local Cache RefreshJing Zhong, Roy D. Yates, Emina Soljanin. 1924-1928 [doi]
- Heuristics for Analyzing Download Time in MDS Coded Storage SystemsMehmet Fatih Aktas, Emina Soljanin. 1929-1933 [doi]
- Multi-version Coding with Side InformationRamy E. Ali, Viveck R. Cadambe, Jaime Llorca, Antonia Maria Tulino. 1934-1938 [doi]
- Optimal Regenerating Codes for Cooperative RepairMin Ye 0005, Alexander Barg. 1939-1943 [doi]
- New Constructions of MDS Codes with Asymptotically Optimal RepairAmeera Chowdhury, Alexander Vardy. 1944-1948 [doi]
- Cache-Aided Private Information Retrieval with Unknown and Uncoded PrefetchingYi-Peng Wei, Karim A. Banawan, Sennur Ulukus. 1949-1953 [doi]
- Single-server Multi-user Private Information Retrieval with Side InformationSu Li, Michael Gastpar. 1954-1958 [doi]
- The Capacity of Uncoded Storage Constrained PIRMohamed Adel Attia, Deepak Kumar, Ravi Tandon. 1959-1963 [doi]
- A Renyi Entropy Power Inequality for Log-Concave Vectors and Parameters in [0, 1]Arnaud Marsiglietti, James Melbourne. 1964-1968 [doi]
- Further Investigations of the Maximum Entropy of the Sum of Two Dependent Random VariablesJiange Li, James Melbourne. 1969-1972 [doi]
- Error Bounds on a Mixed Entropy InequalityJames Melbourne, Saurav Talukdar, Shreyas Bhaban, Murti V. Salapaka. 1973-1977 [doi]
- New Connections Between the Entropy Power Inequality and Geometric InequalitiesArnaud Marsiglietti, Victoria Kostina. 1978-1982 [doi]
- Erasure Correction of Scalar Codes in the Presence of StragglersNetanel Raviv, Yuval Cassuto, Rami Cohen, Moshe Schwartz 0001. 1983-1987 [doi]
- Exploitation of Stragglers in Coded ComputationShahrzad Kiani, Nuwan S. Ferdinand, Stark C. Draper. 1988-1992 [doi]
- Straggler-Proofing Massive-Scale Distributed Matrix Multiplication with D-Dimensional Product CodesTavor Baharav, Kangwook Lee, Orhan Ocal, Kannan Ramchandran. 1993-1997 [doi]
- Gradient Coding Using the Stochastic Block ModelZachary B. Charles, Dimitris S. Papailiopoulos. 1998-2002 [doi]
- Partially-Robust Communications over a Noisy ChannelTibor Keresztfalvi, Amos Lapidoth. 2003-2006 [doi]
- Finite Blocklength and Dispersion Bounds for the Arbitrarily- Varying ChannelOliver Kosut, Jörg Kliewer. 2007-2011 [doi]
- Fully Quantum Arbitrarily Varying Channels: Random Coding Capacity and Capacity DichotomyHolger Boche, Christian Deppe, Janis Nötzel, Andreas Winter. 2012-2016 [doi]
- Message Transmission over Classical Quantum Channels with a Jammer with Side InformationHolger Boche, Minglai Cai, Ning Cai. 2017-2021 [doi]
- Straggler Mitigation in Distributed Matrix Multiplication: Fundamental Limits and Optimal CodingQian Yu, Mohammad Ali Maddah-Ali, Amir Salman Avestimehr. 2022-2026 [doi]
- Improving Distributed Gradient Descent Using Reed-Solomon CodesWael Halbawi, Navid Azizan Ruhi, Fariborz Salehi, Babak Hassibi. 2027-2031 [doi]
- Compressed Coded Distributed ComputingSongze Li, Mohammad Ali Maddah-Ali, Amir Salman Avestimehr. 2032-2036 [doi]
- Resolvability on Continuous AlphabetsMatthias Frey, Igor Bjelakovic, Slawomir Stanczak. 2037-2041 [doi]
- Source Resolvability with Kullback-Leibler DivergenceRyo Nomura. 2042-2046 [doi]
- Variable-Length Channel Resolvability for Discrete Memoryless Sources and ChannelsHideki Yagi, Te Sun Han. 2047-2051 [doi]
- Multiple-Access Channel Resolvability with CribbingNoha Helal, Matthieu Bloch, Aria Nosratinia. 2052-2056 [doi]
- Frame Moments and Welch Bound with ErasuresMarina Haikin, Ram Zamir, Matan Gavish. 2057-2061 [doi]
- Non-Orthogonal Training Sequence Design in Two-Cell Interference Networks Based on an Extended Welch BoundJi Wang, Jun Sun, Weimin Wu, Yingzhuang Liu, Xiaodong Wang. 2062-2066 [doi]
- On the Achievability Region of Regenerating Codes for Multiple ErasuresMarwen Zorgui, Zhiying Wang. 2067-2071 [doi]
- Load-Balanced Fractional Repetition CodesAlexandra Porter, Shashwat Silas, Mary Wootters. 2072-2076 [doi]
- Optimal Pliable Fractional Repetition CodesYi-Sheng Su. 2077-2081 [doi]
- A Novel Coded Caching Scheme with Coded PrefetchingJesús Gómez-Vilardebó. 2082-2086 [doi]
- From Uncoded Prefetching to Coded Prefetching in Coded Caching SystemsKai Zhang 0017, Chao Tian. 2087-2091 [doi]
- Optimal Error Correcting Delivery Scheme for Coded Caching with Symmetric Batch PrefetchingNujoom Sageer Karat, Anoop Thomas, B. Sundar Rajan. 2092-2096 [doi]
- Recovering a Hidden Community in a Preferential Attachment GraphBruce E. Hajek, Suryanarayana Sankagiri. 2097-2101 [doi]
- On Consistency of Compressive Spectral ClusteringMuni Sreenivas Pydi, Ambedkar Dukkipati. 2102-2106 [doi]
- Side Information in Recovering a Single Community: Information Theoretic LimitsHussein Saad, Aria Nosratinia. 2107-2111 [doi]
- Private Computation of Systematically Encoded Data with Colluding ServersDavid A. Karpuk. 2112-2116 [doi]
- Achievable Rate of Private Function Retrieval from MDS Coded DatabasesSarah A. Obead, Jörg Kliewer. 2117-2121 [doi]
- The Asymptotic Capacity of Private SearchZhen Chen, Zhiying Wang, Syed Jafar. 2122-2126 [doi]
- Information Storage in the Stochastic Ising Model at Zero TemperatureZiv Goldfeld, Guy Bresler, Yury Polyanskiy. 2127-2131 [doi]
- Free Energy Asymptotics for Problems with Weak Solution DependenciesAlexey Gronskiy, Joachim M. Buhmann, Wojciech Szpankowski. 2132-2136 [doi]
- On the Distribution of Random Geometric GraphsMihai-Alin Badiu, Justin P. Coon. 2137-2141 [doi]
- Performance of Viterbi Decoding on Interleaved Rician Fading ChannelsLan V. Truong. 2142-2146 [doi]
- Channel-Punctured Large MIMO DetectionHadi Sarieddeen, Mohammad M. Mansour, Ali Chehab. 2147-2151 [doi]
- Solvability of the PAPR Problem for OFDM with Reduced Compensation SetHolger Boche, Ullrich J. Mönich. 2152-2156 [doi]
- On Finite Blocklength Converse Bounds for Classical Communication Over Quantum ChannelsXin Wang, Kun Fang, Marco Tomamichel. 2157-2161 [doi]
- Error Exponents and Strong Converse Exponents for Classical Data Compression with Quantum Side InformationHao-Chung Cheng, Eric P. Hanson, Nilanjana Datta, Min-Hsiu Hsieh. 2162-2166 [doi]
- Strong Converse Bound on the Two-Way Assisted Quantum CapacityMario Berta, Mark M. Wilde. 2167-2171 [doi]
- Finite Field X-Channels with Delayed CSIT and Common MessagesAlisepta Vahid. 2172-2176 [doi]
- Degrees of Freedom of the Bursty MIMO X Channel with Instantaneous Topological InformationShih-Yi Yeh, I-Hsiang Wang. 2177-2181 [doi]
- Alphabetic AIFV Codes Constructed from Hu- Tucker codesTomotaka Hiraoka, Hirosuke Yamamoto. 2182-2186 [doi]
- An Optimality Proof of the Iterative Algorithm for AIFV-m CodesRyusei Fujita, Ken-ichi Iwata, Hirosuke Yamamoto. 2187-2191 [doi]
- Individually Optimal Single- and Multiple-Tree Almost Instantaneous Variable-to-Fixed CodesDanny Dubé, Fatma Haddad. 2192-2196 [doi]
- Fault- Tolerant Dot-Product EnginesRon M. Roth. 2197-2201 [doi]
- Hamming-Distance-Based Binary Representation of NumbersMinghai Qin. 2202-2205 [doi]
- Linear Complexity and Trace Presentation of Sequences with Period 2P2Jingwei Zhang, Changan Zhao. 2206-2210 [doi]
- Non-Asymptotic Bounds for Optimal Fixed-to-Variable Lossless Compression without Prefix ConstraintsIgal Sason, Sergio Verdú. 2211-2215 [doi]
- Distributed Compression of Graphical DataPayam Delgosha, Venkat Anantharam. 2216-2220 [doi]
- Distributed Data Compression in Sensor Clusters: A Maximum Independent Flow ApproachNi Ding, Parastoo Sadeghi, David Smith, Thierry Rakotoarivelo. 2221-2225 [doi]
- System-Aware CompressionYehuda Dar, Michael Elad, Alfred M. Bruckstein. 2226-2230 [doi]
- Genome-Wide Association Studies: Information Theoretic Limits of Reliable LearningBehrooz Tahmasebi, Mohammad Ali Maddah-Ali, Abolfazl S. Motahari. 2231-2235 [doi]
- Computing with Chemicals: Perceptrons Using Mixtures of Small MoleculesChristopher Rose, Sherief Reda, Brenda M. Rubenstein, Jacob K. Rosenstein. 2236-2240 [doi]
- Attaining the 2nd Chargaff Rule by Tandem DuplicationsSiddharth Jain, Netanel Raviv, Jehoshua Bruck. 2241-2245 [doi]
- Evolution of N-Gram Frequencies Under Duplication and Substitution MutationsHao Lou, Moshe Schwartz 0001, Farzad Farnoud Hassanzadeh. 2246-2250 [doi]
- A Sample Path Measure of Causal InfluenceGabriel Schamberg, Todd P. Coleman. 2251-2255 [doi]
- Stabilizing a System with an Unbounded Random Gain Using Only Finitely Many BitsVictoria Kostina, Yuval Peres, Gireeja Ranade, Mark Sellke. 2256-2260 [doi]
- Necessary and Sufficient Budgets in Information Source Finding with Querying: Adaptivity GapJaeyoung Choi, Yung Yi. 2261-2265 [doi]
- Content Based Status UpdatesElie Najm, Rajai Nasser, Emre Telatar. 2266-2270 [doi]
- Sening Information Through Status UpdatesAbdulrahman Baknina, Sennur Ulukus, Omur Ozel, Jing Yang 0002, Aylin Yener. 2271-2275 [doi]
- Decentralized Status Update for Age-of-Information Optimization in Wireless Multiaccess ChannelsZhiyuan Jiang, Bhaskar Krishnamachari, Xi Zheng, Sheng Zhou, Zhisheng Niu. 2276-2280 [doi]
- Status Updates through Networks of Parallel ServersRoy D. Yates. 2281-2285 [doi]
- Compressed Neighbour Discovery using Sparse Kerdock MatricesAndrew Thompson 0001, A. Robert Calderbank. 2286-2290 [doi]
- Compressive Phase Retrieval of Structured SignalsMilad Bakhshizadeh, Arian Maleki, Shirin Jalali. 2291-2295 [doi]
- Towards Sample-Optimal Methods for Solving Random Quadratic Equations with StructureGauri Jagatap, Chinmay Hegde. 2296-2300 [doi]
- Sublinear- Time Algorithms for Compressive Phase RetrievalYi Li 0002, Vasileios Nakos. 2301-2305 [doi]
- Saddlepoint Approximation of the Error Probability of Binary Hypothesis TestingGonzalo Vazquez-Vilar, Albert Guillen i Fabregas, Tobias Koch, Alejandro Lancho. 2306-2310 [doi]
- Near-Optimal Noisy Group Testing via Separate Decoding of ItemsJonathan Scarlett, Volkan Cevher. 2311-2315 [doi]
- Extra Samples can Reduce the Communication for Independence TestingK. R. Sahasranand, Himanshu Tyagi. 2316-2320 [doi]
- Controlled Sensing for Multi-Hypothesis Testing with Co-Dependent ActionsJavad Heydari, Ali Tajer. 2321-2325 [doi]
- Quantum Channel Simulation and the Channel's Smooth Max-InformationKun Fang, Xin Wang, Marco Tomamichel, Mario Berta. 2326-2330 [doi]
- Recoverability for Holevo's Just-as-Good FidelityMark M. Wilde. 2331-2335 [doi]
- Construction and Performance of Quantum Burst Error Correction Codes for Correlated ErrorsJihao Fan, Min-Hsiu Hsieh, Hanwu Chen, He Chen, Yonghui Li. 2336-2340 [doi]
- Converse Bounds for Classical Communication Over Quantum Broadcast Channels and Quantum Multi-Access ChannelsWei Xie, Xin Wang, Runyao Duan. 2341-2345 [doi]
- New Constructions of Codebooks Asymptotically Achieving the Welch BoundGaojun Luo, Xiwang Cao. 2346-2350 [doi]
- Optimal Achievable Rates for Computation With Random Homologous CodesPinar Sen, Sung-Hoon Lim, Young-Han Kim 0001. 2351-2355 [doi]
- Lattices from Linear Codes and Fine Quantization: General Continuous Sources and ChannelsFarhad Shirani Chaharsooghi, S. Sandeep Pradhan. 2356-2360 [doi]
- The Error Exponent of Generalized Random-Gilbert Varshamov CodesAnelia Somekh-Baruch, Jonathan Scarlett, Albert Guillen i Fabregas. 2361-2365 [doi]
- A Class of MSR Codes for Clustered Distributed StorageJy-yong Sohn, Beongjun Choi, Jaekyun Moon. 2366-2370 [doi]
- ∊-MSR Codes: Contacting Fewer Code Blocks for Exact RepairVenkatesan Guruswami, Satyanarayana V. Lokam, Sai Vikneshwar Mani Jayaraman. 2371-2375 [doi]
- Explicit MSR Codes with Optimal Access, Optimal Sub-Packetization and Small Field Size for $d=k+1, k+2, k+3$Myna Vajha, Balaji Srinivasan Babu, P. Vijay Kumar. 2376-2380 [doi]
- A Tight Lower Bound on the Sub- Packetization Level of Optimal-Access MSR and MDS CodesS. B. Balaji, P. Vijay Kumar. 2381-2385 [doi]
- Uncertainty in Identification SystemsMinh Thanh Vu, Tobias J. Oechtering, Mikael Skoglund, Holger Boche. 2386-2390 [doi]
- Variable-Length Resolvability for Mixed Sources and its Application to Variable-Length Source CodingHideki Yagi, Te Sun Han. 2391-2395 [doi]
- Sequential Change Detection Through Universal Compression - An Asymptotic StudyR. Srivastava, Rakesh K. Bansal. 2396-2400 [doi]
- On DNA Codes using the Ring Z4 + wZ4Dixita Limbachiya, Krishna Gopal Benerjee, Bansari Rao, Manish K. Gupta 0004. 2401-2405 [doi]
- Efficient Encoding/Decoding of Irreducible Words for Codes Correcting Tandem DuplicationsYeow Meng Chee, Johan Chrisnata, Han Mao Kiah, Tuan Thanh Nguyen. 2406-2410 [doi]
- Coding over Sets for DNA StorageAndreas Lenz, Paul H. Siegel, Antonia Wachter-Zeh, Eitan Yaakobi. 2411-2415 [doi]
- n, k)Theo Fanuela Prabowo, Chik-How Tan. 2416-2420 [doi]
- A New Algorithm for Solving the Rank Syndrome Decoding ProblemNicolas Aragon, Philippe Gaborit, Adrien Hauteville, Jean-Pierre Tillich. 2421-2425 [doi]
- Repairing the Faure-Loidreau Public-Key CryptosystemAntonia Wachter-Zeh, Sven Puchinger, Julian Renner. 2426-2430 [doi]
- Minimizing Age of Information for an Energy Harvesting Source with Updating FailuresSongtao Feng, Jing Yang. 2431-2435 [doi]
- Age of Information in Energy Harvesting Status Update Systems: When to Preempt in Service?Shahab Farazi, Andrew G. Klein, D. Richard Brown. 2436-2440 [doi]
- On The Rate-Cost of Gaussian Linear Control Systems with Random Communication DelaysJia Zhang, Chih-Chun Wang. 2441-2445 [doi]
- Private Information Retrieval Under Asymmetric Traffic ConstraintsKarim A. Banawan, Sennur Ulukus. 2446-2450 [doi]
- Robust Private Information Retrieval from Coded Systems with Byzantine and Colluding ServersRazan Tajeddine, Oliver W. Gnilke, David A. Karpuk, Ragnar Freij-Hollanti, Camilla Hollanti. 2451-2455 [doi]
- Secure Private Information Retrieval from Colluding Databases with EavesdroppersQiwen Wang, Mikael Skoglund. 2456-2460 [doi]
- Fundamental Latency Limits for D2D- Aided Content Delivery in Fog Wireless NetworksRoy Karasik, Osvaldo Simeone, Shlomo Shamai. 2461-2465 [doi]
- Asymptotics of the Packet Speed and Cost in a Mobile Wireless Network ModelIoannis Kontoyiannis, Stavros Toumpis, Riccardo Cavallari, Roberto Verdone. 2466-2470 [doi]
- Delay and Peak-Age Violation Probability in Short-Packet TransmissionsRahul Devassy, Giuseppe Durisi, Guido Carlo Ferrante, Osvaldo Simeone, Elif Uysal-Biyikoglu. 2471-2475 [doi]
- Compression for Qubit ClocksYuxiang Yang, Giulio Chiribella, Masahito Hayashi. 2476-2480 [doi]
- Optimized Quantum F-DivergencesMark M. Wilde. 2481-2485 [doi]
- Randomized Linear Algebra Approaches to Estimate the Von Neumann Entropy of Density MatricesEugenia-Maria Kontopoulou, Ananth Grama, Wojciech Szpankowski, Petros Drineas. 2486-2490 [doi]
- The Error Probability of Generalized Perfect CodesGonzalo Vazquez-Vilar, Albert Guillén i Fàbregas, Sergio Verdú. 2491-2495 [doi]
- Linearized Goppa CodesLi-Ping Wang. 2496-2500 [doi]
- Finite Hyperplane Codes: Minimum Distance and Majority-Logic DecodingChao Chen, Haiyang Liu, Baoming Bai. 2500-2504 [doi]
- Bounds and Constructions of Codes over Symbol-Pair Read ChannelsOhad Elishco, Ryan Gabrys, Eitan Yaakobi. 2505-2509 [doi]
- Input-Output Distance Properties of Good Linear CodesHajir Roozbehani, Yury Polyanskiy. 2510-2514 [doi]
- Bounds and Polynomial-Time Construction Algorithm for X-Codes of Constant Weight ThreeYu Tsunoda, Yuichiro Fujiwara. 2515-2519 [doi]
- Expressions for the Entropy of Binomial-Type DistributionsMahdi Cheraghchi. 2520-2524 [doi]
- LP relaxations and Fuglede's conjectureAditya Siripuram, Brad Osgood. 2525-2529 [doi]
- On the Approximability of the Hilbert TransformHolger Boche, Volker Pohl. 2530-2534 [doi]
- Reconstruction Codes for DNA Sequences with Uniform Tandem-Duplication ErrorsYonatan Yehezkeally, Moshe Schwartz 0001. 2535-2539 [doi]
- Unique Reconstruction of Coded Sequences from Multiset Substring SpectraRyan Gabrys, Olgica Milenkovic. 2540-2544 [doi]
- Thermodynamic Properties of Molecular CommunicationAndrew W. Eckford, Benjamin Kuznets-Speck, Michael Hinczewski, Peter J. Thomas. 2545-2549 [doi]
- Coordination Using Individually Shared RandomnessGowtham R. Kurri, Vinod M. Prabhakaran, Anand D. Sarwate. 2550-2554 [doi]
- On Perfect PrivacyBorzoo Rassouli, Deniz Gündüz. 2551-2555 [doi]
- A Note on the Joint Entropy of N/2-Wise IndependenceAmey Bhangale, Aditya Potukuchi. 2560-2564 [doi]
- Scheduling Policies for Age Minimization in Wireless Networks with Unknown Channel StateRajat Talak, Igor Kadota, Sertac Karaman, Eytan Modiano. 2564-2568 [doi]
- Gaussian 1-2-1 Networks: Capacity Results for mmWave CommunicationsYahya H. Ezzeldin, Martina Cardone, Christina Fragouli, Giuseppe Caire. 2569-2573 [doi]
- Necessary Conditions for K/2 Degrees of FreedomRecep Gül, Helmut Bölcskei, Shlomo Shamai. 2574-2578 [doi]
- Novel Impossibility Results for Group-TestingAbhishek Agarwal, Sidharth Jaggi, Arya Mazumdar. 2579-2583 [doi]
- Efficiently Decodable Non-Adaptive Threshold Group TestingThach V. Bui, Minoru Kuribayashi, Mahdi Cheraghchi, Isao Echizen. 2584-2588 [doi]
- Secure Adaptive Group TestingAlejandro Cohen, Asaf Cohen 0001, Sidharth Jaggi, Omer Gurewitz. 2589-2593 [doi]
- Blind Group TestingWasim Huleihel, Ohad Elishco, Muriel Médard. 2594-2598 [doi]
- On Asymptotic Analysis of Energy-Distortion Tradeoff for Low-Delay Transmission over Gaussian ChannelsCeren Sevinç, Ertem Tuncel. 2599-2603 [doi]
- On Energy-Distortion Exponents for Low-Delay Gaussian BroadcastingCeren Sevinç, Ertem Tuncel. 2604-2608 [doi]
- Predicting Wireless Channels for Ultra-Reliable Low-Latency CommunicationsVasuki Narasimha Swamy, Paul Rigge, Gireeja Ranade, Borivoje Nikolic, Anant Sahai. 2609-2613 [doi]
- Universal Construction of Cheater-Identifiable Secret Sharing Against Rushing Cheaters Based on Message AuthenticationMasahito Hayashi, Takeshi Koshiba. 2614-2618 [doi]
- Dynamic Distributed Storage for BlockchainsRavi Kiran Raman, Lav R. Varshney. 2619-2623 [doi]
- Capacity of a Multiple Enrollment System Based on an SRAM-PUF: Forgetful SettingLieneke Kusters, Frans M. J. Willems. 2624-2628 [doi]
- The Learning with Rank Errors problem and an application to symmetric authenticationSlim Bettaieb, Loïc Bidoux, Yann Connan, Philippe Gaborit, Adrien Hauteville. 2629-2633 [doi]
- Age of Information: Whittle Index for Scheduling Stochastic ArrivalsYu-Pin Hsu. 2634-2638 [doi]
- Analysis of the Age of Information with Packet Deadline and Infinite Buffer CapacityYoshiaki Inoue. 2639-2643 [doi]
- Age of Information: Updates with PrioritySanjit K. Kaul, Roy D. Yates. 2644-2648 [doi]
- Secure Key Agreement over Partially Corrupted ChannelsReihaneh Safavi-Naini, Pengwei Wang. 2649-2653 [doi]
- Multiterminal Secret Key Agreement at Asymptotically Zero Discussion RateChung Chan, Manuj Mukherjee, Navin Kashyap, Qiaoqiao Zhou. 2654-2658 [doi]
- On Achieving a Positive Rate in the Source Model Key Agreement ProblemAmin Gohari, Onur Günlü, Gerhard Kramer. 2659-2663 [doi]
- Secrecy Capacity under Limited Discussion Rate for Minimally Connected Hypergraphical SourcesQiaoqiao Zhou, Chung Chan. 2664-2668 [doi]
- Key-Rate Bound of a Semi-Quantum Protocol Using an Entropic Uncertainty RelationWalter O. Krawec. 2669-2673 [doi]
- Secure and Robust Identification via Classical-Quantum ChannelsHolger Boche, Christian Deppe, Andreas Winter. 2674-2678 [doi]
- Secure Communication Over Fully Quantum Gel' Fand-Pinsker Wiretap ChannelAnurag Anshu, Masahito Hayashi, Naqueeb Ahmad Warsi. 2679-2683 [doi]