Table of Contents

• Undirected Unicast Network Capacity: A Partition BoundSatyajit Thakor, Mohammad Ishtiyaq Qureshi. 1-5 [doi]
• A Proof of de Bruijn Identity based on Generalized Price's TheoremJaume Riba, Ferran De Cabrera. 1-5 [doi]
• Coded Caching with Heterogeneous File Demand Sets - The Insufficiency of Selfish Coded CachingChih-Hua Chang, Chih-Chun Wang. 1-5 [doi]
• Systematic Matrix Multiplication CodesHaewon Jeong, Yaoqing Yang, Pulkit Grover. 1-5 [doi]
• Massive Random Access with Common Alarm MessagesKristoffer Stern, Anders E. Kalør, Beatriz Soret, Petar Popovski. 1-5 [doi]
• Untrusted Caches in Two-layer NetworksAhmed A. Zewail, Aylin Yener. 1-5 [doi]
• Adversarial Influence MaximizationJustin Khim, Varun Jog, Po-Ling Loh. 1-5 [doi]
• Coded Caching with Full Heterogeneity: Exact Capacity of The Two-User/Two-File CaseChih-Hua Chang, Chih-Chun Wang. 6-10 [doi]
• Cache-Aided Two-User Broadcast Channels with State Information at ReceiversHadi Reisizadeh, Mohammad Ali Maddah-Ali, Soheil Mohajer. 16-20 [doi]
• Permutation-based Decoding of Reed-Muller Codes in Binary Erasure ChannelKirill Ivanov, Rüdiger L. Urbanke. 21-25 [doi]
• A New Permutation Decoding Method for Reed-Muller CodesMikhail Kamenev, Yulia Kameneva, Oleg Kurmaev, Alexey Maevskiy. 26-30 [doi]
• Backtracking and Look-Ahead Decoding Algorithms for Improved Successive Cancellation Decoding Performance of Polar CodesMyna Vajha, V. S. Chaitanya Mukka, P. Vijay Kumar. 31-35 [doi]
• On Estimation under Noisy Order StatisticsAlex Dytso, Martina Cardone, Mishfad S. Veedu, H. Vincent Poor. 36-40 [doi]
• Iterative Collaborative Filtering for Sparse Noisy Tensor EstimationDevavrat Shah, Christina Lee Yu. 41-45 [doi]
• Convergence of Chao Unseen Species EstimatorNived Rajaraman, Prafulla Chandra, Andrew Thangaraj, Ananda Theertha Suresh. 46-50 [doi]
• Context Block Estimation for Random FieldsZsolt Talata. 51-55 [doi]
• AVN-based Elimination of Short Cycles in Tanner Graphs of QC LDPC CodesIrina E. Bocharova, Boris D. Kudryashov, Vitaly Skachek. 56-60 [doi]
• Construction of Partial Geometries and LDPC codes based on Reed-Solomon CodesJuane Li, Keke Liu, Shu Lin, Khaled A. S. Abdel-Ghaffar. 61-65 [doi]
• Linear Permutation Polynomial CodesRyoichiro Yoshida, Kenta Kasai. 66-70 [doi]
• Quasi-Cyclic LDPC Codes for Correcting Multiple Phased Bursts of ErasuresXin Xiao, Bane Vasic, Shu Lin, Khaled A. S. Abdel-Ghaffar, William E. Ryan. 71-75 [doi]
• LDPC Codes for Portable DNA StoragePeng-fei, Zhiying Wang. 76-80 [doi]
• Clustering-Correcting CodesTal Shinkar, Eitan Yaakobi, Andreas Lenz, Antonia Wachter-Zeh. 81-85 [doi]
• Sequence-Subset Distance and Coding for Error Control for DNA-based Data StorageWentu Song, Kui Cai, Kees A. Schouhamer Immink. 86-90 [doi]
• Efficient and Explicit Balanced Primer CodesYeow Meng Chee, Han Mao Kiah, Hengjia Wei. 91-95 [doi]
• A Group Testing Approach to Random Access for Short-Packet CommunicationHuseyin A. Inan, Surin Ahn, Peter Kairouz, Ayfer Özgür. 96-100 [doi]
• A New Algorithm for Two-Stage Group TestingIlya Vorobyev. 101-105 [doi]
• Non-asymptotic Coded Slotted ALOHAMohammad Fereydounian, Xingran Chen, Hamed Hassani, Shirin Saeedi Bidokhti. 111-115 [doi]
• The Optimal Power Control Policy for an Energy Harvesting System with Look-Ahead: Bernoulli Energy ArrivalsAli Zibaeenejad, Jun Chen. 116-120 [doi]
• Analysis of Data Harvesting by Unmanned Aerial VehiclesChang-sik Choi, François Baccelli, Gustavo de Veciana. 121-125 [doi]
• Information and Energy Transmission with Experimentally-Sampled Harvesting FunctionsDaewon Seo, Lav R. Varshney. 126-130 [doi]
• On the Optimal Input of the Nondispersive Optical FiberJihad Fahs, Aslan Tchamkerten, Mansoor I. Yousefi. 131-135 [doi]
• Discrete-Time Poisson Optical Wiretap Channel with Peak Intensity ConstraintMorteza Soltani, Zouheir Rezki. 136-140 [doi]
• A Variational Signal-Space Distance Measure for Nondispersive Optical FiberReza Rafie Borujeny, Frank R. Kschischang. 141-145 [doi]
• The Interplay Between Block Design and Channel Estimation in VLC SystemsSiu-Wai Ho. 146-150 [doi]
• A Unified Framework of State Evolution for Message-Passing AlgorithmsKeigo Takeuchi. 151-155 [doi]
• Simple Codes and Sparse Recovery with Fast DecodingMahdi Cheraghchi, João L. Ribeiro 0001. 156-160 [doi]
• Learned Belief-Propagation Decoding with Simple Scaling and SNR AdaptationMengke Lian, Fabrizio Carpi, Christian Häger, Henry D. Pfister. 161-165 [doi]
• Evolution Analysis of Iterative BICM Receivers with Expectation Propagation over ISI ChannelsSerdar Sahin, Antonio Maria Cipriano, Charly Poulliat, Marie-Laure Boucheret. 166-170 [doi]
• Private Shotgun DNA SequencingAli Gholami, Mohammad Ali Maddah-Ali, Seyed Abolfazl Motahari. 171-175 [doi]
• How should we define Information Flow in Neural Circuits?Praveen Venkatesh, Sanghamitra Dutta, Pulkit Grover. 176-180 [doi]
• Symbolwise MAP for Multiple Deletion ChannelsSundara Rajan Srinivasavaradhan, Michelle Du, Suhas N. Diggavi, Christina Fragouli. 181-185 [doi]
• On the Bias of Directed Information EstimatorsGabriel Schamberg, Todd P. Coleman. 186-190 [doi]
• A Local Perspective on the Edge Removal ProblemFei Wei, Michael Langberg, Michelle Effros. 191-195 [doi]
• Local-Encoding-Preserving Secure Network Coding for Fixed DimensionXuan Guang, Raymond W. Yeung. 201-205 [doi]
• On the Complexity of Computing the Shannon Outer Bound to a Network Coding Capacity RegionYirui Liu, John MacLaren Walsh. 206-210 [doi]
• Secure Determinant Codes: A Class of Secure Exact-Repair Regenerating CodesMichelle Kleckler, Soheil Mohajer. 211-215 [doi]
• New Regenerating Codes over Binary Cyclic CodesHanxu Hou, Yunghsiang S. Han, Patrick P. C. Lee, Qingfeng Zhou 0001. 216-220 [doi]
• Practical Functional Regenerating Codes for Broadcast Repair of Multiple NodesNitish Mital, Katina Kralevska, Cong Ling 0001, Deniz Gündüz. 221-225 [doi]
• Explicit constructions of MSR codes for the rack-aware storage modelZitan Chen, Alexander Barg. 226-230 [doi]
• Second-Order Asymptotically Optimal Statistical ClassificationLin Zhou 0002, Vincent Y. F. Tan, Mehul Motani. 231-235 [doi]
• Rates of Adaptive Group Testing in the Linear RegimeMatthew Aldridge. 236-240 [doi]
• The Rate Distortion Test of NormalityPeter Harremoës. 241-245 [doi]
• Distributed False Discovery Rate Control with QuantizationYu Xiang. 246-249 [doi]
• Entropy Bound for the Classical Capacity of a Quantum Channel Assisted by Classical FeedbackDawei Ding, Yihui Quek, Peter W. Shor, Mark M. Wilde. 250-254 [doi]
• A Blahut-Arimoto Type Algorithm for Computing Classical-Quantum Channel CapacityHaobo Li, Ning Cai. 255-259 [doi]
• Quantum Coding via Semidefinite ProgrammingMario Berta, Francesco Borderi, Omar Fawzi, Volkher B. Scholz. 260-264 [doi]
• Optimizing Bounds on the Classical Information Rate of Quantum Channels with MemoryMichael X. Cao, Pascal O. Vontobel. 265-269 [doi]
• Joint State Sensing and Communication over Memoryless Multiple Access ChannelsMari Kobayashi, Hassan Hamad, Gerhard Kramer, Giuseppe Caire. 270-274 [doi]
• Broadcasting Information subject to State Masking over a MIMO State Dependent Gaussian ChannelMichael Dikshtein, Anelia Somekh-Baruch, Shlomo Shamai Shitz. 275-279 [doi]
• Message and State Communication over Channels with Action Dependent StatesViswanathan Ramachandran, Sibi Raj B. Pillai, Vinod M. Prabhakaran. 280-284 [doi]
• Constrained Communication Over the Gaussian Dirty Paper ChannelYinfei Xu, Jian Lu, Guojun Chen. 285-289 [doi]
• An Upper Bound to the Mismatch CapacityEhsan Asadi Kangarshahi, Albert Guillén i Fàbregas. 287-2877 [doi]
• Reconstruction of Sequences in DNA StorageMaria Abu Sini, Eitan Yaakobi. 290-294 [doi]
• The Levenshtein's Channel and the List Size in Information RetrievalVille Junnila, Tero Laihonen, Tuomo Lehtilä. 295-299 [doi]
• Single-Error Detection and Correction for Duplication and Substitution ChannelsYuanyuan Tang, Yonatan Yehezkeally, Moshe Schwartz 0001, Farzad Farnoud Hassanzadeh. 300-304 [doi]
• Secure Broadcasting of Two Encrypted Sources under Side-Channel AttacksBagus Santoso, Yasutada Oohama. 305-309 [doi]
• An Information-Theoretic Model for Side-Channel Attacks in Embedded HardwareÉloi de Chérisey, Sylvain Guilley, Olivier Rioul, Pablo Piantanida. 310-315 [doi]
• Wiretap Secret Key Capacity of Tree-PINAlireza Poostindouz, Reihaneh Safavi-Naini. 315-319 [doi]
• Manufacturing an Erasure Wiretap Channel from Channel Sounding MeasurementsDakota Flanary, Benjamin Jensen, Bradford Clark, Kalin Norman, Nathan Nelson, Michael Rice, Willie K. Harrison. 320-324 [doi]
• Age of Information With Prioritized Streams: When to Buffer Preempted Packets?Ali Maatouk, Mohamad Assaad, Anthony Ephremides. 325-329 [doi]
• Queue Management for Age Sensitive Status UpdatesAntzela Kosta, Nikolaos Pappas, Anthony Ephremides, Vangelis Angelakis. 330-334 [doi]
• Optimal Age over Erasure ChannelsElie Najm, Emre Telatar, Rajai Nasser. 335-339 [doi]
• Age-Delay Tradeoffs in Single Server SystemsRajat Talak, Eytan Modiano. 340-344 [doi]
• When a Heavy Tailed Service Minimizes Age of InformationRajat Talak, Sertac Karaman, Eytan Modiano. 345-349 [doi]
• Single-Server Single-Message Online Private Information Retrieval with Side InformationFatemeh Kazemi, Esmaeil Karimi, Anoosheh Heidarzadeh, Alex Sprintson. 350-354 [doi]
• Private Inner Product Retrieval for Distributed Machine LearningMohammad Hossein Mousavi, Mohammad Ali Maddah-Ali, Mahtab Mirmohseni. 355-359 [doi]
• Constructions of Batch Codes via Finite GeometryNikita Polyanskii, Ilya Vorobyev. 360-364 [doi]
• Symmetric Private Information Retrieval with Mismatched Coded Messages and RandomnessQiwen Wang, Hua Sun, Mikael Skoglund. 365-369 [doi]
• Capacity-Achieving Private Information Retrieval Codes from MDS-Coded Databases with Minimum Message SizeRuida Zhou, Chao Tian, Tie Liu, Hua Sun. 370-374 [doi]
• Asymptotics and Optimal Designs of SLOPE for Sparse Linear RegressionHong Hu, Yue M. Lu. 375-379 [doi]
• Turing Computability of the Fourier Transform of Bandlimited FunctionsHolger Boche, Ullrich J. Mönich. 380-384 [doi]
• Joint Sampling and Recovery of Correlated SourcesNir Shlezinger, Salman Salamatian, Yonina C. Eldar, Muriel Médard. 385-389 [doi]
• Task-Based Quantization for Recovering Quadratic Functions Using Principal Inertia ComponentsSalman Salamatian, Nir Shlezinger, Yonina C. Eldar, Muriel Médard. 390-394 [doi]
• A Random Walk Approach to First-Order Stochastic Convex OptimizationSattar Vakili, Qing Zhao 0001. 395-399 [doi]
• The Geometry of Community Detection via the MMSE MatrixGalen Reeves, Vaishakhi Mayya, Alexander Volfovsky. 400-404 [doi]
• Mutual Information for the Stochastic Block Model by the Adaptive Interpolation MethodJean Barbier, Chun Lam Chan, Nicolas Macris. 405-409 [doi]
• Finding Better Web Communities in Digraphs via Max-Flow Min-CutChung Chan, Ali Al-Bashabsheh, Da Sun Handason Tam, Chao Zhao. 410-414 [doi]
• Exact Recovery for a Family of Community-Detection Generative ModelsLuca Corinzia, Paolo Penna, Luca Mondada, Joachim M. Buhmann. 415-419 [doi]
• Community Detection with Side Information via Semidefinite ProgrammingMohammad Esmaeili, Hussein Saad, Aria Nosratinia. 420-424 [doi]
• Multi-User UD k-Ary Codes Recursively Constructed from Short-Length Multiary Codes for Multiple-Access Adder ChannelShan Lu, Wei Hou, Jun Cheng 0001, Hiroshi Kamabe. 425-429 [doi]
• Improved bounds on Gaussian MAC and sparse regression via Gaussian inequalitiesIlias Zadik, Yury Polyanskiy, Christos Thrampoulidis. 430-434 [doi]
• Multiple Access Channels with Adversarial UsersNeha Sangwan, Mayank Bakshi, Bikash Kumar Dey, Vinod M. Prabhakaran. 435-439 [doi]
• Quasi-static fading MAC with many users and finite payloadSuhas S. Kowshik, Yury Polyanskiy. 440-444 [doi]
• The Capacity Region of the Arbitrarily Varying MAC: With and Without ConstraintsUzi Pereg, Yossef Steinberg. 445-449 [doi]
• Dynamic Programming for Quantization of q-ary Input Discrete Memoryless ChannelsXuan He, Kui Cai, Wentu Song, Zhen Mei. 450-454 [doi]
• Achievable Rate Region for Iterative Multi-User Detection via Low-cost Gaussian ApproximationXiaojie Wang, Chulong Liang, Li Ping, Stephan ten Brink. 455-459 [doi]
• Polynomial-time Capacity Calculation and Scheduling for Half-Duplex 1-2-1 NetworksYahya H. Ezzeldin, Martina Cardone, Christina Fragouli, Giuseppe Caire. 460-464 [doi]
• On the Multicast Capacity of Full-Duplex 1-2-1 NetworksYahya H. Ezzeldin, Martina Cardone, Christina Fragouli, Giuseppe Caire. 465-469 [doi]
• Identification Capacity of Correlation-Assisted Discrete Memoryless Channels: Analytical Properties and RepresentationsHolger Boche, Rafael F. Schaefer, H. Vincent Poor. 470-474 [doi]
• Two-Stage GuessingRobert Graczyk, Amos Lapidoth. 475-479 [doi]
• Guessing random additive noise decoding with soft detection symbol reliability information - SGRANDKen R. Duffy, Muriel Médard. 480-484 [doi]
• Universal Randomized Guessing with Application to Asynchronous Decentralized Brute - Force AttacksNeri Merhav, Asaf Cohen 0001. 485-489 [doi]
• The Hat Guessing Number of GraphsNoga Alon, Omri Ben-Eliezer, Chong Shangguan, Itzhak Tamo. 490-494 [doi]
• Refinement of Massey Inequality : (To Nicolae Ţăpuş on his 70th birthday)Pantelimon George Popescu, Marios Omar Choudary. 495-496 [doi]
• Non-Negative Matrix Factorization via Low-Rank Stochastic Manifold OptimizationAhmed Douik, Babak Hassibi. 497-501 [doi]
• An information theoretic model for summarization, and some basic resultsEric Graves, Qiang Ning, Prithwish Basu. 502-506 [doi]
• A Method to Improve Consensus Averaging using Quantized ADMMNandan Sriranga, Chandra R. Murthy, Vaneet Aggarwal. 507-511 [doi]
• Solving linear inverse problems using generative modelsShirin Jalali, Xin Yuan 0002. 512-516 [doi]
• Locality in Index Coding for Large Min-RankLakshmi Natarajan 0001, Hoang Dau, Prasad Krishnan, V. Lalitha 0001. 517-521 [doi]
• Optimal-Rate Characterisation for Pliable Index Coding using Absent ReceiversLawrence Ong, Badri N. Vellambi, Jörg Kliewer. 522-526 [doi]
• Code Construction for Pliable Index CodingShanuja Sasi, B. Sundar Rajan. 527-531 [doi]
• Decentralized Pliable Index CodingTang Liu 0002, Daniela Tuninetti. 532-536 [doi]
• Profile-based Privacy for Locally Private ComputationsJoseph Geumlek, Kamalika Chaudhuri. 537-541 [doi]
• Synthesizing Differentially Private Datasets using Random MixingKangwook Lee, Hoon Kim, Kyungmin Lee, Changho Suh, Kannan Ramchandran. 542-546 [doi]
• Optimal Mechanism for Randomized Responses under Universally Composable Security MeasureYuuya Yoshida, Man-Hong Yung, Masahito Hayashi. 547-551 [doi]
• Information-Theoretic Privacy WatchdogsHsiang Hsu, Shahab Asoodeh, Flávio P. Calmon. 552-556 [doi]
• Tail redundancy and its characterizations of universal compressionMaryam Hosseini, Narayana Santhanam. 557-561 [doi]
• Time-universal data compression and predictionBoris Ryabko. 562-566 [doi]
• Universal D-Semifaithfull Coding for Countably Infinite AlphabetsJorge F. Silva, Pablo Piantanida. 567-571 [doi]
• Local Decoding and Update of Compressed DataShashank Vatedka, Aslan Tchamkerten. 572-576 [doi]
• An Information-Theoretic View of Generalization via Wasserstein DistanceHao Wang, Mario Diaz, José Cândido Silveira Santos Filho, Flávio P. Calmon. 577-581 [doi]
• Strengthened Information-theoretic Bounds on the Generalization ErrorIbrahim Issa, Amedeo Roberto Esposito, Michael Gastpar. 582-586 [doi]
• Tightening Mutual Information Based Bounds on Generalization ErrorYuheng Bu, Shaofeng Zou, Venugopal V. Veeravalli. 587-591 [doi]
• Compressive Sensing with a Multiple Convex Sets DomainHang Zhang, Afshin Abdi, Faramarz Fekri. 592-596 [doi]
• Tradeoff Between Delay and High SNR Capacity in Quantized MIMO SystemsAbbas Khalili, Farhad Shirani 0001, Elza Erkip, Yonina C. Eldar. 597-601 [doi]
• On Multiterminal Communication over MIMO Channels with One-bit ADCs at the ReceiversAbbas Khalili, Farhad Shirani 0001, Elza Erkip, Yonina C. Eldar. 602-606 [doi]
• Using Erasure Feedback for Online Timely Updating with an Energy Harvesting SensorAhmed Arafa, Jing Yang 0002, Sennur Ulukus, H. Vincent Poor. 607-611 [doi]
• Saddlepoint Approximations for Noncoherent Single-Antenna Rayleigh Block-Fading ChannelsAlejandro Lancho, Johan Östman, Giuseppe Durisi, Tobias Koch, Gonzalo Vazquez-Vilar. 612-616 [doi]
• Structured Coding for Authentication in the Presence of a Malicious AdversaryAllison Beemer, Oliver Kosut, Jörg Kliewer, Eric Graves, Paul L. Yu. 617-621 [doi]
• Composable, Unconditionally Secure Message Authentication without any Secret KeyDimiter Ostrev. 622-626 [doi]
• Shared Randomness in Arbitrarily Varying ChannelsSagnik Bhattacharya, Amitalok J. Budkuley, Sidharth Jaggi. 627-631 [doi]
• When are large codes possible for AVCs?Xishi Nicholas Wang, Amitalok J. Budkuley, Andrej Bogdanov, Sidharth Jaggi. 632-636 [doi]
• Privacy Against Brute-Force Inference AttacksSeyed Ali Ossia, Borzoo Rassouli, Hamed Haddadi, Hamid R. Rabiee, Deniz Gündüz. 637-641 [doi]
• Robustness of Maximal α-Leakage to Side InformationJiachun Liao, Lalitha Sankar, Oliver Kosut, Flávio P. Calmon. 642-646 [doi]
• On the Conditional Smooth Rényi Entropy and Its Application in GuessingShigeaki Kuzuoka. 647-651 [doi]
• Non-Asymptotic Fundamental Limits of Guessing Subject to DistortionShota Saito, Toshiyasu Matsushima. 652-656 [doi]
• The Dirty Paper Wiretap Feedback Channel with or without Action on the StateBin Dai 0003, Chong Li, Yingbin Liang, Zheng Ma, Shlomo Shamai Shitz. 657-661 [doi]
• Quantized Mechanisms for Gaussian Multiple Access Wiretap ChannelsHao Ge, Randall A. Berry. 662-666 [doi]
• Optimal Secure GDoF of Symmetric Gaussian Wiretap Channel with a HelperJinyuan Chen, Chunhua Geng. 667-671 [doi]
• The Degraded Gaussian Many-Access Wiretap ChannelRémi A. Chou, Aylin Yener. 672-676 [doi]
• Subspace Coding for Coded Caching: Decentralized and Centralized Placements Meet for Three UsersHadi Reisizadeh, Mohammad Ali Maddah-Ali, Soheil Mohajer. 677-681 [doi]
• Coded Caching via Projective Geometry: A new low subpacketization schemeHari Hara Suthan Chittoor, Bhavana M, Prasad Krishnan. 682-686 [doi]
• Closing the Gap for Coded Caching with Distinct File SizesJinbei Zhang, Xiaojun Lin, Chih-Chun Wang. 687-691 [doi]
• On Coded Caching with Correlated FilesKai Wan, Daniela Tuninetti, Mingyue Ji, Giuseppe Caire. 692-696 [doi]
• Subadditivity Beyond Trees and the Chi-Squared Mutual InformationEmmanuel Abbe, Enric Boix-Adserà. 697-701 [doi]
• An Information Theoretic Approach to Probability Mass Function TruncationFerdinando Cicalese, Luisa Gargano, Ugo Vaccaro. 702-706 [doi]
• Monotonicity of Entropy in Positively Correlated Ising TreesMatthew G. Reyes, David L. Neuhoff. 707-711 [doi]
• Algebraic Properties of Wyner Common Information Solution under Graphical ConstraintsMd Mahmudul Hasan, Shuangqing Wei, Ali Moharrer. 712-716 [doi]
• Coded Distributed Computing over Packet Erasure ChannelsDong-Jun Han, Jy-yong Sohn, Jaekyun Moon. 717-721 [doi]
• Coded Matrix Multiplication on a Group-Based ModelMuah Kim, Jy-yong Sohn, Jaekyun Moon. 722-726 [doi]
• Divergence Family Attains Blockchain Applications via α-EM AlgorithmYasuo Matsuyama. 727-731 [doi]
• Information Storage in the Stochastic Ising Model at Low TemperatureZiv Goldfeld, Guy Bresler, Yury Polyanskiy. 732-736 [doi]
• Cloud-Aided Interference Management with Cache-Enabled Edge Nodes and UsersSeyed Pooya Shariatpanahi, Jingjing Zhang, Osvaldo Simeone, Babak Hossein Khalaj, Mohammad Ali Maddah-Ali. 737-741 [doi]
• On the Capacity of Sampled Interference-Limited Communications ChannelsNir Shlezinger, Emeka Abakasanga, Ron Dabora, Yonina C. Eldar. 742-746 [doi]
• Interference Channels with Confidential Messages: Leveraging OFDM Transmission to Scale up Secure Degrees of Freedom with No CSITJean de Dieu Mutangana, Ravi Tandon. 747-751 [doi]
• Channel Conditions for the Optimality of Interference Decoding Schemes for K-user Gaussian Interference ChannelsRagini Chaluvadi, Bolli Madhuri, Srikrishna Bhashyam. 752-756 [doi]
• Anchor-Based Correction of Substitutions in Indexed SetsAndreas Lenz, Paul H. Siegel, Antonia Wachter-Zeh, Eitan Yaakobi. 757-761 [doi]
• Capacity Results for the Noisy Shuffling ChannelIlan Shomorony, Reinhard Heckel. 762-766 [doi]
• On Coding Over Sliced InformationJin Sima, Netanel Raviv, Jehoshua Bruck. 767-771 [doi]
• Linear-Time Encoders for Codes Correcting a Single Edit for DNA-Based Data StorageYeow Meng Chee, Han Mao Kiah, Tuan Thanh Nguyen. 772-776 [doi]
• On the Degrees of Freedom of the Oversampled Wiener Phase Noise ChannelLuca Barletta, Stefano Rini. 777-781 [doi]
• On Decentralized Power Control for Ergodic MIMO Multiple Access ChannelsChirag C. Shetty, Kamal Singh, Sibi Raj B. Pillai. 782-786 [doi]
• Decentralized Massive MIMO Systems: Is There Anything to be Discussed?Jesús Rodríguez Sánchez, Juan Vidal-Alegría, Fredrik Rusek. 787-791 [doi]
• Asynchronous Multi-Sensor Change-Point Detection for Seismic TremorsLiyan Xie, Yao Xie 0002, George V. Moustakides. 787-791 [doi]
• Capacity Analysis of MISO Channels with One-Bit TransceiverYunseo Nam, Heedong Do, Yo-Seb Jeon, Namyoon Lee. 792-796 [doi]
• On Error Exponents Under A Privacy-Preserving Voting RegimeErtem Tuncel. 797-801 [doi]
• False-Accept/False-Reject Trade-offs for Ensembles of Biometric Authentication SystemsNeri Merhav. 802-806 [doi]
• Biometric Systems with Multiuser Access StructuresRémi A. Chou. 807-811 [doi]
• Identification, Secrecy, Template, and Privacy-Leakage of Biometric Identification System under Noisy EnrollmentVamoua Yachongka, Hideki Yagi. 812-816 [doi]
• ON-OFF Privacy with Correlated RequestsCarolina Naim, Fangwei Ye, Salim El Rouayheb. 817-821 [doi]
• A Graph-Based Modular Coding Scheme Which Achieves Semantic SecurityMoritz Wiese, Holger Boche. 822-826 [doi]
• Attributes of Generators for Best Finite Blocklength Coset Wiretap Codes over Erasure ChannelsWillie K. Harrison, Matthieu R. Bloch. 827-831 [doi]
• Proving ErasureXavier Coiteux-Roy, Stefan Wolf. 832-836 [doi]
• Computing the Feedback Capacity of Finite State Channels using Reinforcement LearningZiv Aharoni, Oron Sabag, Haim H. Permuter. 837-841 [doi]
• Asymptotics of MAP Inference in Deep NetworksParthe Pandit, Mojtaba Sahraee, Sundeep Rangan, Alyson K. Fletcher. 842-846 [doi]
• Optimal k-Deletion Correcting CodesJin Sima, Jehoshua Bruck. 847-851 [doi]
• A Quadratic Field-Size Rate-Optimal Streaming Code for Channels with Burst and Random ErasuresM. Nikhil Krishnan, Deeptanshu Shukla, P. Vijay Kumar. 852-856 [doi]
• Scalable Network-Coded PBFT Consensus AlgorithmBeongjun Choi, Jy-yong Sohn, Dong-Jun Han, Jaekyun Moon. 857-861 [doi]
• Network Coding Solutions for the Combination Network and its SubgraphsHan Cai, Tuvi Etzion, Moshe Schwartz 0001, Antonia Wachter-Zeh. 862-866 [doi]
• Weight Enumerating Function, Number of Full Rank Sub-matrices and Network CodingMahesh Babu Vaddi, B. Sundar Rajan. 867-871 [doi]
• A method to find the volume of a sphere in the Lee metric, and its applicationsSagnik Bhattacharya, Adrish Banerjee. 872-876 [doi]
• Binary Recursive Estimation on Noisy HardwareElsa Dupraz, Lav R. Varshney. 877-881 [doi]
• Trading off Weak-Noise Estimation Performance and Outage Exponents in Nonlinear ModulationNeri Merhav. 882-886 [doi]
• Asymptotic Properties of Recursive Particle Maximum Likelihood EstimationVladislav Z. B. Tadic, Arnaud Doucet. 887-891 [doi]
• Optimality of the Plug-in Estimator for Differential Entropy Estimation under Gaussian ConvolutionsZiv Goldfeld, Kristjan H. Greenewald, Jonathan Weed, Yury Polyanskiy. 892-896 [doi]
• Active Hypothesis Testing: Beyond Chernoff-SteinDhruva Kartik, Ashutosh Nayyar, Urbashi Mitra. 897-901 [doi]
• Stochastic Decision with Stationary Memoryless SequenceJun Muramatsu, Shigeki Miyake. 902-906 [doi]
• Adaptive Sequence Phase DetectionLele Wang 0001, Ofer Shayevitz. 907-911 [doi]
• Quantizing Signals for Linear ClassificationYahya H. Ezzeldin, Christina Fragouli, Suhas N. Diggavi. 912-916 [doi]
• A General Upper Bound on Point-to-Point Particle Timing Channel Capacity Under Constant Particle Emission IntensityChristopher Rose, I. Saira Mian. 917-921 [doi]
• Procedure for Identifying Odd-sized Nucleotide Sequences as Codewords of BCH Codes over GF(4)D. L. Rodríguez-Sarmiento, M. E. Duarte-González, T. Rodríguez-Quiñones, Reginaldo Palazzo. 922-926 [doi]
• Some Enumeration Problems in the Duplication-Loss Model of Genome RearrangementMladen Kovacevic 0001, Sanja Brdar, Vladimir S. Crnojevic. 927-931 [doi]
• Repeat-Free CodesOhad Elishco, Ryan Gabrys, Muriel Médard, Eitan Yaakobi. 932-936 [doi]
• Second-Order Characterizations via Partial SmoothingAnurag Anshu, Mario Berta, Rahul Jain 0001, Marco Tomamichel. 937-941 [doi]
• A Unified Framework for One-shot Achievability via the Poisson Matching LemmaCheuk Ting Li, Venkat Anantharam. 942-946 [doi]
• One-Shot Perfect Secret Key Agreement for Finite Linear SourcesChung Chan, Navin Kashyap, Praneeth Kumar Vippathalla, Qiaoqiao Zhou. 947-951 [doi]
• Semi-Finite Length Analysis for Secure Random Number GenerationMasahito Hayashi. 952-956 [doi]
• Dynamic Pricing for Controlling Age of InformationXuehe Wang, Lingjie Duan. 962-966 [doi]
• A New Proof of Nonsignalling Multiprover Parallel Repetition TheoremHimanshu Tyagi, Shun Watanabe. 967-971 [doi]
• On the Number of Bins in Equilibria for Signaling GamesSerkan Sariotakas, Philippe Furrer, Sinan Gezici, Tamás Linder, Serdar Yüksel. 972-976 [doi]
• Codes for Covert Communication over Additive White Gaussian Noise ChannelsIshaque Ashar Kadampot, Mehrdad Tahmasbi, Matthieu R. Bloch. 977-981 [doi]
• Covert Communication Over a Compound Discrete Memoryless ChannelMehrasa Ahmadipour, Sadaf Salehkalaibar, Mohammad Hossein Yassaee, Vincent Y. F. Tan. 982-986 [doi]
• Multi-Antenna Jamming in Covert CommunicationOri Shmuel, Asaf Cohen 0001, Omer Gurewitz, Alejandro Cohen. 987-991 [doi]
• Undetectable Radios: Covert Communication under Spectral Mask ConstraintsQiaosheng Eric Zhang, Matthieu R. Bloch, Mayank Bakshi, Sidharth Jaggi. 992-996 [doi]
• Towards a Non-Stochastic Information TheoryAnshuka Rangi, Massimo Franceschetti. 997-1001 [doi]
• The Interplay of Causality and Myopia in Adversarial Channel ModelsBikash Kumar Dey, Sidharth Jaggi, Michael Langberg, Anand D. Sarwate, Carol Wang. 1002-1006 [doi]
• On the Capacity of the Flash Memory Channel with Inter-cell InterferenceYonglong Li, Guangyue Han, Paul H. Siegel. 1007-1011 [doi]
• Modeling Packet Losses in Communication NetworksIrina E. Bocharova, Boris D. Kudryashov, Maben Rabi, Nikita Lyamin, Wouter Dankers, Erik Frick, Alexey Vinel. 1012-1016 [doi]
• Updates with Multiple Service ClassesRoy D. Yates, Jing Zhong, Wuyang Zhang. 1017-1021 [doi]
• Online Energy-Efficient Scheduling for Timely Information Downloads in Mobile NetworksYi-Hsuan Tseng, Yu-Pin Hsu. 1022-1026 [doi]
• Scheduling to Minimize Age of Synchronization in Wireless Broadcast Networks with Random UpdatesHaoyue Tang, Jintao Wang, Zihan Tang, Jian Song. 1027-1031 [doi]
• Minimizing Age in Gateway Based Update SystemsSandeep Banik, Sanjit K. Kaul, P. B. Sujit. 1032-1036 [doi]
• Status from a Random Field: How Densely Should One Update?Zhiyuan Jiang, Sheng Zhou. 1037-1041 [doi]
• Single-Server Multi-Message Individually-Private Information Retrieval with Side InformationAnoosheh Heidarzadeh, Swanand Kadhe, Salim Y. El Rouayheb, Alex Sprintson. 1042-1046 [doi]
• A Capacity-Achieving T-PIR Scheme Based On MDS Array CodesJingke Xu, Yaqian Zhang, Zhifang Zhang. 1047-1051 [doi]
• A New Design of Private Information Retrieval for Storage Constrained DatabasesNicholas Woolsey, Rong-Rong Chen, Mingyue Ji. 1052-1056 [doi]
• Private Information Retrieval from Locally Repairable Databases with Colluding ServersUmberto Martínez-Peñas. 1057-1061 [doi]
• A Generalization of the Blackburn-Etzion Construction for Private Information Retrieval Array CodesYeow Meng Chee, Han Mao Kiah, Eitan Yaakobi, Hui Zhang 0004. 1062-1066 [doi]
• Systematic Construction of MDS Codes with Small Sub-packetization Level and Near Optimal Repair BandwidthJie Li 0019, Xiaohu Tang. 1067-1071 [doi]
• Improved Soft Decoding of Reed-Solomon Codes on Gilbert-Elliott ChannelsMichel Kulhandjian, Hovannes Kulhandjian, Claude D'Amours. 1072-1076 [doi]
• Near-optimal Repair of Reed-Solomon Codes with Low Sub-packetizationVenkatesan Guruswami, Haotian Jiang. 1077-1081 [doi]
• Iterative Decoding of Reed-Solomon Codes based on Non-binary MatricesV. B. Wijekoon, Hoang Dau, Emanuele Viterbo. 1082-1086 [doi]
• On the I/O Costs in Repairing Short-Length Reed-Solomon CodesWeiqi Li, Hoang Dau, Zhiying Wang, Hamid Jafarkhani, Emanuele Viterbo. 1087-1091 [doi]
• Distributed and Private Coded Matrix Computation with Flexible Communication LoadMalihe Aliasgari, Osvaldo Simeone, Jörg Kliewer. 1092-1096 [doi]
• Private Secure Coded ComputationMinchul Kim, Jungwoo Lee 0001. 1097-1101 [doi]
• Harmonic Coding: An Optimal Linear Code for Privacy-Preserving Gradient-Type ComputationQian Yu, Amir Salman Avestimehr. 1102-1106 [doi]
• GASP Codes for Secure Distributed Matrix MultiplicationRafael G. L. D'Oliveira, Salim El Rouayheb, David A. Karpuk. 1107-1111 [doi]
• INTERPOL: Information Theoretically Verifiable Polynomial EvaluationSaeid Sahraei, Amir Salman Avestimehr. 1112-1116 [doi]
• Remarks on Rényi versions of conditional entropy and mutual informationGautam Aishwarya, Mokshay Madiman. 1117-1121 [doi]
• Strong Chain Rules for Min-Entropy under Few Bits SpoiledMaciej Skórski. 1122-1126 [doi]
• Greedy additive approximation algorithms for minimum-entropy coupling problemMassimiliano Rossi. 1127-1131 [doi]
• A Correlation Measure Based on Vector-Valued Lp NormsMohammad Mahdi Mojahedian, Salman Beigi, Amin Gohari, Mohammad Hossein Yassaee, Mohammad Reza Aref. 1132-1136 [doi]
• Entropic Central Limit Theorem for Rényi EntropyJiange Li, Arnaud Marsiglietti, James Melbourne. 1137-1141 [doi]
• Duality between source coding with quantum side information and c-q channel codingHao-Chung Cheng, Eric P. Hanson, Nilanjana Datta, Min-Hsiu Hsieh. 1142-1146 [doi]
• Entanglement-Assisted Quantum Data CompressionZahra Baghali Khanian, Andreas J. Winter 0002. 1147-1151 [doi]
• Distributed Compression of Correlated Classical-Quantum SourcesZahra Baghali Khanian, Andreas J. Winter 0002. 1152-1156 [doi]
• Convexity and Operational Interpretation of the Quantum Information Bottleneck FunctionNilanjana Datta, Christoph Hirche, Andreas Winter. 1157-1161 [doi]
• Faithful Simulation of Distributed Quantum Measurements with Applications in Distributed Rate-Distortion TheoryMohsen Heidari, Touheed Anwar Atif, S. Sandeep Pradhan. 1162-1166 [doi]
• RLS-Based Detection for Massive Spatial Modulation MIMOAli Bereyhi, Saba Asaad, Bernhard Gäde, Ralf R. Müller. 1167-1171 [doi]
• DNN assisted Sphere DecoderAymen Askri, Ghaya Rekaya-Ben Othman. 1172-1176 [doi]
• The Degrees of Freedom of MIMO Relay under Coherence DiversityFan Zhang, Aria Nosratinia. 1177-1181 [doi]
• Ergodic MIMO Mutual Information: Twenty Years After Emre TelatarLu Wei. 1182-1186 [doi]
• Orthogonal Precoder for Integer-Forcing MIMOMohammad Nur Hasan, Brian M. Kurkoski, Amin Sakzad, Emanuele Viterbo. 1187-1191 [doi]
• Boolean Functions with Biased Inputs: Approximation and Noise SensitivityMohsen Heidari, S. Sandeep Pradhan, Ramji Venkataramanan. 1192-1196 [doi]
• On the Mutual Information of Two Boolean Functions, with Application to PrivacyGermán Bassi, Mikael Skoglund. 1197-1201 [doi]
• On the Most Informative Boolean Functions of the Very Noisy ChannelHengjie Yang, Richard D. Wesel. 1202-1206 [doi]
• Low-degree Pseudo-Boolean Function Recovery Using CodesOrhan Ocal, Swanand Kadhe, Kannan Ramchandran. 1207-1211 [doi]
• Searching for Highly Nonlinear DPA-Resistant Balanced Boolean Functions in the Rotation Symmetric ClassYoule Xu, Qichun Wang. 1212-1216 [doi]
• An Optimal Linear Error Correcting Delivery Scheme for Coded Caching with Shared CachesNujoom Sageer Karat, Spandan Dey, Anoop Thomas, B. Sundar Rajan. 1217-1221 [doi]
• The Exact Capacity-Memory Tradeoff for Caching with Uncoded Prefetching in the Two-Receiver Gaussian Broadcast ChannelMohamed Salman, Mahesh K. Varanasi. 1222-1226 [doi]
• Coded Caching based on Combinatorial DesignsShailja Agrawal, K. V. Sushena Sree, Prasad Krishnan. 1227-1231 [doi]
• Rate-Memory Trade-off for Multi-access Coded Caching with Uncoded PlacementKota Srinivas Reddy, Nikhil Karamchandani. 1232-1236 [doi]
• Optimal Scalar Linear Codes for a Class of Jointly Extended Groupcast Index Coding ProblemsChinmayananda Arunachala, B. Sundar Rajan. 1237-1241 [doi]
• Generalized Alignment Chain: Improved Converse Results for Index CodingYucheng Liu, Parastoo Sadeghi. 1242-1246 [doi]
• Reduced Complexity Index Codes and Improved Upperbound on Broadcast Rate for Neighboring Interference ProblemsMahesh Babu Vaddi, B. Sundar Rajan. 1247-1251 [doi]
• A Generalisation of Interlinked Cycle Structures and Their Index Coding CapacityMahesh Babu Vaddi, B. Sundar Rajan. 1252-1256 [doi]
• Weakly-Private Information RetrievalHsuan-Yin Lin, Siddhartha Kumar, Eirik Rosnes, Alexandre Graell i Amat, Eitan Yaakobi. 1257-1261 [doi]
• On the Capacity of Leaky Private Information RetrievalIslam Samy, Ravi Tandon, Loukas Lazos. 1262-1266 [doi]
• Private Information Retrieval from Heterogeneous Uncoded Caching DatabasesKarim Banawan, Batuhan Arasli, Yi-Peng Wei, Sennur Ulukus. 1267-1271 [doi]
• Private Information Retrieval from Non-Replicated DatabasesKarim Banawan, Sennur Ulukus. 1272-1276 [doi]
• New Sum-Rate Capacity Results for Multi-User Interference ChannelsReza K. Farsani. 1277-1281 [doi]
• On the Capacity of Gaussian Multiple-Access Interference ChannelsSubhajit Majhi, Patrick Mitran. 1282-1286 [doi]
• Opportunistic Topological Interference ManagementXinping Yi, Hua Sun. 1287-1291 [doi]
• Ergodic Spatial Nulling for Achieving Interference Free RatesAmir Leshem, Uri Erez. 1292-1296 [doi]
• Convergent Dynamics for Solving the TAP Equations of Ising Models with Arbitrary Rotation Invariant Coupling MatricesBurak Çakmak, Manfred Opper. 1297-1301 [doi]
• Gaussian Graphical Model Selection from Size Constrained MeasurementsGautam Dasarathy. 1302-1306 [doi]
• Structure Learning of Similar Ising Models: Information-theoretic BoundsSaurabh Sihag, Ali Tajer. 1307-1311 [doi]
• Graph Learning with Partial Observations: Role of Degree ConcentrationVincenzo Matta, Augusto Santos, Ali H. Sayed. 1312-1316 [doi]
• Joint Source-Channel Coding for the Multiple-Access Channel with Correlated SourcesArezou Rezazadeh, Josep Font-Segura, Alfonso Martinez, Albert Guillén i Fàbregas. 1317-1321 [doi]
• Joint Source-Channel Coding for the Transmission of Correlated Sources over Two-Way ChannelsJian-Jian Weng, Fady Alajaji, Tamás Linder. 1322-1326 [doi]
• Joint Source-Channel Coding for Gaussian Sources over AWGN Channels using Variational AutoencodersYashas Malur Saidutta, Afshin Abdi, Faramarz Fekri. 1327-1331 [doi]
• A Lower Bound on the Expected Distortion of Joint Source-Channel CodingYuval Kochman, Or Ordentlich, Yury Polyanskiy. 1332-1336 [doi]
• Hamming Distance Distribution of the 0-reprocessing Estimate of the Ordered Statistic DecoderChentao Yue, Mahyar Shirvanimoghaddam, Yonghui Li 0001, Branka Vucetic. 1337-1341 [doi]
• Improved Iterative Decoding of Product Codes Based on Trusted SymbolsChristian Senger. 1342-1346 [doi]
• Estimating the Maximum a Posteriori Threshold for Serially Concatenated Turbo CodesTarik Benaddi, Arti D. Yardi, Charly Poulliat, Iryna Andriyanova. 1347-1351 [doi]
• Statistical Learning Aided Decoding of BMST Tail-Biting Convolutional CodeXiao Ma, Wenchao Lin, Suihua Cai, Baodian Wei. 1352-1356 [doi]
• Successive Cancellation Decoding of Polar Codes for Insertion/Deletion Error CorrectionHikari Koremura, Haruhiko Kaneko. 1357-1361 [doi]
• Polar Codes for the Deletion Channel: Weak and Strong PolarizationIdo Tal, Henry D. Pfister, Arman Fazeli, Alexander Vardy. 1362-1366 [doi]
• Correcting Deletions in Multiple-Heads Racetrack MemoriesJin Sima, Jehoshua Bruck. 1367-1371 [doi]
• Coding for Deletion Channels with Multiple TracesMahed Abroshan, Ramji Venkataramanan, Lara Dolecek, Albert Guillén i Fàbregas. 1372-1376 [doi]
• How to Use Undiscovered Information Inequalities: Direct Applications of the Copy LemmaEmirhan Gürpinar, Andrei E. Romashchenko. 1377-1381 [doi]
• Scalable Automated Proving of Information Theoretic Inequalities with Proximal AlgorithmsLin Ling, Chee-Wei Tan 0001, Siu-Wai Ho, Raymond W. Yeung. 1382-1386 [doi]
• Almost Exact Analysis of Soft Covering Lemma via Large DeviationMohammad Hossein Yassaee. 1387-1391 [doi]
• An Elementary Proof of a Classical Information-Theoretic FormulaXianming Liu, Ronit Bustin, Guangyue Han, Shlomo Shamai Shitz. 1392-1396 [doi]
• Convolutional Decoding of Polar CodesArman Fazeli, Alexander Vardy, Hanwen Yao. 1397-1401 [doi]
• On Polar Coding for Binary Dirty PaperBarak Beilin, David Burshtein. 1402-1406 [doi]
• Polar Coding for Parallel Gaussian ChannelsDavid Tse, Bin Li 0013, Kai Chen 0013, Ling Liu, Jiaqi Gu. 1407-1411 [doi]
• Reduced complexity window processing of binary polarization kernelsGrigorii Trofimiuk, Peter Trifonov. 1412-1416 [doi]
• Distributed Stochastic Gradient Descent Using LDGM CodesShunsuke Horii, Takahiro Yoshida, Manabu Kobayashi, Toshiyasu Matsushima. 1417-1421 [doi]
• Mapping Heterogeneity Does Not Affect Wireless Coded MapReduceEleftherios Lampiris, Daniel Jiménez Zorrilla, Petros Elia. 1422-1426 [doi]
• CAMR: Coded Aggregated MapReduceKonstantinos Konstantinidis, Aditya Ramamoorthy. 1427-1431 [doi]
• Machine Learning at the Wireless Edge: Distributed Stochastic Gradient Descent Over-the-AirMohammad Mohammadi Amiri, Deniz Gündüz. 1432-1436 [doi]
• High-Dimensional Linear Regression and Phase Retrieval via PSLQ Integer Relation AlgorithmDavid Gamarnik, Eren C. Kizildag. 1437-1441 [doi]
• Improved MDL Estimators Using Local Exponential Family Bundles Applied to Mixture FamiliesKohei Miyamoto, Andrew R. Barron, Jun'ichi Takeuchi. 1442-1446 [doi]
• Minimax Regression via Adaptive Nearest NeighborPuning Zhao, Lifeng Lai. 1447-1451 [doi]
• Learning Feature Nonlinearities with Regularized Binned RegressionSamet Oymak, Mehrdad Mahdavi, Jiasi Chen. 1452-1456 [doi]
• Achieving Vanishing Rate Loss in Decentralized Network MIMOAntonio Bazco Nogueras, Lorenzo Miretti, Paul de Kerret, David Gesbert, Nicolas Gresset. 1457-1461 [doi]
• Cloud-Assisted On-Sensor Observation Classification in Latency-Impeded IoT SystemsIgor Burago, Marco Levorato. 1462-1466 [doi]
• Latency Limits for Content Delivery in a Fog-RAN with D2D CommunicationRoy Karasik, Osvaldo Simeone, Shlomo Shamai Shitz. 1467-1471 [doi]
• Capacity Scaling for Cloud Radio Access Networks with Limited Orthogonal FronthaulShouvik Ganguly, Young-Han Kim 0001. 1472-1476 [doi]
• Directed Intersection Representations and the Information Content of DigraphsAlexandr V. Kostochka, Xujun Liu, Roberto Machado, Olgica Milenkovic. 1477-1481 [doi]
• On the Connectivity of Inhomogeneous Random K-out GraphsRashad Eletreby, Osman Yagan. 1482-1486 [doi]
• Counting Homomorphisms in Bipartite GraphsShahab Shams, Nicholas Ruozzi, Péter Csikvári. 1487-1491 [doi]
• Counting Graphs with a Given Degree Sequence: An Information-theoretic PerspectiveShahar Stein Ioushua, Ofer Shayevitz. 1492-1496 [doi]
• On Stochastic Orders and Fading Gaussian Multi-User Channels with Statistical CSITPin-Hsun Lin, Eduard A. Jorswieck, Carsten R. Janda, Martin Mittelbach, Rafael F. Schaefer. 1497-1501 [doi]
• Using Quantization to Deploy Heterogeneous Nodes in Two-Tier Wireless Sensor NetworksSaeed Karimi-Bidhendi, Jun Guo 0006, Hamid Jafarkhani. 1502-1506 [doi]
• On the Capacity Scalability of Line Networks with Buffer Size ConstraintsShenghao Yang, Jie Wang, Yanyan Dong, Yiheng Zhang. 1507-1511 [doi]
• A Fast Node Arrangement Algorithm of Wireless Sensor Networks for Two-dimensional ConstraintsTakahiro Ota, Ryoji Nakamura, Akiko Manada. 1512-1516 [doi]
• Asymptotics of Entropy of the Dirichlet-Multinomial DistributionKrzysztof Turowski, Philippe Jacquet, Wojciech Szpankowski. 1517-1521 [doi]
• Decision Procedure for the Existence of Two-Channel Prefix-Free CodesHoover H. F. Yin, Ka Hei Ng, Yu Ting Shing, Russell W. F. Lai, Xishi Wang. 1522-1526 [doi]
• Enumeration and Coding of Compact Code Trees for Binary AIFV CodesKengo Hashimoto, Ken-ichi Iwata, Hirosuke Yamamoto. 1527-1531 [doi]
• Variable-length compression and secrecy by designYanina Y. Shkel, Rick S. Blum, H. Vincent Poor. 1532-1536 [doi]
• Reed-Solomon Codes over Fields of Characteristic ZeroCarmen Sippel, Cornelia Ott, Sven Puchinger, Martin Bossert. 1537-1541 [doi]
• Polynomial Linear System Solving with Errors by Simultaneous Polynomial Reconstruction of Interleaved Reed-Solomon CodesEleonora Guerrini, Romain Lebreton, Ilaria Zappatore. 1542-1546 [doi]
• Progressive Module Minimization for Re-encoding Transformed Soft Decoding of RS CodesJiongyue Xing, Li Chen, Martin Bossert. 1547-1551 [doi]
• On Fractional Decoding of Reed-Solomon CodesWelington Santos. 1552-1556 [doi]
• On the Optimal Reconstruction Degree of Fractional Repetition CodesBing Zhu 0003, Kenneth W. Shum, Hui Li, Weiping Wang. 1557-1561 [doi]
• Capacity of dynamical storage systemsOhad Elishco, Alexander Barg. 1562-1566 [doi]
• On Epsilon-MSCR Codes for Two ErasuresBh. Rekha Devi, V. Lalitha. 1567-1571 [doi]
• Convolutional LPDC codes for Distributed Storage SystemsRoberta Barbi, Pascal Felber, Laurent Hayez, Hugues Mercier. 1572-1576 [doi]
• Update Bandwidth for Distributed StorageZhengrui Li, Sian-Jheng Lin. 1577-1581 [doi]
• Double and Triple Node-Erasure-Correcting Codes over GraphsLev Yohananov, Yuval Efron, Eitan Yaakobi. 1582-1586 [doi]
• Bounds on Codes for the Bit-Shift Channel with (d, k)-Constrained InputsMladen Kovacevic 0001. 1587-1591 [doi]
• The Capacity of Count-Constrained ICI-Free SystemsNavin Kashyap, Ron M. Roth, Paul H. Siegel. 1592-1596 [doi]
• Coding for Write ℓ-step-up MemoriesYeow Meng Chee, Han Mao Kiah, A. J. Han Vinck, Van Khu Vu, Eitan Yaakobi. 1597-1601 [doi]
• Efficient MDS Array Codes for Correcting Multiple Column ErasuresZhijie Huang, Hong Jiang, Hao Che, Nong Xiao, Ning Li. 1602-1606 [doi]
• Perfect Codes in Euclidean Lattices: Bounds and Case StudiesGiselle Strey, Antonio Campello, João E. Strapasson, Sueli I. R. Costa. 1607-1611 [doi]
• k dimensionsHenrique K. Miyamoto, Henrique N. Sá Earp, Sueli I. R. Costa. 1612-1616 [doi]
• Double Nearest-Neighbor Error Correcting Codes on Hexagonal Signal ConstellationHiroyoshi Morita. 1617-1621 [doi]
• On the CVP for the root lattices via folding with deep ReLU neural networksVincent Corlay, Joseph J. Boutros, Philippe Ciblat, Loïc Brunel. 1622-1626 [doi]
• List Decoding Random Euclidean Codes and Infinite ConstellationsYihan Zhang, Shashank Vatedka. 1627-1631 [doi]
• Broadcasting on Random NetworksAnuran Makur, Elchanan Mossel, Yury Polyanskiy. 1632-1636 [doi]
• Degrees of Freedom Region of the (M, N1, N2) MIMO Broadcast Channel with Partial CSIT: An Application of Sum-set InequalitiesArash Gholami Davoodi, Syed Ali Jafar. 1637-1641 [doi]
• Capacity Results via Message Merging and Superposition Coding in the K-Receiver Broadcast Channel with General Message SetsMohamed Salman, Mahesh K. Varanasi. 1642-1646 [doi]
• No Feedback, No Problem: Capacity of Erasure Broadcast Channels with Single-User Delayed CSIShih-Chun Lin, I-Hsiang Wang, Alireza Vahid. 1647-1651 [doi]
• Broadcasting Correlated Gaussians and Asymmetric Data TransmissionShraga I. Bross. 1652-1656 [doi]
• Private Computation with Side Information: The Single-Server CaseAnoosheh Heidarzadeh, Alex Sprintson. 1657-1661 [doi]
• Capacity of Single-Server Single-Message Private Information Retrieval with Private Coded Side InformationAnoosheh Heidarzadeh, Fatemeh Kazemi, Alex Sprintson. 1662-1666 [doi]
• Private Sequential Function ComputationBehrooz Tahmasebi, Mohammad Ali Maddah-Ali. 1667-1671 [doi]
• Private Polynomial Computation from Lagrange EncodingNetanel Raviv, David A. Karpuk. 1672-1676 [doi]
• Private Polynomial Computation for Noncolluding Coded DatabasesSarah A. Obead, Hsuan-Yin Lin, Eirik Rosnes, Jörg Kliewer. 1677-1681 [doi]
• Fast Construction of Almost Optimal Symbol Distributions for Asymmetric Numeral SystemsDanny Dubé, Hidetoshi Yokoo. 1682-1686 [doi]
• Entropy Bounds for Grammar-Based Tree CompressorsDanny Hucke, Markus Lohrey, Louisa Seelbach Benkner. 1687-1691 [doi]
• Lossless Source Coding in the Point-to-Point, Multiple Access, and Random Access ScenariosShuqing Chen, Michelle Effros, Victoria Kostina. 1692-1696 [doi]
• Compression of Preferential Attachment GraphsTomasz Luczak, Abram Magner, Wojciech Szpankowski. 1697-1701 [doi]
• New Uniform Bounds for Almost Lossless Analog CompressionYonatan Gutman, Adam Spiewak. 1702-1706 [doi]
• From Classical to Semi-Quantum Secure CommunicationAllison Gagliano, Walter O. Krawec, Hasan Iqbal. 1707-1711 [doi]
• Publicness, Privacy and Confidentiality in the Single-Serving Quantum Broadcast ChannelFarzin Salek, Min-Hsiu Hsieh, Javier R. Fonollosa. 1712-1716 [doi]
• Simultaneous transmission of classical and quantum information under channel uncertainty and jamming attacksHolger Boche, Gisbert Janßen, Sajad Saeedinaeeni. 1717-1721 [doi]
• Message Transmission over Classical Quantum Channels with a Jammer with Side Information, Correlation as Resource and Common Randomness GeneratingHolger Boche, Minglai Cai, Ning Cai 0001. 1722-1726 [doi]
• Capacity of Quantum Private Information Retrieval with Multiple ServersSeunghoan Song, Masahito Hayashi. 1727-1731 [doi]
• A Lower Bound on the Error Exponent of Linear Block Codes over the Erasure ChannelEnrico Paolini, Gianluigi Liva. 1732-1736 [doi]
• Generalized Sphere-Packing Bound for Subblock-Constrained CodesHan Mao Kiah, Anshoo Tandon, Mehul Motani. 1737-1741 [doi]
• Improved Upper Bounds on the Hermite and KZ ConstantsJinming Wen, Xiao-Wen Chang, Jian Weng. 1742-1746 [doi]
• Linear Programming Bounds for Cardinality and Energy of Codes of Given Min and Max DistancesPeter Boyvalenkov, Peter Dragnev, Douglas P. Hardin, Edward B. Saff, Maya Stoyanova. 1747-1751 [doi]
• On the Maximum Number of Codewords of X-Codes of Constant Weight ThreeYu Tsunoda, Yuichiro Fujiwara. 1752-1756 [doi]
• Explicit Polar Codes with Small Scaling ExponentHanwen Yao, Arman Fazeli, Alexander Vardy. 1757-1761 [doi]
• Polar Coding for Common Message Only Wiretap Broadcast ChannelJaume del Olmo Alòs, Javier R. Fonollosa. 1762-1766 [doi]
• Puncturing and Shortening for Polar Codes via the Partial Order by Binary DominationMin Jang, Seok-Ki Ahn, Hongsil Jeong, Kyung-Joong Kim, Seho Myung, Sang-Hyo Kim, Kyeongcheol Yang. 1767-1771 [doi]
• How to Modify Polar Codes for List DecodingMohammad Rowshan, Emanuele Viterbo. 1772-1776 [doi]
• Universally Decodable Matrices for Distributed Matrix-Vector MultiplicationAditya Ramamoorthy, Li Tang 0004, Pascal O. Vontobel. 1777-1781 [doi]
• Irregular Product Coded Computation for High-Dimensional Matrix MultiplicationHyegyeong Park, Jaekyun Moon. 1782-1786 [doi]
• Download and Access Trade-offs in Lagrange Coded ComputingNetanel Raviv, Qian Yu, Jehoshua Bruck, Salman Avestimehr. 1787-1791 [doi]
• Distributed Matrix Multiplication with MDS Array BP-XOR Codes for Scaling ClustersSuayb S. Arslan. 1792-1796 [doi]
• Linearly Convergent Algorithms for Learning Shallow Residual NetworksGauri Jagatap, Chinmay Hegde. 1797-1801 [doi]
• Cost-Aware Learning for Improved Identifiability with Multiple ExperimentsLongyun Guo, Jean Honorio, John Morgan. 1802-1806 [doi]
• Classification in a Large NetworkVinay A. Vaishampayan. 1807-1811 [doi]
• Shallow Neural Network can Perfectly Classify an Object following Separable Probability DistributionYoungjae Min, Hye Won Chung. 1812-1816 [doi]
• Exponential Strong Converse for Successive Refinement with Causal Decoder Side InformationLin Zhou 0002, Alfred Hero. 1817-1821 [doi]
• A New Proof for the Quadratic Gaussian Two-Encoder Source-Coding ProblemOmer Bilgen, Aaron B. Wagner. 1822-1826 [doi]
• Towards an Algebraic Network Information Theory: Distributed Lossy Computation of Linear FunctionsSung-Hoon Lim, Chen Feng 0001, Adriano Pastore, Bobak Nazer, Michael Gastpar. 1827-1831 [doi]
• Vector Gaussian Successive Refinement With Degraded Side InformationYinfei Xu, Xuan Guang, Jian Lu. 1832-1836 [doi]
• On the question of the best additive noise among symmetric log-concave noisesMokshay Madiman, Piotr Nayar, Tomasz Tkocz. 1837-1841 [doi]
• Equality in the Matrix Entropy-Power Inequality and Blind Separation of Real and Complex sourcesOlivier Rioul, Ram Zamir. 1842-1846 [doi]
• Unifying the Brascamp-Lieb Inequality and the Entropy Power InequalityVenkat Anantharam, Varun Jog, Chandra Nair. 1847-1851 [doi]
• Exponent Trade-off for Hypothesis Testing Over Noisy ChannelsNir Weinberger, Yuval Kochman, Michèle Wigger. 1852-1856 [doi]
• Permutation Recovery from Multiple Measurement Vectors in Unlabeled SensingHang Zhang, Martin Slawski, Ping Li. 1857-1861 [doi]
• Concentration and Tail Bounds for Missing MassPrafulla Chandra, Andrew Thangaraj. 1862-1866 [doi]
• Provable Subspace Tracking with Missing EntriesPraneeth Narayanamurthy, Vahid Daneshpajooh, Namrata Vaswani. 1867-1871 [doi]
• Improved Veron Identification and Signature Schemes in the Rank MetricEmanuele Bellini 0002, Florian Caullery, Philippe Gaborit, Marc Manzano, Víctor Mateu. 1872-1876 [doi]
• Breaking HK17 in PracticeHaoyu Li, Renzhang Liu, Qutaibah M. Malluhi, Yanbin Pan, Yongge Wang, Tianyuan Xie. 1877-1881 [doi]
• Improved iterative decoding of QC-MDPC codes in the McEliece public key cryptosystemIrina E. Bocharova, Thomas Johansson, Boris D. Kudryashov. 1882-1886 [doi]
• On Decoding and Applications of Interleaved Goppa CodesLukas Holzbaur, Hedongliang Liu, Sven Puchinger, Antonia Wachter-Zeh. 1887-1891 [doi]
• Computable Upper Bounds for Unifilar Finite-State ChannelsBashar Huleihel, Oron Sabag, Haim H. Permuter, Navin Kashyap, Shlomo Shamai Shitz. 1892-1896 [doi]
• A Deterministic Algorithm for the Capacity of Finite-State ChannelsChengyu Wu, Guangyue Han, Brian H. Marcus. 1897-1901 [doi]
• An Iterative Algorithm to Optimize the Average Performance of Markov Chains with Finite StatesRyusei Fujita, Ken-ichi Iwata, Hirosuke Yamamoto. 1902-1906 [doi]
• An Upper Bound on the Number of Mass Points in the Capacity Achieving Distribution for the Amplitude Constrained Additive Gaussian ChannelSemih Yagli, Alex Dytso, H. Vincent Poor, Shlomo Shamai Shitz. 1907-1911 [doi]
• The punctured Dodecacode is uniformly packedDenis S. Krotov, Patrick Solé. 1912-1916 [doi]
• On Dual Codes in the Doob SchemesDenis S. Krotov. 1917-1921 [doi]
• Spectral Bounds for Quasi-Twisted CodesMartianus Frederic Ezerman, San Ling, Buket Özkaya, Jareena Tharnnukhroh. 1922-1926 [doi]
• Speeding up decoding a code with a non-trivial automorphism group up to an exponential factorRodolfo Canto Torres, Jean-Pierre Tillich. 1927-1931 [doi]
• On Construction of Polar Subcodes with Large KernelsPeter Trifonov. 1932-1936 [doi]
• On the Polarization Levels of Automorphic-Symmetric ChannelsRajai Nasser. 1937-1941 [doi]
• Design of Polar Codes for Parallel Channels with an Average Power ConstraintThomas Wiegart, Tobias Prinz, Fabian Steiner, Peihong Yuan. 1942-1946 [doi]
• Improved Hybrid Design of Polar Codes and Multi-Kernel Polar CodesValerio Bioglio, Ingmar Land, Carlo Condo. 1947-1951 [doi]
• Probabilistic Forwarding of Coded Packets on NetworksB. R. Vinay Kumar, Navin Kashyap. 1952-1956 [doi]
• On the Minimum Delay of Block Interleaver for Batched Network CodesHoover H. F. Yin, Ka Hei Ng, Xishi Wang, Qi Cao. 1957-1961 [doi]
• A Unified Adaptive Recoding Framework for Batched Network CodingHoover H. F. Yin, Bin Tang, Ka Hei Ng, Shenghao Yang, Xishi Wang, Qiaoqiao Zhou. 1962-1966 [doi]
• Packet Efficiency of BATS Coding on Wireless Relay Network with OverhearingHoover H. F. Yin, Xiaoli Xu, Ka Hei Ng, Yong Liang Guan, Raymond W. Yeung. 1967-1971 [doi]
• Local Geometry of Cross Entropy Loss in Learning One-Hidden-Layer Neural NetworksHaoyu Fu, Yuejie Chi, Yingbin Liang. 1972-1976 [doi]
• An Information-Theoretic Explanation for the Adversarial Fragility of AI ClassifiersHui Xie, Jirong Yi, Weiyu Xu, Raghu Mudumbai. 1977-1981 [doi]
• An Information Theoretic Interpretation to Deep Neural NetworksShao-Lun Huang, Xiangxiang Xu 0001, Lizhong Zheng, Gregory W. Wornell. 1984-1988 [doi]
• Being correct eventually almost surelyChanglong Wu, Narayana Santhanam. 1989-1993 [doi]
• Strong Converse for Hypothesis Testing Against Independence over a Two-Hop NetworkDaming Cao, Lin Zhou 0002, Vincent Y. F. Tan. 1994-1998 [doi]
• Operational Equivalence of Distributed Hypothesis Testing and Identification SystemsMinh Thanh Vu, Tobias J. Oechtering, Mikael Skoglund. 1999-2003 [doi]
• Hypothesis Testing over a Noisy ChannelSreejith Sreekumar, Deniz Gündüz. 2004-2008 [doi]
• Spatial Soft-Core CachingDerya Malak, Muriel Médard, Edmund M. Yeh. 2009-2013 [doi]
• Wyner's Network on Caches: Combining Receiver Caching with a Flexible BackhaulEleftherios Lampiris, Aly El Gamal, Petros Elia. 2014-2018 [doi]
• Reduce Transmission Delay for Caching-Aided Two-Layer NetworksKe Wang, Youlong Wu, Jiahui Chen, Haoyu Yin. 2019-2023 [doi]
• Compress-and-Forward via Multilevel CodingHeping Wan, Anders Høst-Madsen, Aria Nosratinia. 2024-2028 [doi]
• Gaussian Approximation of Quantization Error for Estimation from Compressed DataAlon Kipnis, Galen Reeves. 2029-2033 [doi]
• The CEO Problem with rth Power of Difference DistortionDaewon Seo, Lav R. Varshney. 2034-2038 [doi]
• Functional Covering of Point ProcessesNirmal V. Shende, Aaron B. Wagner. 2039-2043 [doi]
• From Parameter Estimation to Dispersion of Nonstationary Gauss-Markov ProcessesPeida Tian, Victoria Kostina. 2044-2048 [doi]
• Invariants and Inequivalence of Linear Rank-Metric CodesAlessandro Neri, Sven Puchinger, Anna-Lena Horlemann-Trautmann. 2049-2053 [doi]
• Interpolation-based Decoding of Nonlinear Maximum Rank Distance CodesChunlei Li. 2054-2058 [doi]
• Decoding Gabidulin Codes via Partial Inverses of Linearized PolynomialsJiun-Hung Yu, Hans-Andrea Loeliger. 2059-2063 [doi]
• Recursive projection-aggregation decoding of Reed-Muller codesMin Ye, Emmanuel Abbe. 2064-2068 [doi]
• An Analysis of State Evolution for Approximate Message Passing with Side InformationHangjin Liu, Cynthia Rush, Dror Baron. 2069-2073 [doi]
• Sparse Covariance Estimation from Quadratic Measurements: A Precise AnalysisEhsan Abbasi, Fariborz Salehi, Babak Hassibi. 2074-2078 [doi]
• Sparse Non-Negative Recovery from Shifted Symmetric Subgaussian Measurements using NNLSYonatan Shadmi, Peter Jung 0001, Giuseppe Caire. 2079-2083 [doi]
• Recovery of Structured Signals From Corrupted Non-Linear MeasurementsZhongxing Sun, Wei Cui 0001, Yulong Liu. 2084-2088 [doi]
• Universal Polarization for Processes with MemoryBoaz Shuval, Ido Tal. 2089-2093 [doi]
• On the Polarization of Rényi EntropyMengfan Zheng, Ling Liu, Cong Ling 0001. 2094-2098 [doi]
• On the Convergence of the Polarization Process in the Noisiness/Weak-∗ TopologyRajai Nasser. 2099-2103 [doi]
• A Lower Bound on Minimum Distance of Convolutional Polar CodesRuslan Morozov, Peter Trifonov. 2104-2108 [doi]
• Countably Infinite Multilevel Source Polarization for Non-Stationary Erasure DistributionsYuta Sakai, Ken-ichi Iwata, Hiroshi Fujisaki. 2109-2113 [doi]
• Private Information Retrieval from Decentralized Uncoded Caching DatabasesYi-Peng Wei, Batuhan Arasli, Karim Banawan, Sennur Ulukus. 2114-2118 [doi]
• Private Proximity RetrievalTuvi Etzion, Oliver W. Gnilke, David A. Karpuk, Eitan Yaakobi, YiWei Zhang. 2119-2123 [doi]
• The Capacity of Multi-round Private Information Retrieval from Byzantine DatabasesXinyu Yao, Nan Liu 0001, Wei Kang 0002. 2124-2128 [doi]
• Bounds on the Length of Functional PIR and Batch CodesYiWei Zhang, Eitan Yaakobi, Tuvi Etzion. 2129-2133 [doi]
• On the Access Complexity of PIR SchemesYiWei Zhang, Eitan Yaakobi, Tuvi Etzion, Moshe Schwartz 0001. 2134-2138 [doi]
• Predicate Privacy and List Privacy for a ρ-Recoverable FunctionAjaykrishnan Nageswaran, Prakash Narayan. 2139-2143 [doi]
• Privacy Amplification, Lossy Compression, and their Duality to Channel CodingJoseph M. Renes. 2144-2148 [doi]
• Secure list decodingMasahito Hayashi. 2149-2153 [doi]
• Universal Privacy Guarantees for Smart MetersMiguel Arrieta, Iñaki Esnaola, Michelle Effros. 2154-2158 [doi]
• Optimal Privacy-Utility Trade-off under a Rate ConstraintSreejith Sreekumar, Deniz Gündüz. 2159-2163 [doi]
• Throughput Scaling of Covert Communication over Wireless Adhoc NetworksKang-Hee Cho, Si-Hyeon Lee, Vincent Y. F. Tan. 2164-2168 [doi]
• Embedding Covert Information on a Given Broadcast CodeDavid Kibloff, Samir Medina Perlaza, Ligong Wang. 2169-2173 [doi]
• Secure Multiterminal Source Coding With ActionsJian Lu, Yinfei Xu, Ping Zhang, Qiao Wang. 2174-2178 [doi]
• Steganography Protocols for Quantum ChannelsMehrdad Tahmasbi, Matthieu R. Bloch. 2179-2183 [doi]
• In-Band Sensing of the Adversary's Channel for Secure Communication in Wireless ChannelsMehrdad Tahmasbi, Matthieu Bloch, Aylin Yener. 2184-2188 [doi]
• Sequential Change Detection Based on Universal Compression for Markov SourcesA. Verma, R. K. Bansal. 2189-2193 [doi]
• Quickest Search for a Change PointJavad Heydari, Ali Tajer. 2194-2198 [doi]
• Bayesian Quickest Detection of Changes in Statistically Periodic ProcessesTaposh Banerjee, Prudhvi Gurram, Gene T. Whipps. 2204-2208 [doi]
• On Byzantine Distributed Sequential Change Detection with Multiple HypothesesYu-Jui Huang, Shih-Chun Lin, Yu-Chih Huang. 2209-2213 [doi]
• Gambling and Rényi DivergenceCédric Bleuler, Amos Lapidoth, Christoph Pfister. 2214-2218 [doi]
• Properties of Scaled Noncommutative Rényi and Augustin InformationHao-Chung Cheng, Gao Li, Min-Hsiu Hsieh. 2219-2223 [doi]
• Rényi Entropy Power Inequalities for s-concave DensitiesJiange Li, Arnaud Marsiglietti, James Melbourne. 2224-2228 [doi]
• On Exact and ∞-Rényi Common InformationsLei Yu 0003, Vincent Y. F. Tan. 2229-2233 [doi]
• Source resolvability problem with respect to a certain subclass of f-divergenceRyo Nomura. 2234-2238 [doi]
• Real-time Binary Posterior MatchingAnusha Lalitha, Anatoly Khina, Tara Javidi, Victoria Kostina. 2239-2243 [doi]
• Algorithms for Q-ary Error-Correcting Codes with Partial Feedback and Limited MagnitudeChristian Deppe, Vladimir S. Lebedev. 2244-2248 [doi]
• Error Exponents of Parallel Two-way Discrete Memoryless Channels using Variable Length CodingKenneth Palacio-Baus, Meysam Asadi, Natasha Devroye. 2249-2253 [doi]
• Variable-length Coding Error Exponents for the AWGN Channel with Noisy Feedback at Zero-RateKenneth Palacio-Baus, Natasha Devroye. 2254-2258 [doi]
• Capacity-Achieving Coding Scheme for the MAC with Degraded Message Sets and FeedbackOron Sabag, Haim H. Permuter, Shlomo Shamai Shitz. 2259-2263 [doi]
• Constructions of Two-Dimensional Binary Z-Complementary Array PairsCheng-Yu Pai, Yong-Ting Ni, Yen-Cheng Liu, Meng-Hsien Kuo, Chao-Yu Chen. 2264-2268 [doi]
• Zero Correlation Zone Sequences from a Unified Construction of Perfect Polyphase SequencesDan Zhang. 2269-2273 [doi]
• λMin Zeng, Yuan Luo 0003, Min Kyu Song, Hong-Yeop Song. 2274-2278 [doi]
• A Direct and Generalized Construction of Polyphase Complementary Set With Low PMEPRPalash Sarkar 0002, Sudhan Majhi, Zilong Liu. 2279-2283 [doi]
• Near-Optimal Zero Correlation Zone Sequence Sets from Paraunitary MatricesShibsankar Das, Udaya Parampalli, Sudhan Majhi, Zilong Liu. 2284-2288 [doi]
• Universal Learning of Individual DataYaniv Fogel, Meir Feder. 2289-2293 [doi]
• Sample Complexity Bounds for Low-Separation-Rank Dictionary LearningMohsen Ghassemi, Zahra Shakeri, Waheed U. Bajwa, Anand D. Sarwate. 2294-2298 [doi]
• Harmless interpolation of noisy data in regressionVidya Muthukumar, Kailas Vodrahalli, Anant Sahai. 2299-2303 [doi]
• A New Look at an Old Problem: A Universal Learning Approach to Linear RegressionKoby Bibas, Yaniv Fogel, Meir Feder. 2304-2308 [doi]
• Secure Network Coding in the Setting in Which a Non-Source Node May Generate Random KeysDebaditya Chaudhuri, Michael Langberg, Michelle Effros. 2309-2313 [doi]
• Optimal Index Codes for Some Interlinked Cycle Structures with Outer CyclesShanuja Sasi, B. Sundar Rajan. 2314-2318 [doi]
• On Index coding for Complementary Graphs with focus on Circular Perfect GraphsM. Bhavana, Prasad Krishnan. 2319-2323 [doi]
• Codes for Updating Linear Functions over Small FieldsSuman Ghosh, Lakshmi Natarajan. 2324-2328 [doi]
• Blind Unwrapping of Modulo Reduced Gaussian Vectors: Recovering MSBs from LSBsElad Romanov, Or Ordentlich. 2329-2333 [doi]
• On the Distance Between the Rumor Source and Its Optimal Estimate in a Regular TreeTetsunao Matsuta, Tomohiko Uyematsu. 2334-2338 [doi]
• On the Price of Source Anonymity in Heterogeneous Parametric Point EstimationWei-Ning Chen, I-Hsiang Wang. 2339-2343 [doi]
• Secure Estimation under Causative AttacksSaurabh Sihag, Ali Tajer. 2344-2348 [doi]
• Universally Sparse Hypergraphs with Applications to Coding TheoryChong Shangguan, Itzhak Tamo. 2349-2353 [doi]
• On the size of pairwise-colliding permutationsJános Körner, Chandra Nair, David Ng. 2354-2358 [doi]
• Set-Codes with Small Intersections and Small DiscrepanciesRyan Gabrys, Hoang Dau, Charles J. Colbourn, Olgica Milenkovic. 2359-2363 [doi]
• Lower Bounds for Total Storage of Multiset Combinatorial Batch Codes using Linear ProgrammingYeow Meng Chee, Han Mao Kiah, Hui Zhang 0004. 2364-2368 [doi]
• Constrained de Bruijn Codes and their ApplicationsYeow Meng Chee, Tuvi Etzion, Han Mao Kiah, Van Khu Vu, Eitan Yaakobi. 2369-2373 [doi]
• List Decoding of Deletions Using Guess & Check CodesSerge Kas Hanna, Salim El Rouayheb. 2374-2378 [doi]
• Bounded Single Insertion/Deletion Correcting CodesTakayuki Nozaki. 2379-2383 [doi]
• *Luca G. Tallini, Nawaf Alqwaifly, Bella Bose. 2384-2388 [doi]
• Sequential anomaly detection with observation controlAristomenis Tsopelakos, Georgios Fellouris, Venugopal V. Veeravalli. 2389-2393 [doi]
• Detecting Changes in Hidden Markov ModelsGeorge V. Moustakides. 2394-2398 [doi]
• Quickest Detection of a Moving Target in a Sensor NetworkGeorgios Rovatsos, Shaofeng Zou, Venugopal V. Veeravalli. 2399-2403 [doi]
• A Tight Converse to the Asymptotic Performance of Byzantine Distributed Sequential Change DetectionYu-Chih Huang, Shih-Chun Lin, Yu-Jui Huang. 2404-2408 [doi]
• Querying Policies Based on Sparse Matrices for Noisy 20 QuestionsQin Huang, Simeng Zheng, Yuanhan Ni, Zulin Wang, Shuai Wang. 2409-2413 [doi]
• Relaxed Locally Correctable Codes in Computationally Bounded ChannelsJeremiah Blocki, Venkata Gandikota, Elena Grigorescu, Samson Zhou. 2414-2418 [doi]
• Analog Error-Correcting CodesRon M. Roth. 2419-2423 [doi]
• Decoding of Generalized Three-Layer Integrated Interleaved CodesXinmiao Zhang. 2424-2428 [doi]
• On Decoding Random-Access SC-LDPC CodesEshed Ram, Yuval Cassuto. 2429-2433 [doi]
• A Modified Min-Sum Algorithm for Quantized LDPC DecodersHomayoon Hatami, David G. M. Mitchell, Daniel J. Costello Jr., Thomas E. Fuja. 2434-2438 [doi]
• Using algebraic structures to improve LDPC code reconstruction over a noisy channelPierre Loidreau. 2439-2443 [doi]
• Deep Learning-Aided Trainable Projected Gradient Decoding for LDPC CodesTadashi Wadayama, Satoshi Takabe. 2444-2448 [doi]
• On the Computational Complexity of Blind Detection of Binary Linear CodesAlexios Balatsoukas-Stimming, Aris Filos-Ratsikas. 2449-2453 [doi]
• Complexity and Similarity for Sequences using LZ77-based conditional information measureFrançois Cayre, Nicolas Le Bihan. 2454-2458 [doi]
• On the Algorithmic Solvability of the Spectral Factorization and the Calculation of the Wiener Filter on Turing MachinesHolger Boche, Volker Pohl. 2459-2463 [doi]
• Permutation Code Equivalence is Not Harder Than Graph Isomorphism When Hulls Are TrivialMagali Bardet, Ayoub Otmani, Mohamed Saeed-Taha. 2464-2468 [doi]
• Fitting ReLUs via SGD and Quantized SGDSeyed Mohammadreza Mousavi Kalan, Mahdi Soltanolkotabi, Amir Salman Avestimehr. 2469-2473 [doi]
• On the Robustness of Noisy ACE Algorithm and Multi-Layer Residual LearningShao-Lun Huang, Xiangxiang Xu 0001. 2474-2478 [doi]
• A Tunable Loss Function for Binary ClassificationTyler Sypherd, Mario Diaz, Lalitha Sankar, Peter Kairouz. 2479-2483 [doi]
• Successive Refinement to Caching for Dynamic ContentPinar Sen, Michael Gastpar. 2484-2488 [doi]
• CodedSketch: Coded Distributed Computation of Approximated Matrix MultiplicationTayyebeh Jahani-Nezhad, Mohammad Ali Maddah-Ali. 2489-2493 [doi]
• Multicasting Energy and Information SimultaneouslyTing-Yi Wu, Anshoo Tandon, Lav R. Varshney, Mehul Motani. 2494-2498 [doi]
• Teaching and learning in uncertaintyVarun Jog. 2499-2503 [doi]
• An Almost Perfectly Predictable Process with No Optimal PredictorDariusz Kalocinski, Tomasz Steifer. 2504-2508 [doi]
• Mutual Information Estimation: Independence Detection and ConsistencyJoe Suzuki. 2514-2518 [doi]
• Optimal Resource Allocation for Cellular Networks with Virtual Cell Joint DecodingMichal Yemini, Andrea J. Goldsmith. 2519-2523 [doi]
• Whittle Index Policy for Multichannel Scheduling in Queueing SystemsSaad Kriouile, Maialen Larrañaga, Mohamad Assaad. 2524-2528 [doi]
• On Simple Scheduling in Half-Duplex Relay Diamond NetworksSarthak Jain, Mehran Elyasi, Martina Cardone, Soheil Mohajer. 2529-2533 [doi]
• On the Fundamental Limits of Multi-user Scheduling under Short-term Fairness ConstraintsShahram Shahsavari, Farhad Shirani 0001, Elza Erkip. 2534-2538 [doi]
• Online Learning with Diverse User PreferencesChao Gan, Jing Yang 0002, Ruida Zhou, Cong Shen. 2539-2543 [doi]
• Overlapping Multi-Bandit Best Arm IdentificationJonathan Scarlett, Ilija Bogunovic, Volkan Cevher. 2544-2548 [doi]
• Interactions Between Learning and Broadcasting in Wireless Recommendation SystemsLinqi Song, Christina Fragouli, Devavrat Shah. 2549-2553 [doi]
• Learning to Detect an Odd Markov ArmP. N. Karthik, Rajesh Sundaresan. 2554-2558 [doi]
• Application of Complementary Dual AG Codes to Entanglement-Assisted Quantum CodesFrancisco Revson F. Pereira, Ruud Pellikaan, Giuliano G. La Guardia, Francisco M. de Assis. 2559-2563 [doi]
• Stein's Lemma for Classical-Quantum ChannelsMario Berta, Christoph Hirche, Eneet Kaur, Mark M. Wilde. 2564-2568 [doi]
• Approximation algorithms for classical-quantum channel codingOmar Fawzi, Johanna Seif, Dániel Szilágyi. 2569-2573 [doi]
• Channel Decoding with Quantum Approximate Optimization AlgorithmToshiki Matsumine, Toshiaki Koike-Akino, Ye Wang. 2574-2578 [doi]
• The Asymptotic Complexity of Coded-BKW with Sieving Using Increasing Reduction FactorsErik Mårtensson. 2579-2583 [doi]
• Loong: a new IND-CCA-secure code-based KEMLi-Ping Wang. 2584-2588 [doi]
• Slice Sampling for Lattice Gaussian DistributionZheng Wang, Cong Ling. 2589-2593 [doi]
• Cryptanalysis of a One-Time Code-Based Digital Signature SchemePaolo Santini, Marco Baldi, Franco Chiaraluce. 2594-2598 [doi]
• Girth Properties of Time-Varying SC-LDPC Convolutional CodesMassimo Battaglioni, Marco Baldi, Franco Chiaraluce, Michael Lentmaier. 2599-2603 [doi]
• Code Design Principles for Ultra-Reliable Random Access with Preassigned PatternsChristopher Boyd, Roope Vehkalahti, Olav Tirkkonen, Antti Laaksonen. 2604-2608 [doi]
• LDPC Coded Multiuser Shaping for the Gaussian Multiple Access ChannelAlexios Balatsoukas-Stimming, Stefano Rini, Jörg Kliewer. 2609-2613 [doi]
• Spatially Coupled LDPC Codes via Partial SuperpositionQianfan Wang, Suihua Cai, Wenchao Lin, Li Chen 0013, Xiao Ma. 2614-2618 [doi]
• Coded Caching with Heterogeneous User ProfilesSu Wang, Borja Peleato. 2619-2623 [doi]
• Fundamental Limits of Coded Caching: The Memory Rate Pair (K - 1 - 1/K, 1/(K-1))Vijith Kumar K. P., Brijesh Kumar Rai, Tony Jacob. 2624-2628 [doi]
• Pareto Optimal Schemes in Coded CachingVijith Kumar K. P, Brijesh Kumar Rai, Tony Jacob. 2629-2633 [doi]
• Towards Jointly Optimal Placement and Delivery: To Code or Not to Code in Wireless Caching NetworksYousef AlHassoun, Faisal Alotaibi, Aly El Gamal, Hesham El Gamal. 2634-2638 [doi]
• A Computation-Communication Tradeoff Study for Mobile Edge Computing NetworksKuikui Li, Meixia Tao, Zhiyong Chen 0002. 2639-2643 [doi]
• Cascaded Coded Distributed Computing on Heterogeneous NetworksNicholas Woolsey, Rong-Rong Chen, Mingyue Ji. 2644-2648 [doi]
• Coded Federated Computing in Wireless Networks with Straggling Devices and Imperfect CSISukjong Ha, Jingjing Zhang, Osvaldo Simeone, Joonhyuk Kang. 2649-2653 [doi]
• Coded Elastic ComputingYaoqing Yang, Matteo Interlandi, Pulkit Grover, Soummya Kar, Saeed Amizadeh, Markus Weimer. 2654-2658 [doi]
• A Simple Derivation of the Refined SPB for the Constant Composition CodesBaris Nakiboglu. 2659-2663 [doi]
• Two Contributions to Error Exponents for Asynchronous Multiple Access ChannelLóránt Farkas, Tamás Kói. 2664-2668 [doi]
• Error Exponents of Typical Random Codes for the Colored Gaussian ChannelNeri Merhav. 2669-2673 [doi]
• Error Exponents in Distributed Hypothesis Testing of CorrelationsUri Hadar, Jingbo Liu, Yury Polyanskiy, Ofer Shayevitz. 2674-2678 [doi]
• An Efficient Algorithm for Capacity-Approaching Noisy Adaptive Group TestingJonathan Scarlett. 2679-2683 [doi]
• Nearly Sharp Restricted Isometry Condition of Rank Aware Order Recursive Matching PursuitJunhan Kim, Byonghyo Shim. 2684-2688 [doi]
• JOBS: Joint-Sparse Optimization from Bootstrap SamplesLuoluo Liu, Sang Peter Chin, Trac D. Tran. 2689-2693 [doi]
• The Group Restricted Isometry Property for Subgaussian Block Diagonal MatricesNiklas Koep, Arash Behboodi, Rudolf Mathar. 2694-2698 [doi]
• A Family of Bayesian Cramér-Rao Bounds, and Consequences for Log-Concave PriorsEfe Aras, Kuan-Yun Lee, Ashwin Pananjady, Thomas A. Courtade. 2699-2703 [doi]
• Fisher Information for Distributed Estimation under a Blackboard Communication ProtocolLeighton Pate Barnes, Yanjun Han, Ayfer Özgür. 2704-2708 [doi]
• Sample-Measurement Tradeoff in Support Recovery Under a Subgaussian PriorLekshmi Ramesh, Chandra R. Murthy, Himanshu Tyagi. 2709-2713 [doi]
• Towards theoretically-founded learning-based denoisingWenda Zhou, Shirin Jalali. 2714-2718 [doi]
• Data Encoding Methods for Byzantine-Resilient Distributed OptimizationDeepesh Data, Linqi Song, Suhas N. Diggavi. 2719-2723 [doi]
• Byzantine-Tolerant Distributed Coordinate DescentDeepesh Data, Suhas N. Diggavi. 2724-2728 [doi]
• Speeding Up Distributed Gradient Descent by Utilizing Non-persistent StragglersEmre Ozfatura, Deniz Gündüz, Sennur Ulukus. 2729-2733 [doi]
• Robust Gradient Descent via Moment Encoding and LDPC CodesRaj Kumar Maity, Ankit Singh Rawat, Arya Mazumdar. 2734-2738 [doi]
• A Construction of Traceability Set Systems with Polynomial Tracing AlgorithmElena Egorova, Marcel Fernandez, Grigory Kabatiansky. 2739-2742 [doi]
• How to Break the Limits of Secrecy Constraints in Communication Networks?Fan Li 0012, Jinyuan Chen. 2743-2747 [doi]
• A Concentration of Measure Approach to Database De-anonymizationFarhad Shirani 0001, Siddharth Garg, Elza Erkip. 2748-2752 [doi]
• Non-Malleable Codes against Active Physical Layer AdversaryFuchun Lin, Reihaneh Safavi-Naini, Mahdi Cheraghchi, Huaxiong Wang. 2753-2757 [doi]
• On the Analysis of Energy-Distortion Tradeoff for Zero-Delay Transmission over Gaussian Broadcast ChannelsCeren Sevinç, Ertem Tuncel. 2758-2762 [doi]
• Capacity per Unit-Energy of Gaussian Many-Access ChannelsJithin Ravi, Tobias Koch. 2763-2767 [doi]
• Energy efficient random access for the quasi-static fading MACSuhas S. Kowshik, Kirill V. Andreev, Alexey Frolov, Yury Polyanskiy. 2768-2772 [doi]
• On two-fold packings of radius-1 balls in Hamming graphsDenis S. Krotov, Vladimir N. Potapov. 2773-2777 [doi]
• Metrics which turn tilings into binary perfect codesGabriella Akemi Miyamoto, Marcelo Firer. 2778-2782 [doi]
• Unrestricted Generalized Column Distances: A Wider DefinitionSara D. Cardell, Diego Napp, Marcelo Firer. 2783-2787 [doi]
• Weights which respect support and NN-decodingRoberto Assis Machado, Marcelo Firer. 2788-2792 [doi]
• Rateless Codes for Distributed Computations with Sparse Compressed MatricesAnkur Mallick, Gauri Joshi. 2793-2797 [doi]
• Timely Coded ComputingChien-Sheng Yang, Ramtin Pedarsani, Amir Salman Avestimehr. 2798-2802 [doi]
• A Fundamental Storage-Communication Tradeoff in Distributed Computing with Straggling NodesQifa Yan, Michèle A. Wigger, Sheng Yang, Xiaohu Tang. 2803-2807 [doi]
• Tree Gradient CodingAmirhossein Reisizadeh, Saurav Prakash, Ramtin Pedarsani, Amir Salman Avestimehr. 2808-2812 [doi]
• Gradient Coding Based on Block Designs for Mitigating Adversarial StragglersSwanand Kadhe, Onur Ozan Koyluoglu, Kannan Ramchandran. 2813-2817 [doi]
• On Optimal Locally Repairable Codes with Super-Linear LengthHan Cai, Ying Miao, Moshe Schwartz 0001, Xiaohu Tang. 2818-2822 [doi]
• Improved bounds and Optimal Constructions of Locally Repairable Codes with distance 5 and 6Bin Chen 0011, Shu-Tao Xia, Jie Hao. 2823-2827 [doi]
• Classification of Optimal Ternary (r, δ)-Locally Repairable Codes Attaining the Singleton-like BoundJie Hao, Kenneth W. Shum, Shu-Tao Xia, Yi Xian Yang. 2828-2832 [doi]
• The Complete Hierarchical Locality of the Punctured Simplex CodeMatthias Grezet, Camilla Hollanti. 2833-2837 [doi]
• Locally Repairable Convolutional Codes with Sliding Window RepairUmberto Martínez-Peñas, Diego Napp. 2838-2842 [doi]
• SPARCs and AMP for Unsourced Random AccessAlexander Fengler, Peter Jung 0001, Giuseppe Caire. 2843-2847 [doi]
• Phase Transition in Mixed ℓ2/ℓ1-norm Minimization for Block-Sparse Compressed SensingToshiyuki Tanaka. 2848-2852 [doi]
• One-Bit ExpanderSketch for One-Bit Compressed SensingVasileios Nakos. 2853-2857 [doi]
• Security Analysis of Compressed Encryption With Sparse Matrices Against Chosen Plaintext AttacksWonwoo Cho, Nam Yul Yu. 2858-2862 [doi]
• Shannon Capacity is Achievable for a Large Class of Interactive Markovian ProtocolsAssaf Ben-Yishai, Ofer Shayevitz, Young-Han Kim 0001. 2863-2867 [doi]
• The Interactive Capacity of the Binary Symmetric Channel is at Least 1/40 the Shannon CapacityAssaf Ben-Yishai, Young-Han Kim 0001, Or Ordentlich, Ofer Shayevitz. 2868-2872 [doi]
• New Converses for the Relay Channel via Reverse HypercontractivityJingbo Liu, Ayfer Özgür. 2878-2882 [doi]
• An Inequality Useful for Proofs of Strong Converse Theorems in Network Information TheoryYasutada Oohama. 2883-2887 [doi]
• Pseudocodeword-based Decoding of Quantum Stabilizer CodesJuly X. Li, Pascal O. Vontobel. 2888-2892 [doi]
• The Encoding and Decoding Complexities of Entanglement-Assisted Quantum Stabilizer CodesKao-Yueh Kuo, Ching-Yi Lai. 2893-2897 [doi]
• Good Stabilizer Codes from Quasi-Cyclic Codes over F4 and F9Martianus Frederic Ezerman, San Ling, Buket Özkaya, Patrick Solé. 2898-2902 [doi]
• Stabilizer codes from modified symplectic formsTejas Gandhi, Piyush Kurur, Rajat Mittal. 2903-2907 [doi]
• Kerdock Codes Determine Unitary 2-DesignsTrung Can, Narayanan Rengaswamy, A. Robert Calderbank, Henry D. Pfister. 2908-2912 [doi]
• On the Optimal Delay Amplification Factor of Multi-Hop Relay ChannelsDennis Ogbe, Chih-Chun Wang, David J. Love. 2913-2917 [doi]
• Achievable Rates and Outer Bounds for Full-Duplex Relay Broadcast Channel with Side MessageKaiming Shen, Reza Khosravi-Farsani, Wei Yu 0001. 2918-2922 [doi]
• Asymptotic Analysis on LDPC-BICM Scheme for Compute-and-Forward RelayingSatoshi Takabe, Tadashi Wadayama, Masahito Hayashi. 2923-2927 [doi]
• Relaying One Bit Across a Tandem of Binary-Symmetric ChannelsWasim Huleihel, Yury Polyanskiy, Ofer Shayevitz. 2928-2932 [doi]
• Large Deviations of Typical Random CodesRan Averbuch, Neri Merhav, Albert Guillén i Fàbregas. 2933-2937 [doi]
• A Recursive Cost-Constrained Construction that Attains the Expurgated ExponentAnelia Somekh-Baruch, Jonathan Scarlett, Albert Guillén i Fàbregas. 2938-2942 [doi]
• On the Error Probability of Optimal Codes in Gaussian Channels under Maximal Power ConstraintGonzalo Vazquez-Vilar. 2943-2946 [doi]
• Asymptotics of the Random Coding Error Probability for Constant-Composition CodesJosep Font-Segura, Alfonso Martinez, Albert Guillén i Fàbregas. 2947-2951 [doi]
• Continuous-Source Fuzzy Extractors: Source uncertainty and insecurityBenjamin Fuller, Lowen Peng. 2952-2956 [doi]
• On (2n/3 - 1)-Resilient (n, 2)-FunctionsDenis S. Krotov. 2957-2961 [doi]
• On Isotopic Shift Construction for Planar FunctionsLilya Budaghyan, Marco Calderini, Claude Carlet, Robert S. Coulter, Irene Villa. 2962-2966 [doi]
• Scalable Information Flow Analysis of Secure Three-Party Affine ComputationsPatrick Ah-Fat, Michael Huth. 2967-2971 [doi]
• On the Complexity of the 3XORSUM ProblemSerdar Boztas. 2972-2976 [doi]
• A Novel Cache-aided Fog-RAN ArchitectureKai Wan, Daniela Tuninetti, Mingyue Ji, Giuseppe Caire. 2977-2981 [doi]
• Coded Caching with Small Subpacketization via Spatial Reuse and Content Base ReplicationAmirreza Asadzadeh, Giuseppe Caire. 2982-2986 [doi]
• Optimal Coded Caching under Statistical QoS InformationEmanuele Parrinello, Ayse Ünsal, Petros Elia. 2987-2991 [doi]
• On D2D Caching with Uncoded Cache PlacementÇagkan Yapar, Kai Wan, Rafael F. Schaefer, Giuseppe Caire. 2992-2996 [doi]
• Interactive Leakage Chain Rule for Quantum Min-entropyChing-Yi Lai, Kai-Min Chung. 2997-3001 [doi]
• Moderate deviation analysis of majorisation-based resource interconversionChristopher T. Chubb, Kamil Korzekwa, Marco Tomamichel. 3002-3006 [doi]
• One-Shot Randomized and Nonrandomized Partial DecouplingEyuri Wakakuwa, Yoshifumi Nakata. 3007-3011 [doi]
• Measuring Quantum EntropyJayadev Acharya, Ibrahim Issa, Nirmal V. Shende, Aaron B. Wagner. 3012-3016 [doi]
• Numerically Stable Polynomially Coded ComputingMohammad Fahim, Viveck R. Cadambe. 3017-3021 [doi]
• Distributed Matrix-Vector Multiplication: A Convolutional Coding ApproachAnindya Bijoy Das, Aditya Ramamoorthy. 3022-3026 [doi]
• Secret key distillation over a pure loss quantum wiretap channel under restricted eavesdroppingZiwen Pan, Kaushik P. Seshadreesan, William Clark, Mark R. Adcock, Ivan B. Djordjevic, Jeffrey H. Shapiro, Saikat Guha. 3032-3036 [doi]
• Secret Key Generation via Pulse-Coupled SynchronizationHessam Mahdavifar, Najme Ebrahimi. 3037-3041 [doi]
• Unique Information and Secret Key DecompositionsJohannes Rauh, Pradeep Kr. Banerjee, Eckehard Olbrich, Jürgen Jost. 3042-3046 [doi]
• Optimal Multiple Assignment Schemes Using Ideal Multipartite Secret Sharing SchemesReo Eriguchi, Noboru Kunihiro, Mitsugu Iwamoto. 3047-3051 [doi]
• Mean estimation for entangled single-sample distributionsAnkit Pensia, Varun Jog, Po-Ling Loh. 3052-3056 [doi]
• Global Optimality of Encoders and MSE Decoders for Communicating Unstable Markov Processes over Unstable Gaussian Recursive Models with Feedback: A Nonanticipative RDF ApproachCharalambos D. Charalambous, Christos K. Kourtellaris. 3057-3061 [doi]
• Maximum Likelihood Tensor Decomposition of Markov Decision ProcessChengzhuo Ni, Mengdi Wang. 3062-3066 [doi]
• Dual Loomis-Whitney inequalities via information theoryJing Hao, Varun Jog. 3067-3071 [doi]
• State Estimation via Worst-Case Erasure and Symmetric Channels with MemoryAmir Saberi, Farhad Farokhi, Girish N. Nair. 3072-3076 [doi]
• Optimal Streaming Erasure Codes over the Three-Node Relay NetworkSilas L. Fong, Ashish Khisti, Baochun Li, Wai-tian Tan, Xiaoqing Zhu, John G. Apostolopoulos. 3077-3081 [doi]
• Optimal Multiplexed Erasure Codes for Streaming Messages with Different Decoding DelaysSilas L. Fong, Ashish Khisti, Baochun Li, Wai-tian Tan, Xiaoqing Zhu, John G. Apostolopoulos. 3082-3086 [doi]
• Coded MapReduce Schemes Based on Placement Delivery ArrayVinayak Ramkumar, P. Vijay Kumar. 3087-3091 [doi]
• On Multi-Cell Uplink-Downlink Duality with Treating Inter-Cell Interference as NoiseHamdi Joudeh, Xinping Yi, Bruno Clerckx. 3092-3096 [doi]
• The Symmetric Capacity of the K-Receiver Interleaved Broadcast Channel with Symmetric Side InformationMohamed Salman, Mahesh K. Varanasi. 3097-3101 [doi]
• Towards an Extremal Network Theory - Robust GDoF Gain of Transmitter Cooperation over TINYao-Chia Chan, Syed Ali Jafar. 3102-3106 [doi]
• On the Non-Adaptive Zero-Error Capacity of the Discrete Memoryless Two-Way ChannelYujie Gu, Ofer Shayevitz. 3107-3111 [doi]
• On the Importance of Asymmetry and Monotonicity Constraints in Maximal Correlation AnalysisElad Domanovitz, Uri Erez. 3112-3116 [doi]
• Exact Channel SynthesisLei Yu 0003, Vincent Y. F. Tan. 3117-3121 [doi]
• Mutual Information as a Function of MomentsWael Alghamdi, Flávio P. Calmon. 3122-3126 [doi]
• A Measure of Synergy, Redundancy, and Unique Information using Information GeometryXueyan Niu, Christopher J. Quinn. 3127-3131 [doi]