Table of Contents

• On the Number of Factorizations of Polynomials over Finite FieldsRachel N. Berman, Ron M. Roth. 1-6 [doi]
• Optimal Locally Repairable Constacyclic Codes of Prime Power LengthsWei Zhao, Kenneth W. Shum, Shenghao Yang. 7-12 [doi]
• Grassmannian Frames in Composite Dimensions by Exponentiating Quadratic FormsRenaud-Alexandre Pitaval, Yi Qin. 13-18 [doi]
• Low-Rank Parity-Check Codes over the Ring of Integers Modulo a Prime PowerJulian Renner, Sven Puchinger, Antonia Wachter-Zeh, Camilla Hollanti, Ragnar Freij-Hollanti. 19-24 [doi]
• Mass Error-Correction Codes for Polymer-Based Data StorageRyan Gabrys, Srilakshmi Pattabiraman, Olgica Milenkovic. 25-30 [doi]
• Analog Subspace Coding: A New Approach to Coding for Non-Coherent Wireless NetworksMahdi Soleymani, Hessam Mahdavifar. 31-36 [doi]
• Binary Subblock Energy-Constrained Codes: Knuth's Balancing and Sequence Replacement TechniquesTuan Thanh Nguyen, Kui Cai, Kees A. Schouhamer Immink. 37-41 [doi]
• Decoding Reed-Muller Codes Using Redundant Code ConstraintsMengke Lian, Christian Häger, Henry D. Pfister. 42-47 [doi]
• Constructions of Complex Codebooks Asymptotically Meeting the Welch Bound: A Graph Theoretic ApproachShohei Satake, Yujie Gu. 48-53 [doi]
• Generic Decoding in the Sum-Rank MetricSven Puchinger, Julian Renner, Johan Rosenkilde. 54-59 [doi]
• Support Constrained Generator Matrices of Gabidulin Codes in Characteristic ZeroHikmet Yildiz, Netanel Raviv, Babak Hassibi. 60-65 [doi]
• A Geometric View of the Service Rates of Codes Problem and its Application to the Service Rate of the First Order Reed-Muller CodesFatemeh Kazemi, Sascha Kurz, Emina Soljanin. 66-71 [doi]
• Concave Aspects of Submodular FunctionsRishabh Iyer, Jeff A. Bilmes. 72-77 [doi]
• Zero-Error Coding with a Generator Set of Variable-Length WordsNicolas Charpenay, Maël Le Treust. 78-83 [doi]
• Explicit and Efficient Constructions of Coding Schemes for the Binary Deletion ChannelRoni Con, Amir Shpilka. 84-89 [doi]
• Optimal Multistage Group Testing Algorithm for 3 DefectivesIlya Vorobyev. 90-95 [doi]
• Error Detection and Correction in Communication NetworksChong Shangguan, Itzhak Tamo. 96-101 [doi]
• Improved efficiency for covering codes matching the sphere-covering boundAditya Potukuchi, Yihan Zhang. 102-107 [doi]
• Maximum Length of Robust Positioning SequencesDuc Tu Dao, Han Mao Kiah, Hengjia Wei. 108-113 [doi]
• Distribution of the Minimum Distance of Random Linear CodesJing Hao, Han Huang, Galyna V. Livshyts, Konstantin Tikhomirov. 114-119 [doi]
• The Capacity of Multidimensional Permutations with Restricted MovementDor Elimelech. 120-125 [doi]
• Uncertainty of Reconstructing Multiple Messages from Uniform-Tandem-Duplication NoiseYonatan Yehezkeally, Moshe Schwartz 0001. 126-131 [doi]
• Group Testing with Runlength Constraints for Topological Molecular StorageAbhishek Agarwal, Olgica Milenkovic, Srilakshmi Pattabiraman, João L. Ribeiro 0001. 132-137 [doi]
• Construction of Rate (n - 1 )/n Non-Binary LDPC Convolutional Codes via Difference Triangle SetsGianira Nicoletta Alfarano, Julia Lieb, Joachim Rosenthal. 138-143 [doi]
• Minimizing the alphabet size of erasure codes with restricted decoding setsMira Gonen, Ishay Haviv, Michael Langberg, Alex Sprintson. 144-149 [doi]
• Constructions of Nonequivalent Fp-Additive Generalised Hadamard CodesSteven T. Dougherty, Josep Rifà, Mercè Villanueva. 150-155 [doi]
• Coded Computation Against Straggling Channel Decoders in the Cloud for Gaussian ChannelsJinwen Shi, Cong Ling 0001, Osvaldo Simeone, Jörg Kliewer. 156-161 [doi]
• Low Complexity Distributed Computing via Binary Matrices with Extension to StragglersShailja Agrawal, Prasad Krishnan. 162-167 [doi]
• Heterogeneous Computation Assignments in Coded Elastic ComputingNicholas Woolsey, Rong-Rong Chen, Mingyue Ji. 168-173 [doi]
• Optimizing the Transition Waste in Coded Elastic ComputingHoang Dau, Ryan Gabrys, Yu-Chih Huang, Chen Feng 0001, Quang-Hung Luu, Eidah J. Alzahrani, Zahir Tari. 174-178 [doi]
• Improved Computation-Communication Trade-Off for Coded Distributed Computing using Linear Dependence of Intermediate ValuesShunsuke Horii. 179-184 [doi]
• Coded Computing in Unknown Environment via Online LearningChien-Sheng Yang, Ramtin Pedarsani, Amir Salman Avestimehr. 185-190 [doi]
• Coded QR DecompositionQuang Minh Nguyen, Haewon Jeong, Pulkit Grover. 191-196 [doi]
• Product Lagrange Coded ComputingAdarsh M. Subramaniam, Anoosheh Heidarzadeh, Asit Kumar Pradhan, Krishna R. Narayanan. 197-202 [doi]
• PolyShard: Coded Sharding Achieves Linearly Scaling Efficiency and Security SimultaneouslySongze Li, Mingchao Yu, Chien-Sheng Yang, Amir Salman Avestimehr, Sreeram Kannan, Pramod Viswanath. 203-208 [doi]
• Incremental ADMM with Privacy-Preservation for Decentralized Consensus OptimizationYu Ye, Hao Chen 0048, Ming Xiao, Mikael Skoglund, H. Vincent Poor. 209-214 [doi]
• Multi-Cell Mobile Edge Coded Computing: Trading Communication and Computing for Distributed Matrix MultiplicationKuikui Li, Meixia Tao, Jingjing Zhang, Osvaldo Simeone. 215-220 [doi]
• Local Re-encoding for Coded Matrix MultiplicationXian Su, Xiaomei Zhong, Xiaodi Fan, Jun Li. 221-226 [doi]
• GCSA Codes with Noise Alignment for Secure Coded Multi-Party Batch Matrix MultiplicationZhen Chen, Zhuqing Jia, Zhiying Wang 0001, Syed A. Jafar. 227-232 [doi]
• Straggler-free Coding for Concurrent Matrix MultiplicationsPedro Soto, Jun Li. 233-238 [doi]
• Factored LT and Factored Raptor Codes for Large-Scale Distributed Matrix MultiplicationAsit Kumar Pradhan, Anoosheh Heidarzadeh, Krishna R. Narayanan. 239-244 [doi]
• Entangled Polynomial Codes for Secure, Private, and Batch Distributed Matrix Multiplication: Breaking the "Cubic" BarrierQian Yu, Amir Salman Avestimehr. 245-250 [doi]
• Bivariate Polynomial Coding for Straggler Exploitation with Heterogeneous WorkersBurak Hasircioglu, Jesús Gómez-Vilardebó, Deniz Gündüz. 251-256 [doi]
• Diversity vs. Parallelism in Distributed Computing with RedundancyPei Peng, Emina Soljanin, Philip Whiting. 257-262 [doi]
• Efficient Maximum-Likelihood Decoding of Reed-Muller RM(m-3, m) CodesAndrew Thangaraj, Henry D. Pfister. 263-268 [doi]
• A New Construction of QAM Golay Complementary Sequence PairZilong Wang, Erzhong Xue, Guang Gong. 269-273 [doi]
• Multi-Label and Concatenated Neural Block DecodersCheuk Ting Leung, Mehul Motani, Rajshekhar Vishweshwar Bhat. 274-279 [doi]
• Graceful degradation over the BEC via non-linear codesHajir Roozbehani, Yury Polyanskiy. 280-285 [doi]
• Time-Frequency Division Multiple Access and the TFDMA Ad Hoc Network Based on the (n, n(n-1), n-1) Permutation Group CodesLi Peng. 286-291 [doi]
• An Efficient Algorithm for Designing Optimal CRCs for Tail-Biting Convolutional CodesHengjie Yang, Linfang Wang, Vincent Lau 0002, Richard D. Wesel. 292-297 [doi]
• Low-Complexity Chase Decoding of Reed-Solomon Codes through Basis ReductionJiongyue Xing, Li Chen 0013, Martin Bossert. 298-302 [doi]
• Twisted-Pair Superposition Transmission for Low Latency CommunicationsSuihua Cai, Xiao Ma 0001. 303-308 [doi]
• Tetrahedral Coding and Non-Unitary Resilience in Polarization-Multiplexed Lightwave TransmissionsArnaud Dumenil, Elie Awwad, Cyril Measson. 309-314 [doi]
• Noise RecyclingAlejandro Cohen, Amit Solomon, Ken R. Duffy, Muriel Médard. 315-320 [doi]
• Data-Driven Ensembles for Deep and Hard-Decision Hybrid DecodingTomer Raviv, Nir Raviv, Yair Be'ery. 321-326 [doi]
• Message Flow Analysis in Practical LDPC Decoders for the Interpretation of Absorbing Set ThresholdsMarco Ferrari 0001, Ramon Marenzi, Luca Barletta. 327-332 [doi]
• Iterative Decoding of Non-Binary Cyclic Codes Using Minimum-Weight Dual CodewordsJiongyue Xing, Martin Bossert, Sebastian Bitzer, Li Chen 0013. 333-337 [doi]
• Pruning Neural Belief Propagation DecodersAndreas Buchberger, Christian Häger, Henry D. Pfister, Laurent Schmalen, Alexandre Graell i Amat. 338-342 [doi]
• Equivalence of ML decoding to a continuous optimization problemSundara Rajan Srinivasavaradhan, Suhas N. Diggavi, Christina Fragouli. 343-348 [doi]
• A Low Complexity Decoding Algorithm for NB-LDPC Codes over Quadratic Extension FieldsV. B. Wijekoon, Emanuele Viterbo, Yi Hong 0001. 349-354 [doi]
• Asymptotic Absorbing Set Enumerators for Non-Binary Protograph-Based LDPC Code EnsemblesEmna Ben Yacoub, Gianluigi Liva. 355-360 [doi]
• Finite-Blocklength and Error-Exponent Analyses for LDPC Codes in Point-to-Point and Multiple Access CommunicationYuxin Liu, Michelle Effros. 361-366 [doi]
• Analysis of Absorbing Sets using Cosets and SyndromesEmily McMillon, Allison Beemer, Christine A. Kelley. 367-372 [doi]
• List Decoding for Oblivious Arbitrarily Varying MACs: Constrained and GaussianYihan Zhang. 373-378 [doi]
• Linear-time Erasure List-decoding of Expander CodesNoga Ron-Zewi, Mary Wootters, Gilles Zémor. 379-383 [doi]
• Fast Soft Decision Decoding of Linear Block Codes Using Partial Syndrome SearchChangryoul Choi, Jechang Jeong. 384-388 [doi]
• List Decoding of Universal Polar CodesBoaz Shuval, Ido Tal. 389-394 [doi]
• CRC-Aided Belief Propagation List Decoding of Polar CodesMarvin Geiselhart, Ahmed Elkelesh, Moustafa Ebada, Sebastian Cammerer, Stephan ten Brink. 395-400 [doi]
• Simplified Successive Cancellation Decoding of Polar Codes Has Sublinear LatencyMarco Mondelli, Seyyed Ali Hashemi, John M. Cioffi, Andrea Goldsmith. 401-406 [doi]
• Recursive Trellis Decoding Techniques of Polar CodesPeter Trifonov. 407-412 [doi]
• Improved Belief Propagation List Decoding for Polar CodesBinghao Li, Baoming Bai, Min Zhu 0003, Shenyang Zhou. 413-418 [doi]
• Asynchronous Polar-Coded ModulationJincheng Dai, Kai Niu 0001, Zhongwei Si. 419-424 [doi]
• Finite-Level Quantization Procedures for Construction and Decoding of Polar CodesYunus Inan, Emre Telatar. 425-430 [doi]
• Polar Coding for the Wiretap Broadcast Channel with Multiple MessagesJaume del Olmo Alòs, Javier R. Fonollosa. 431-436 [doi]
• Successive Cancellation Inactivation Decoding for Modified Reed-Muller and eBCH CodesMustafa Cemil Coskun, Joachim Neu, Henry D. Pfister. 437-442 [doi]
• List Decoding of Arıkan's PAC CodesHanwen Yao, Arman Fazeli, Alexander Vardy. 443-448 [doi]
• Capacity-achieving Polar-based LDGM Codes with Crowdsourcing ApplicationsJames Chin-Jen Pang, Hessam Mahdavifar, S. Sandeep Pradhan. 449-454 [doi]
• Hardness of Successive-Cancellation Decoding of Linear CodesArman Fazeli, Alexander Vardy, Hanwen Yao. 455-460 [doi]
• Partially Information Coupled Duo-Binary Turbo CodesXiaowei Wu, Min Qiu 0001, Jinhong Yuan. 461-466 [doi]
• Spatially Coupled Codes with Sub-Block Locality: Joint Finite Length-Asymptotic Design ApproachHoma Esfahanizadeh, Eshed Ram, Yuval Cassuto, Lara Dolecek. 467-472 [doi]
• A Novel Design of Spatially Coupled LDPC Codes for Sliding Window DecodingMin Zhu 0003, David G. M. Mitchell, Michael Lentmaier, Daniel J. Costello Jr.. 473-478 [doi]
• Generalized LDPC Codes with Convolutional Code ConstraintsMuhammad Umar Farooq, Saeedeh Moloudi, Michael Lentmaier. 479-484 [doi]
• Non-Uniform Windowed Decoding For Multi-Dimensional Spatially-Coupled LDPC CodesLev Tauz, Homa Esfahanizadeh, Lara Dolecek. 485-490 [doi]
• Error Rate Analysis for Random Linear Streaming Codes in the Finite Memory Length RegimePin-Wen Su, Yu-Chih Huang, Shih-Chun Lin, I-Hsiang Wang, Chih-Chun Wang. 491-496 [doi]
• Streaming Erasure Codes over Multi-hop Relay NetworkElad Domanovitz, Ashish Khisti, Wai-tian Tan, Xiaoqing Zhu, John G. Apostolopoulos. 497-502 [doi]
• Staggered Diagonal Embedding Based Linear Field Size Streaming CodesVinayak Ramkumar, Myna Vajha, M. Nikhil Krishnan, P. Vijay Kumar. 503-508 [doi]
• Online Versus Offline Rate in Streaming Codes for Variable-Size MessagesMichael Rudow, K. V. Rashmi. 509-514 [doi]
• Tangential-Sphere Bound RevisitedJia Liu, Chaoyong Wang. 515-518 [doi]
• On the decoding of Barnes-Wall latticesVincent Corlay, Joseph J. Boutros, Philippe Ciblat, Loïc Brunel. 519-524 [doi]
• Strongly Explicit and Efficiently Decodable Probabilistic Group TestingHuseyin A. Inan, Ayfer Özgür. 525-530 [doi]
• Reconstruction of Multi-user Binary Subspace ChirpsTefjol Pllaha, Olav Tirkkonen, A. Robert Calderbank. 531-536 [doi]
• ⋆ from Self-Dual CodesMaiara F. Bollauf, Sueli I. R. Costa, Ram Zamir. 537-541 [doi]
• Recovery Sets for Subspaces from a Vector SpaceYeow Meng Chee, Tuvi Etzion, Han Mao Kiah, Hui Zhang 0004. 542-547 [doi]
• Communication Efficient Secret Sharing in the Presence of Malicious AdversaryRawad Bitar, Sidharth Jaggi. 548-553 [doi]
• Minimum Storage Rack-Aware Regenerating Codes with Exact Repair and Small Sub-PacketizationHanxu Hou, Patrick P. C. Lee, Yunghsiang S. Han. 554-559 [doi]
• Toward Optimality in Both Repair and Update via Generic MDS Code TransformationHanxu Hou, Patrick P. C. Lee, Yunghsiang S. Han. 560-565 [doi]
• Access Balancing in Storage Systems by Labeling Partial Steiner SystemsYeow Meng Chee, Charles Joseph Colbourn, Hoang Dau, Ryan Gabrys, Alan Chi Hung Ling, Dylan Lusi, Olgica Milenkovic. 566-570 [doi]
• On Optimal Locally Repairable Codes and Generalized Sector-Disk CodesHan Cai, Moshe Schwartz 0001. 571-576 [doi]
• Access-optimal Linear MDS Convertible Codes for All ParametersFrancisco Maturana, V. S. Chaitanya Mukka, K. V. Rashmi. 577-582 [doi]
• Secure Node Repair of Reed-Solomon CodesTalha Cihad Gulcu. 583-588 [doi]
• Repair of RS codes with optimal access and error correctionZitan Chen, Min Ye 0005, Alexander Barg. 589-594 [doi]
• Complete Characterization of Optimal LRCs with Minimum Distance 6 and Locality 2: Improved Bounds and ConstructionsWeijun Fang, Bin Chen 0011, Shu-Tao Xia, Fang-Wei Fu. 595-599 [doi]
• Perfect LRCs and k-Optimal LRCsWeijun Fang, Bin Chen 0011, Shu-Tao Xia, Fang-Wei Fu. 600-604 [doi]
• Secure Distributed Storage: Rate-Privacy Trade-Off and XOR-Based Coding SchemeRémi A. Chou, Jörg Kliewer. 605-610 [doi]
• Weight Distributions of q-ary Optimal Locally Repairable Codes with Locality 2, Distance 5 and Even DimensionJie Hao, Jun Zhang 0031, Shu-Tao Xia, Fang-Wei Fu, Yi Xian Yang. 611-615 [doi]
• Cyclic LRC codes with hierarchy and availabilityZitan Chen, Alexander Barg. 616-621 [doi]
• Topology-Aware Cooperative Data Protection in Blockchain-Based Decentralized Storage NetworksSiyi Yang, Ahmed H. Hareedy, A. Robert Calderbank, Lara Dolecek. 622-627 [doi]
• Partial MDS Codes with Local RegenerationLukas Holzbaur, Sven Puchinger, Eitan Yaakobi, Antonia Wachter-Zeh. 628-633 [doi]
• Lifted Reed-Solomon Codes with Application to Batch CodesLukas Holzbaur, Rina Polyanskaya, Nikita Polyanskii, Ilya Vorobyev. 634-639 [doi]
• Coded Data Rebalancing: Fundamental Limits and ConstructionsPrasad Krishnan, V. Lalitha 0001, Lakshmi Natarajan 0001. 640-645 [doi]
• A Combinatorial View of the Service Rates of Codes Problem, its Equivalence to Fractional Matching and its Connection with Batch CodesFatemeh Kazemi, Esmaeil Karimi, Emina Soljanin, Alex Sprintson. 646-651 [doi]
• Secure Determinant Codes: Type-II SecurityMichelle Kleckler, Soheil Mohajer. 652-657 [doi]
• Reconstruction of Strings from their Substrings SpectrumSagi Marcovich, Eitan Yaakobi. 658-663 [doi]
• Locally Balanced ConstraintsRyan Gabrys, Han Mao Kiah, Alexander Vardy, Eitan Yaakobi, YiWei Zhang. 664-669 [doi]
• Codes over TreesLev Yohananov, Eitan Yaakobi. 670-675 [doi]
• Coding for Sequence Reconstruction for Single EditsHan Mao Kiah, Tuan Thanh Nguyen, Eitan Yaakobi. 676-681 [doi]
• On Parity-Preserving Variable-Length Constrained CodingRon M. Roth, Paul H. Siegel. 682-687 [doi]
• Q-ary Asymmetric LOCO Codes: Constrained Codes Supporting Flash EvolutionAhmed H. Hareedy, Beyza Dabak, A. Robert Calderbank. 688-693 [doi]
• Constrained Coding with Error Control for DNA-Based Data StorageTuan Thanh Nguyen, Kui Cai, Kees A. Schouhamer Immink, Han Mao Kiah. 694-699 [doi]
• Polar Codes with Balanced CodewordsUtkarsh Gupta, Han Mao Kiah, Alexander Vardy, Hanwen Yao. 700-705 [doi]
• Maximum Likelihood Decoding for Channels with Uniform Noise and Signal Dependent OffsetRenfei Bu, Jos H. Weber, Kees A. Schouhamer Immink. 706-710 [doi]
• Coding for Optimized Writing Rate in DNA StorageSiddharth Jain, Farzad Farnoud, Moshe Schwartz 0001, Jehoshua Bruck. 711-716 [doi]
• Robust Indexing - Optimal Codes for DNA StorageJin Sima, Netanel Raviv, Jehoshua Bruck. 717-722 [doi]
• Covering Codes for Insertions and DeletionsAndreas Lenz, Cyrus Rashtchian, Paul H. Siegel, Eitan Yaakobi. 723-728 [doi]
• Weight Enumerators for Number-Theoretic Codes and Cardinalities of Tenengolts' Non-binary CodesTakayuki Nozaki. 729-733 [doi]
• Error-correcting Codes for Short Tandem Duplication and Substitution ErrorsYuanyuan Tang, Farzad Farnoud. 734-739 [doi]
• Optimal Codes for the q-ary Deletion ChannelJin Sima, Ryan Gabrys, Jehoshua Bruck. 740-745 [doi]
• Codes Correcting Synchronization Errors for Symbol-Pair Read ChannelsYeow Meng Chee, Van Khu Vu. 746-750 [doi]
• Syndrome Compression for Optimal Redundancy CodesJin Sima, Ryan Gabrys, Jehoshua Bruck. 751-756 [doi]
• Optimal Codes Correcting a Burst of Deletions of Variable LengthAndreas Lenz, Nikita Polyanskii. 757-762 [doi]
• The Error Probability of Maximum-Likelihood Decoding over Two Deletion/Insertion ChannelsOmer Sabary, Eitan Yaakobi, Alexander Yucovich. 763-768 [doi]
• Optimal Systematic t-Deletion Correcting CodesJin Sima, Ryan Gabrys, Jehoshua Bruck. 769-774 [doi]
• Single-Deletion Single-Substitution Correcting CodesIlia Smagloy, Lorenz Welter, Antonia Wachter-Zeh, Eitan Yaakobi. 775-780 [doi]
• Symbolwise MAP Estimation for Multiple-Trace Insertion/Deletion/Substitution ChannelsRyo Sakogawa, Haruhiko Kaneko. 781-785 [doi]
• Thermodynamically Stable DNA Code Design using a Similarity Significance ModelYixin Wang, Md. Noor-A.-Rahim, Erry Gunawan, Yong Liang Guan 0001, Chueh-Loo Poh. 786-791 [doi]
• Optimizing the Write Fidelity of MRAMsYongjune Kim 0001, Yoocharn Jeon, Cyril Guyot, Yuval Cassuto. 792-797 [doi]
• Fundamental Limits of Distributed EncodingNastaran Abadi Khooshemehr, Mohammad Ali Maddah-Ali. 798-803 [doi]
• Noisy In-Memory Recursive Computation with Memristor CrossbarsElsa Dupraz, Lav R. Varshney. 804-809 [doi]
• Mobility-Assisted Covert Communication over Wireless Ad Hoc NetworksHyeon-Seong Im, Si-Hyeon Lee. 810-815 [doi]
• Treating Interference as Noise is Optimal for Covert Communication over Interference ChannelsKang-Hee Cho, Si-Hyeon Lee. 816-821 [doi]
• Stealth Communication with Vanishing Power over Binary Symmetric ChannelsDiego Lentner, Gerhard Kramer. 822-827 [doi]
• Covert MIMO Communications under Variational Distance ConstraintShi-Yuan Wang, Matthieu R. Bloch. 828-833 [doi]
• Keyless Covert Communication in the Presence of Channel State InformationHassan ZivariFard, Matthieu R. Bloch, Aria Nosratinia. 834-839 [doi]
• Active Covert SensingMehrdad Tahmasbi, Matthieu R. Bloch. 840-845 [doi]
• Rank Preserving Code-based SignatureTerry Shue Chien Lau, Chik-How Tan. 846-851 [doi]
• An Ideal Secret Sharing Scheme Realizing an Access Structure Based on a Finite Projective Plane of Order 3Yohei Okawa, Hiroki Koga. 852-857 [doi]
• An Information-Theoretic Proof of the Streaming Switching Lemma for Symmetric EncryptionIdo Shahaf, Or Ordentlich, Gil Segev 0001. 858-863 [doi]
• Secret sharing schemes based on Nonlinear codesDeepak Agrawal, Smarajit Das, Srinivasan Krishanaswamy. 864-867 [doi]
• Aggregate Message Authentication Codes with Detecting Functionality from Biorthogonal CodesYoshinori Ogawa, Shingo Sato, Junji Shikata, Hideki Imai. 868-873 [doi]
• Biometric and Physical Identifiers with Correlated Noise for Controllable Private AuthenticationOnur Günlü, Rafael F. Schaefer, H. Vincent Poor. 874-878 [doi]
• On Secrecy Key of a class of Secure Asymmetric Multilevel Diversity Coding SystemCongduan Li, Jingliang He, Shiqiu Liu, Dongliang Guo, Linqi Song. 879-883 [doi]
• Sequence Obfuscation to Thwart Pattern Matching AttacksBo Guan, Nazanin Takbiri, Dennis L. Goeckel, Amir Houmansadr, Hossein Pishro-Nik. 884-889 [doi]
• Distribution Privacy Under Function RecoverabilityAjaykrishnan Nageswaran, Prakash Narayan. 890-895 [doi]
• Privacy Amplification of Iterative Algorithms via Contraction CoefficientsShahab Asoodeh, Mario Diaz, Flávio P. Calmon. 896-901 [doi]
• Mechanisms for Hiding Sensitive Genotypes with Information-Theoretic PrivacyFangwei Ye, Hyunghoon Cho, Salim El Rouayheb. 902-907 [doi]
• Linear and Range Counting under Metric-based Local Differential PrivacyZhuolun Xiang, Bolin Ding, Xi He 0001, Jingren Zhou. 908-913 [doi]
• Hiding Identities: Estimation Under Local Differential PrivacyAntonious M. Girgis, Deepesh Data, Suhas N. Diggavi. 914-919 [doi]
• A Better Bound Gives a Hundred Rounds: Enhanced Privacy Guarantees via f-DivergencesShahab Asoodeh, Jiachun Liao, Flávio P. Calmon, Oliver Kosut, Lalitha Sankar. 920-925 [doi]
• Privacy-Utility Tradeoff in a Guessing Framework Inspired by Index CodingYucheng Liu, Ni Ding, Parastoo Sadeghi, Thierry Rakotoarivelo. 926-931 [doi]
• Remote Joint Strong Coordination and Reliable CommunicationGiulia Cervia, Tobias J. Oechtering, Mikael Skoglund. 932-937 [doi]
• Arbitrarily Varying Wiretap Channels with Non-Causal Side Information at the JammerCarsten Rudolf Janda, Eduard A. Jorswieck, Moritz Wiese, Holger Boche. 938-943 [doi]
• Conditional Disclosure of Secrets: A Noise and Signal Alignment ApproachZhou Li, Hua Sun. 944-948 [doi]
• An Achievable Region for the Multiple Access Wiretap Channels with Confidential and Open MessagesHao Xu 0003, Giuseppe Caire, Cunhua Pan. 949-954 [doi]
• On the Discussion Rate Region for the PIN ModelQiaoqiao Zhou, Chung Chan, Raymond W. Yeung. 955-959 [doi]
• Delay-Optimal Coding for Secure Transmission over Parallel Burst Erasure Channels with an EavesdropperAnna Frank. 960-965 [doi]
• Secure Information Exchange for OmniscienceChung Chan, Navin Kashyap, Praneeth Kumar Vippathalla, Qiaoqiao Zhou. 966-971 [doi]
• Secure Computation to Hide Functions of InputsGowtham R. Kurri, Vinod M. Prabhakaran. 972-977 [doi]
• Network Information Theoretic SecurityHongchao Zhou, Abbas El Gamal. 978-983 [doi]
• Authentication with Mildly Myopic AdversariesAllison Beemer, Eric Graves 0001, Jörg Kliewer, Oliver Kosut, Paul L. Yu. 984-989 [doi]
• Resolvability of the Multiple Access Channel with Two-Sided CooperationNoha Helal, Matthieu R. Bloch, Aria Nosratinia. 990-994 [doi]
• A compression perspective on secrecy measuresYanina Y. Shkel, H. Vincent Poor. 995-1000 [doi]
• Private Two-Terminal Hypothesis TestingVarun Narayanan, Manoj Mishra, Vinod M. Prabhakaran. 1001-1006 [doi]
• Capacity Region of the Gaussian Arbitrarily-Varying Broadcast ChannelFatemeh Hosseinigoki, Oliver Kosut. 1007-1011 [doi]
• On the Storage Cost of Private Information RetrievalChao Tian. 1012-1017 [doi]
• On the Information Leakage in Private Information Retrieval SystemsTao Guo, Ruida Zhou, Chao Tian. 1018-1023 [doi]
• Array Codes for Functional PIR and Batch CodesMohammad Nassar, Eitan Yaakobi. 1024-1029 [doi]
• The Minimum Upload Cost of Symmetric Private Information RetrievalYanliang Zhou, Qiwen Wang, Hua Sun 0001, Shengli Fu. 1030-1034 [doi]
• Private Set Intersection Using Multi-Message Symmetric Private Information RetrievalZhusheng Wang, Karim Banawan, Sennur Ulukus. 1035-1040 [doi]
• The Capacity of Private Information Retrieval Under Arbitrary Collusion PatternsXinyu Yao, Nan Liu 0001, Wei Kang 0002. 1041-1046 [doi]
• Private Information Retrieval Over Gaussian MACOri Shmuel, Asaf Cohen 0001. 1047-1052 [doi]
• The Capacity of Single-Server Weakly-Private Information RetrievalHsuan-Yin Lin, Siddhartha Kumar, Eirik Rosnes, Alexandre Graell i Amat, Eitan Yaakobi. 1053-1058 [doi]
• Quantum Private Information Retrieval from MDS-coded and Colluding ServersMatteo Allaix, Lukas Holzbaur, Tefjol Pllaha, Camilla Hollanti. 1059-1064 [doi]
• Computational Code-Based Single-Server Private Information RetrievalLukas Holzbaur, Camilla Hollanti, Antonia Wachter-Zeh. 1065-1070 [doi]
• Latent-variable Private Information RetrievalIslam Samy, Mohamed Adel Attia, Ravi Tandon, Loukas Lazos. 1071-1076 [doi]
• Capacity of Quantum Private Information Retrieval with Colluding ServersSeunghoan Song, Masahito Hayashi. 1077-1082 [doi]
• Single-server Multi-message Private Information Retrieval with Side Information: the General CasesSu Li. 1083-1088 [doi]
• Weakly Private Information Retrieval Under the Maximal Leakage MetricRuida Zhou, Tao Guo, Chao Tian. 1089-1094 [doi]
• Cache-aided Multiuser Private Information RetrievalXiang Zhang, Kai Wan, Hua Sun, Mingyue Ji. 1095-1100 [doi]
• Secret Key Generation From Vector Gaussian Sources With Public and Private CommunicationsYinfei Xu, Daming Cao. 1101-1105 [doi]
• A Two-way QKD Protocol Outperforming One-way Protocols at Low QBERJari Lietzén, Roope Vehkalahti, Olav Tirkkonen. 1106-1111 [doi]
• Private Computation with Individual and Joint PrivacyAnoosheh Heidarzadeh, Alex Sprintson. 1112-1117 [doi]
• Private Function ComputationBehrooz Tahmasebi, Mohammad Ali Maddah-Ali. 1118-1123 [doi]
• Uplink Cost Adjustable Schemes in Secure Distributed Matrix MultiplicationJaber Kakar, Anton Khristoforov, Seyedhamed Ebadifar, Aydin Sezgin. 1124-1129 [doi]
• Optimal Two-Stage Bayesian Sequential Change DiagnosisXiaochuan Ma, Lifeng Lai, Shuguang Cui. 1130-1135 [doi]
• Second-Order Asymptotically Optimal Change-point Detection Algorithm with Sampling ControlQunzhi Xu, Yajun Mei, George V. Moustakides. 1136-1140 [doi]
• Sequential Detection and Isolation of a Correlated PairAnamitra Chaudhuri, Georgios Fellouris. 1141-1146 [doi]
• Multislot and Multistream Quickest Change Detection in Statistically Periodic ProcessesTaposh Banerjee, Prudhvi Gurram, Gene T. Whipps. 1147-1152 [doi]
• A Game-Theoretic Approach to Sequential Detection in Adversarial EnvironmentsRuizhi Zhang 0001, Shaofeng Zou. 1153-1158 [doi]
• Asymptotics of Quickest Change Detection with an Energy Harvesting SensorSubhrakanti Dey. 1159-1164 [doi]
• Sequential anomaly detection with observation control under a generalized error metricAristomenis Tsopelakos, Georgios Fellouris. 1165-1170 [doi]
• Quickest Detection of a Dynamic Anomaly in a Heterogeneous Sensor NetworkGeorgios Rovatsos, Venugopal V. Veeravalli, George V. Moustakides. 1171-1176 [doi]
• Sparse Activity Detection in Cell-Free Massive MIMO systemsMangqing Guo, Mustafa Cenk Gursoy, Pramod K. Varshney. 1177-1182 [doi]
• A General Derivative Identity for the Conditional Mean Estimator in Gaussian Noise and Some ApplicationsAlex Dytso, H. Vincent Poor, Shlomo Shamai Shitz. 1183-1188 [doi]
• On the Sample Complexity of Estimating Small Singular ModesXiangxiang Xu 0001, Weida Wang, Shao-Lun Huang. 1189-1194 [doi]
• On the Randomized Babai PointXiao-Wen Chang, Zhilong Chen, Yingzi Xu. 1195-1200 [doi]
• When does the Tukey Median work?Banghua Zhu, Jiantao Jiao, Jacob Steinhardt. 1201-1206 [doi]
• Missing Mass of Markov ChainsPrafulla Chandra, Andrew Thangaraj, Nived Rajaraman. 1207-1212 [doi]
• Linear Models are Most Favorable among Generalized Linear ModelsKuan-Yun Lee, Thomas A. Courtade. 1213-1218 [doi]
• Weak-Noise Modulation-Estimation of Vector ParametersNeri Merhav. 1219-1223 [doi]
• "Wireless Paint": Code Design for 3D Orientation Estimation with Backscatter ArraysKenneth Chang, Nathaniel Raymondi, Ashutosh Sabharwal, Suhas N. Diggavi. 1224-1229 [doi]
• Achievability of nearly-exact alignment for correlated Gaussian databasesOsman Emre Dai, Daniel Cullina, Negar Kiyavash. 1230-1235 [doi]
• Pattern-Based Analysis of Time Series: EstimationElyas Sabeti, Peter X. K. Song, Alfred Olivier Hero. 1236-1241 [doi]
• Minimax Lower Bounds for Circular Source LocalizationAolin Xu, Todd Coleman. 1242-1247 [doi]
• Evasive Active Hypothesis TestingMeng-Che Chang, Matthieu R. Bloch. 1248-1253 [doi]
• Sequential Hypothesis Criterion Based Optimal Caching Schemes Over Mobile Wireless NetworksXi Zhang, Qixuan ZW, H. Vincent Poor. 1254-1258 [doi]
• Binary Hypothesis Testing with Deterministic Finite-Memory Decision RulesTomer Berg, Or Ordentlich, Ofer Shayevitz. 1259-1264 [doi]
• Social Learning with Beliefs in a Parallel NetworkDaewon Seo, Ravi Kiran Raman, Lav R. Varshney. 1265-1270 [doi]
• Two-Sample Testing on Pairwise Comparison Data and the Role of Modeling AssumptionsCharvi Rastogi, Sivaraman Balakrishnan, Nihar B. Shah, Aarti Singh. 1271-1276 [doi]
• Testing for Anomalies: Active Strategies and Non-asymptotic AnalysisDhruva Kartik, Ashutosh Nayyar, Urbashi Mitra. 1277-1282 [doi]
• Strong Converse for Testing Against Independence over a Noisy channelSreejith Sreekumar, Deniz Gündüz. 1283-1288 [doi]
• Hypothesis Testing Against Independence Under Gaussian NoiseAbdellatif Zaidi. 1289-1294 [doi]
• Second-Order Asymptotics of Sequential Hypothesis TestingYonglong Li, Vincent Y. F. Tan. 1295-1300 [doi]
• Data-Driven Representations for Testing Independence: A Connection with Mutual Information EstimationMauricio E. Gonzalez, Jorge F. Silva. 1301-1306 [doi]
• Recovering Structure of Noisy Data through Hypothesis TestingMinoh Jeong, Alex Dytso, Martina Cardone, H. Vincent Poor. 1307-1312 [doi]
• On the Error Exponent of Approximate Sufficient Statistics for M-ary Hypothesis TestingJiachun Pan, Yonglong Li, Vincent Y. F. Tan, Yonina C. Eldar. 1313-1318 [doi]
• Approximate Recovery Of Ising Models with Side InformationSaurabh Sihag, Ali Tajer. 1319-1324 [doi]
• Minimax Prediction in Tree Ising ModelsGuy Bresler, Mina Karzand. 1325-1330 [doi]
• Characterizing the Bethe Partition Function of Double-Edge Factor Graphs via Graph CoversYuwen Huang, Pascal O. Vontobel. 1331-1336 [doi]
• Online Variational Message Passing in Hierarchical Autoregressive ModelsAlbert Podusenko, Wouter M. Kouw, Bert de Vries. 1337-1342 [doi]
• k-Connectivity in Random Graphs induced by Pairwise Key Predistribution SchemesMansi Sood, Osman Yagan. 1343-1348 [doi]
• Temporal Ordered Clustering in Dynamic NetworksKrzysztof Turowski, Jithin K. Sreedharan, Wojciech Szpankowski. 1349-1354 [doi]
• Community Detection with Secondary Latent VariablesMohammad Esmaeili, Aria Nosratinia. 1355-1360 [doi]
• Comparison of Information Structures for Zero-Sum Games in Standard Borel SpacesIan Hogeboom-Burr, Serdar Yüksel. 1361-1366 [doi]
• Quadratic Privacy-Signaling Games and Payoff Dominant EquilibriaErtan Kazikli, Sinan Gezici, Serdar Yüksel. 1367-1372 [doi]
• Observational Learning with Fake AgentsPawan Poojary, Randall Berry. 1373-1378 [doi]
• Achievable Rates for Strategic CommunicationAnuj S. Vora, Ankur A. Kulkarni. 1379-1384 [doi]
• Optimal Restricted Isometry Condition for Exact Sparse Recovery with Orthogonal Least SquaresJunhan Kim, Byonghyo Shim. 1385-1390 [doi]
• Some Performance Guarantees of Global LASSO with Local Assumptions for Convolutional Sparse Design MatricesAvishek Ghosh, Kannan Ramchandran. 1391-1396 [doi]
• Quantized Corrupted Sensing with Random DitheringZhongxing Sun, Wei Cui 0001, Yulong Liu. 1397-1402 [doi]
• Macroscopic Analysis of Vector Approximate Message Passing in a Model Mismatch SettingTakashi Takahashi, Yoshiyuki Kabashima. 1403-1408 [doi]
• A Novel B-MAP Proxy for Greedy Sparse Signal Recovery AlgorithmsJeongMin Chae, Song-Nam Hong. 1409-1413 [doi]
• Improved non-adaptive algorithms for threshold group testing with a gapThach V. Bui, Mahdi Cheraghchi, Isao Echizen. 1414-1419 [doi]
• Near-Optimal Sparse Adaptive Group TestingNelvin Tan, Jonathan Scarlett. 1420-1425 [doi]
• Fast Compressive Large-Scale Matrix-Matrix Multiplication Using Product CodesOrhan Ocal, Kannan Ramchandran. 1426-1431 [doi]
• Modulated Sparse Regression CodesKuan Hsieh, Ramji Venkataramanan. 1432-1437 [doi]
• On the Sample Complexity and Optimization Landscape for Quadratic Feasibility ProblemsParth K. Thaker, Gautam Dasarathy, Angelia Nedic. 1438-1443 [doi]
• Structured Quasi-Gray labelling for Reed-Muller Grassmannian ConstellationsYi Qin, Renaud-Alexandre Pitaval. 1444-1449 [doi]
• Structure of Optimal Quantizer for Binary-Input Continuous-Output Channels with Output ConstraintsThuan Nguyen, Thinh Nguyen. 1450-1455 [doi]
• DoF Analysis for Multipath-Assisted Imaging: Single Frequency IlluminationNishant Mehrotra, Ashutosh Sabharwal. 1456-1461 [doi]
• Some results on convolution idempotentsP. Charantej Reddy, Aditya Siripuram, Brad Osgood. 1462-1467 [doi]
• DoF Region of the Decentralized MIMO Broadcast Channel - How many informed antennas do we need?Antonio Bazco Nogueras, Arash Gholami Davoodi, Paul de Kerret, David Gesbert, Nicolas Gresset, Syed Ali Jafar. 1468-1473 [doi]
• The Fading Gaussian Broadcast Channel with Channel State Information and Output FeedbackSiyao Li, Daniela Tuninetti, Natasha Devroye. 1474-1479 [doi]
• When does Partial Noisy Feedback Enlarge the Capacity of a Gaussian Broadcast Channel?Aditya Narayan Ravi, Sibi Raj B. Pillai, Vinod M. Prabhakaran, Michèle A. Wigger. 1480-1485 [doi]
• On the Capacity Region of the Three-Receiver Broadcast Channel With Receiver Message CognitionMohamed Salman, Mahesh K. Varanasi. 1486-1491 [doi]
• New Outer Bounds for the Two-Receiver Broadcast ChannelAmin Gohari, Chandra Nair. 1492-1497 [doi]
• Diamond Message Set Groupcasting: From an Achievable Rate Region for the DM Broadcast Channel to the Capacity of the Combination NetworkMohamed Salman, Mahesh K. Varanasi. 1498-1503 [doi]
• Broadcasting on trees near criticalityYuzhou Gu, Hajir Roozbehani, Yury Polyanskiy. 1504-1509 [doi]
• On the Broadcast Channel with Non-Distinct Message Demands and Symmetric Side InformationMohamed Salman, Mahesh K. Varanasi. 1510-1515 [doi]
• Multi-layer Interference Alignment and GDoF of the K-User Asymmetric Interference ChannelJinyuan Chen. 1516-1521 [doi]
• On the structure of certain non-convex functionals and the Gaussian Z-interference channelMax H. M. Costa, Chandra Nair, David Ng, Yan Nan Wang. 1522-1527 [doi]
• Interference Management without CSIT: A Broadcast ApproachMaha Zohdy, Ali Tajer, Shlomo Shamai Shitz. 1528-1533 [doi]
• Embedding Information in Radiation Pattern FluctuationsMilad Johnny, Alireza Vahid. 1534-1539 [doi]
• On the AND-OR Interference Channel and the Sandglass ConjectureChandra Nair, Mehdi Yazdanpanah. 1540-1545 [doi]
• On Discrete Signaling and Treating Interference as Noise for Complex Gaussian Interference ChannelsMin Qiu 0001, Yu-Chih Huang, Jinhong Yuan. 1546-1551 [doi]
• Secure Communications with Limited Common Randomness at TransmittersFan Li 0012, Jinyuan Chen. 1552-1557 [doi]
• Secure GDoF of the Z-channel with Finite Precision CSIT: How Robust are Structured Codes?Yao-Chia Chan, Syed Ali Jafar. 1558-1563 [doi]
• Strong Coordination with Side InformationViswanathan Ramachandran, Sibi Raj B. Pillai, Vinod M. Prabhakaran. 1564-1569 [doi]
• Source Coding for Synthesizing Correlated RandomnessTouheed Anwar Atif, Arun Padakandla, S. Sandeep Pradhan. 1570-1575 [doi]
• Explicit Construction of Multiple Access Channel Resolvability Codes from Source Resolvability CodesRumia Sultana, Rémi A. Chou. 1576-1580 [doi]
• A Functional Construction of Codes for Multiple Access and Broadcast ChannelsShouvik Ganguly, Lele Wang 0001, Young-Han Kim 0001. 1581-1586 [doi]
• Quadratically Constrained Two-way Adversarial ChannelsYihan Zhang, Shashank Vatedka, Sidharth Jaggi. 1587-1592 [doi]
• On the Fraction of Capacity One Relay can Achieve in Gaussian Half-Duplex Diamond NetworksSarthak Jain, Soheil Mohajer, Martina Cardone. 1593-1598 [doi]
• Gaussian 1-2-1 Networks with Imperfect BeamformingYahya H. Ezzeldin, Martina Cardone, Christina Fragouli, Giuseppe Caire. 1599-1604 [doi]
• Multi-Cast Channels with Hierarchical FlowJonathan Ponniah, Liang-Liang Xie. 1605-1610 [doi]
• Queue-Aware Beam Scheduling for Half-Duplex mmWave Relay NetworksXiaoshen Song, Giuseppe Caire. 1611-1616 [doi]
• The Langberg-Médard Multiple Unicast Conjecture: Stable 3-Pair NetworksKai Cai, Guangyue Han. 1617-1622 [doi]
• On the Partition Bound for Undirected Unicast Network Information CapacityMohammad Ishtiyaq Qureshi, Satyajit Thakor. 1623-1628 [doi]
• Upper Bound Scalability on Achievable Rates of Batched Codes for Line NetworksShenghao Yang, Jie Wang. 1629-1634 [doi]
• Linear Network Error Correction Coding RevisitedXuan Guang, Raymond W. Yeung. 1635-1640 [doi]
• Network Coding Based on Byte-wise Circular Shift and Integer Addition W. Shum, Hanxu Hou. 1641-1645 [doi]
• On the Gap between Scalar and Vector Solutions of Generalized Combination NetworksHedongliang Liu, Hengjia Wei, Sven Puchinger, Antonia Wachter-Zeh, Moshe Schwartz 0001. 1646-1651 [doi]
• On the Memory Requirements of Block Interleaver for Batched Network CodesHoover H. F. Yin, Ka Hei Ng, Xishi Wang, Qi Cao, Lucien K. L. Ng. 1652-1657 [doi]
• Discrete Water Filling Multi-Path Packet SchedulingArno Schneuwly, Derya Malak, Muriel Médard. 1658-1663 [doi]
• On the Optimality of Two Decentralized Coded Caching Schemes With and Without Error CorrectionNujoom Sageer Karat, Kodi Lakshmi Vijith Bhargav, B. Sundar Rajan. 1664-1669 [doi]
• An Optimal Linear Error Correcting Scheme for Shared Caching with Small Cache SizesSonu Rathi, Anoop Thomas, Monolina Dutta. 1670-1674 [doi]
• Extending the Optimality Range of Multi-Antenna Coded Caching with Shared CachesEmanuele Parrinello, Petros Elia, Eleftherios Lampiris. 1675-1680 [doi]
• Eliminating Pairing Loss for Coded Caching with Three Erasure-Coded ServersAniruddha Phatak, Mahesh K. Varanasi. 1681-1686 [doi]
• An Upper Bound on the Capacity-Memory Tradeoff of Interleavable Discrete Memoryless Broadcast Channels with Uncoded PrefetchingMohamed Salman, Mahesh K. Varanasi. 1687-1692 [doi]
• Fundamental Limits of Wireless Caching Under Mixed Cacheable and Uncacheable TrafficHamdi Joudeh, Eleftherios Lampiris, Petros Elia, Giuseppe Caire. 1693-1698 [doi]
• A New Design Framework on D2D Coded Caching with Optimal Rate and Less SubpacketizationsXiang Zhang, Xianfeng Terry Yang, Mingyue Ji. 1699-1704 [doi]
• Novel Converse for Device-to-Device Demand-Private Caching with a Trusted ServerKai Wan, Hua Sun, Mingyue Ji, Daniela Tuninetti, Giuseppe Caire. 1705-1710 [doi]
• Successive Refinement to Caching for Dynamic RequestsPinar Sen, Michael Gastpar, Young-Han Kim 0001. 1711-1716 [doi]
• Cache-Aided Scalar Linear Function RetrievalKai Wan, Hua Sun, Mingyue Ji, Daniela Tuninetti, Giuseppe Caire. 1717-1722 [doi]
• Min-rank of Embedded Index Coding ProblemsAnjana Ambika Mahesh, Nujoom Sageer Karat, B. Sundar Rajan. 1723-1728 [doi]
• Secure Decentralized Pliable Index CodingTang Liu 0002, Daniela Tuninetti. 1729-1734 [doi]
• Secure Network and Index Coding Equivalence: The Last Piece of the PuzzleLawrence Ong, Badri N. Vellambi. 1735-1740 [doi]
• Fundamental Limits of Age-of-Information in Stationary and Non-stationary EnvironmentsSubhankar Banerjee, Rajarshi Bhattacharjee, Abhishek Sinha. 1741-1746 [doi]
• Asymptotically Optimal Scheduling Policy For Minimizing The Age of InformationAli Maatouk, Saad Kriouile, Mohamad Assaad, Anthony Ephremides. 1747-1752 [doi]
• Minimizing Age of Information via Hybrid NOMA/OMAQian Wang, He Chen, Yonghui Li 0001, Branka Vucetic. 1753-1758 [doi]
• Age of Information in Uncoordinated Unslotted UpdatingRoy D. Yates, Sanjit K. Kaul. 1759-1764 [doi]
• Average Age of Information for a Multi-Source M/M/1 Queueing Model With Packet ManagementMohammad Moltafet, Markus Leinonen, Marian Codreanu. 1765-1769 [doi]
• Age of Information in Random Access ChannelsXingran Chen, Konstantinos Gatsis, Hamed Hassani, Shirin Saeedi Bidokhti. 1770-1775 [doi]
• AoI Minimization in Broadcast Channels with Channel State InformationSongtao Feng, Jing Yang 0002. 1776-1781 [doi]
• Age-of-Information Revisited: Two-way Delay and Distribution-oblivious Online AlgorithmCho-Hsin Tsai, Chih-Chun Wang. 1782-1787 [doi]
• Timely Status Updating Through Intermittent Sensing and TransmissionOmur Ozel. 1788-1793 [doi]
• Optimal Selective Encoding for Timely Updates with Empty SymbolBaturalp Buyukates, Melih Bastopcu, Sennur Ulukus. 1794-1799 [doi]
• Partial Updates: Losing Information for FreshnessMelih Bastopcu, Sennur Ulukus. 1800-1805 [doi]
• Data Freshness in Leader-Based Replicated StorageAmir Behrouzi-Far, Emina Soljanin, Roy D. Yates. 1806-1811 [doi]
• Timely Estimation Using Coded Quantized SamplesAhmed Arafa, Karim Banawan, Karim G. Seddik, H. Vincent Poor. 1812-1817 [doi]
• Communication over Quantum Channels with Parameter EstimationUzi Pereg. 1818-1823 [doi]
• Quantum Advantage via Qubit Belief PropagationNarayanan Rengaswamy, Kaushik P. Seshadreesan, Saikat Guha, Henry D. Pfister. 1824-1829 [doi]
• Performance of Gaussian encodings for classical communication on correlated quantum phase-noise channelsMarco Fanizza, Matteo Rosati, Michalis Skotiniotis, John Calsamiglia, Vittorio Giovannetti. 1830-1834 [doi]
• Infinite-fold enhancement in communications capacity using pre-shared entanglementSaikat Guha, Quntao Zhuang, Boulat A. Bash. 1835-1839 [doi]
• Permutation Enhances Classical Communication Assisted by Entangled StatesKun Wang, Masahito Hayashi. 1840-1845 [doi]
• Second-order asymptotics of quantum data compression from partially-smoothed conditional entropyDina Abdelhadi, Joseph M. Renes. 1846-1851 [doi]
• General Mixed State Quantum Data Compression with and without Entanglement AssistanceZahra Baghali Khanian, Andreas J. Winter 0002. 1852-1857 [doi]
• Quantum State Redistribution for Ensemble SourcesZahra Baghali Khanian, Andreas J. Winter 0002. 1858-1863 [doi]
• One-Shot Trade-Off Bounds for State Redistribution of Classical-Quantum SourcesEyuri Wakakuwa, Yoshifumi Nakata, Min-Hsiu Hsieh. 1864-1869 [doi]
• A Four-Qubits Code that is a Quantum Deletion Error-Correcting Code with the Optimal LengthManabu Hagiwara, Ayumu Nakayama. 1870-1874 [doi]
• Linear programming bounds for quantum amplitude damping codesYingkai Ouyang, Ching-Yi Lai. 1875-1879 [doi]
• Fidelity of Finite Length Quantum Codes in Qubit Erasure ChannelAlexei Ashikhmin. 1880-1885 [doi]
• Trimming Decoding of Color Codes over the Quantum Erasure ChannelSangjun Lee, Mehdi Mhalla, Valentin Savin. 1886-1890 [doi]
• Classical Coding Problem from Transversal T GatesNarayanan Rengaswamy, A. Robert Calderbank, Michael Newman, Henry D. Pfister. 1891-1896 [doi]
• Reinforcement Learning with Neural Networks for Quantum Multiple Hypothesis TestingSarah Brandsen, Kevin D. Stubbs, Henry D. Pfister. 1897-1902 [doi]
• Entropy of a Quantum Channel: Definition, Properties, and ApplicationGilad Gour, Mark M. Wilde. 1903-1908 [doi]
• Quantum Blahut-Arimoto AlgorithmsNavneeth Ramakrishnan, Raban Iten, Volkher B. Scholz, Mario Berta. 1909-1914 [doi]
• Coherent Quantum Channel DiscriminationMark M. Wilde. 1915-1920 [doi]
• On the Advantage of Irreversible Processes in Single-System GamesXavier Coiteux-Roy, Stefan Wolf. 1921-1926 [doi]
• 2D Local Hamiltonian with Area Laws Is QMA-CompleteYichen Huang. 1927-1932 [doi]
• Adaptive Procedures for Discriminating Between Arbitrary Tensor-Product Quantum StatesSarah Brandsen, Mengke Lian, Kevin D. Stubbs, Narayanan Rengaswamy, Henry D. Pfister. 1933-1938 [doi]
• Quantification of Unextendible Entanglement and Its Applications in Entanglement DistillationKun Wang, Xin Wang, Mark M. Wilde. 1939-1943 [doi]
• Finite Key Analysis of the Extended B92 ProtocolOmar Amer, Walter O. Krawec. 1944-1948 [doi]
• Multi-User Distillation of Common Randomness and Entanglement from Quantum StatesFarzin Salek, Andreas Winter. 1949-1954 [doi]
• Entanglement-Assisted Data Transmission as an Enabling Technology: A Link-Layer PerspectiveJanis Nötzel, Stephen Diadamo. 1955-1960 [doi]
• Universal superposition codes: capacity regions of compound quantum broadcast channel with confidential messagesHolger Boche, Gisbert Janßen, Sajad Saeedinaeeni. 1961-1966 [doi]
• Strong Converse Bounds in Quantum Network Information TheoryHao-Chung Cheng, Nilanjana Datta, Cambyse Rouzé. 1967-1972 [doi]
• Classical Mechanism is Optimal in Classical-Quantum Differentially Private MechanismsYuuya Yoshida, Masahito Hayashi. 1973-1977 [doi]
• A New High-Dimensional Quantum Entropic Uncertainty Relation with ApplicationsWalter O. Krawec. 1978-1983 [doi]
• Guesswork with Quantum Side Information: Optimal Strategies and Aspects of SecurityEric P. Hanson, Vishal Katariya, Nilanjana Datta, Mark M. Wilde. 1984-1989 [doi]
• Semantic Security for Quantum Wiretap ChannelsHolger Boche, Minglai Cai, Moritz Wiese, Christian Deppe, Roberto Ferrara. 1990-1995 [doi]
• Additivity in Classical-Quantum Wiretap ChannelsArkin Tikku, Joseph M. Renes, Mario Berta. 1996-2001 [doi]
• Computable Lower Bounds for Capacities of Input-Driven Finite-State ChannelsV. Arvind Rameshwar, Navin Kashyap. 2002-2007 [doi]
• On the Algorithmic Computability of Achievability and Converse: ϵ-Capacity of Compound Channels and Asymptotic Bounds of Error-Correcting CodesHolger Boche, Rafael F. Schaefer, H. Vincent Poor. 2008-2013 [doi]
• Capacity of Continuous Channels with Memory via Directed Information Neural EstimatorZiv Aharoni, Dor Tsur, Ziv Goldfeld, Haim H. Permuter. 2014-2019 [doi]
• Computability of the Zero-Error Capacity with Kolmogorov OracleHolger Boche, Christian Deppe. 2020-2025 [doi]
• Bounds on Permutation Channel CapacityAnuran Makur. 2026-2031 [doi]
• Capacity Bounds for Amplitude-Constrained AWGN MIMO Channels with FadingAntonino Favano, Marco Ferrari 0001, Maurizio Magarini, Luca Barletta. 2032-2037 [doi]
• Capacity Bounds for Communication Systems with Quantization and Spectral ConstraintsSourjya Dutta, Abbas Khalili, Elza Erkip, Sundeep Rangan. 2038-2043 [doi]
• Capacity of Line-of-Sight MIMO ChannelsHeedong Do, Namyoon Lee, Angel Lozano. 2044-2048 [doi]
• Capacity of Multicarrier Faster-than-Nyquist SignalingYong Jin Daniel Kim, Yi Feng. 2049-2054 [doi]
• A Connection between Feedback Capacity and Kalman Filter for Colored Gaussian NoisesSong Fang, Quanyan Zhu. 2055-2060 [doi]
• Bounds for the capacity error function for unidirectional channels with noiseless feedbackChristian Deppe, Georg Maringer, Vladimir S. Lebedev. 2061-2066 [doi]
• Feedback Channel Communication with Low Precision ArithmeticYonatan Urman, David Burshtein. 2067-2072 [doi]
• New Formulas of Ergodic Feedback Capacity of AGN Channels Driven by Stable and Unstable Autoregressive NoiseChristos K. Kourtellaris, Charalambos D. Charalambous, Sergey Loyka. 2073-2078 [doi]
• Measurement Dependent Noisy Search with Stochastic CoefficientsNancy Ronquillo, Tara Javidi. 2079-2084 [doi]
• Decentralized sequential active hypothesis testing and the MAC feedback capacityAchilleas Anastasopoulos, Sandeep Pradhan. 2085-2090 [doi]
• From Feedback Capacity to Tight Achievable Rates without Feedback for AGN Channels with Stable and Unstable Autoregressive NoiseChristos K. Kourtellaris, Charalambos D. Charalambous, Sergey Loyka. 2091-2096 [doi]
• The Arbitrarily Varying Channel with Colored Gaussian NoiseUzi Pereg, Yossef Steinberg. 2097-2102 [doi]
• Symmetrizability for Myopic AVCsAmitalok J. Budkuley, Bikash Kumar Dey, Sidharth Jaggi, Michael Langberg, Anand D. Sarwate, Carol Wang. 2103-2107 [doi]
• An Explicit Formula for the Zero-Error Feedback Capacity of a Class of Finite-State Additive Noise ChannelsAmir Saberi, Farhad Farokhi, Girish N. Nair. 2108-2113 [doi]
• On the Capacity of Deletion Channels with StatesYonglong Li, Vincent Y. F. Tan. 2114-2119 [doi]
• Feedback Capacity of Finite-State Channels with Causal State Known at the EncoderEli Shemuel, Oron Sabag, Haim H. Permuter. 2120-2125 [doi]
• Strong Converse for the State Dependent ChannelYasutada Oohama. 2126-2130 [doi]
• The Asymptotic Generalized Poor-Verdú Bound Achieves the BSC Error Exponent at Zero RateLing-Hua Chang, Po-Ning Chen, Fady Alajaji, Yunghsiang S. Han. 2131-2136 [doi]
• Proof of Convergence for Correct-Decoding Exponent ComputationSergey Tridenski, Anelia Somekh-Baruch, Ram Zamir. 2137-2142 [doi]
• Revisiting Zero-Rate Bounds on the Reliability Function of Discrete Memoryless ChannelsMarco Bondaschi, Marco Dalai. 2143-2148 [doi]
• Refined Strong Converse for the Constant Composition CodesHao-Chung Cheng, Baris Nakiboglu. 2149-2154 [doi]
• Variable-Length Source Dispersions Differ under Maximum and Average Error CriteriaYuta Sakai, Vincent Y. F. Tan. 2155-2160 [doi]
• Finite-Blocklength Performance of Sequential Transmission over BSC with Noiseless FeedbackHengjie Yang, Richard D. Wesel. 2161-2166 [doi]
• Resolution Limits of Non-Adaptive Querying for Noisy 20 Questions EstimationLin Zhou 0002, Alfred Hero. 2167-2172 [doi]
• Low Complexity Algorithms for Transmission of Short Blocks over the BSC with Full FeedbackAmaael Antonini, Hengjie Yang, Richard D. Wesel. 2173-2178 [doi]
• Lossless Data Compression with Side Information: Nonasymptotics and DispersionLampros Gavalakis, Ioannis Kontoyiannis. 2179-2183 [doi]
• Noisy GuessesNeri Merhav. 2184-2188 [doi]
• Gray-Wyner and Slepian-Wolf GuessingRobert Graczyk, Amos Lapidoth. 2189-2193 [doi]
• Cost of Guessing: Applications to Data RepairSuayb S. Arslan, Elif Haytaoglu. 2194-2198 [doi]
• Constrained Functional Value under General Convexity Conditions with Applications to Distributed SimulationYanjun Han. 2199-2204 [doi]
• The Courtade-Kumar Most Informative Boolean Function Conjecture and a Symmetrized Li-Médard Conjecture are EquivalentLeighton Pate Barnes, Ayfer Özgür. 2205-2209 [doi]
• Information Constrained Optimal Transport: From Talagrand, to Marton, to CoverYikun Bai, Xiugang Wu, Ayfer Özgür. 2210-2215 [doi]
• On Nonparametric Estimation of the Fisher InformationWei Cao 0003, Alex Dytso, Michael Fauß, H. Vincent Poor, Gang Feng 0004. 2216-2221 [doi]
• Strong Asymptotic Composition Theorems for Sibson Mutual InformationBenjamin Wu, Aaron B. Wagner, G. Edward Suh, Ibrahim Issa. 2222-2227 [doi]
• On the Trackability of Stochastic Processes Based on Causal InformationBaran Tan Bacinoglu, Yin Sun, Elif Uysal. 2228-2233 [doi]
• Approximate Gács-Körner Common InformationSalman Salamatian, Asaf Cohen 0001, Muriel Médard. 2234-2239 [doi]
• On the Compressibility of Affinely Singular Random VectorsMohammad-Amin Charusaie, Stefano Rini, Arash Amini. 2240-2245 [doi]
• Continuity of Generalized EntropyAolin Xu. 2246-2251 [doi]
• A Local Characterization for Wyner Common InformationShao-Lun Huang, Xiangxiang Xu 0001, Lizhong Zheng, Gregory W. Wornell. 2252-2257 [doi]
• Usable deviation bounds for the information content of convex measuresMatthieu Fradelizi, Jiange Li, Mokshay Madiman. 2258-2263 [doi]
• Complexity of Estimating Rényi Entropy of Markov ChainsMaciej Obremski, Maciej Skorski. 2264-2269 [doi]
• A Tight Uniform Continuity Bound for EquivocationMohammad A. Alhejji, Graeme Smith. 2270-2274 [doi]
• Rényi Divergence rates of Ergodic Markov Chains: existence, explicit expressions and propertiesValérie Girardin, Philippe Regnault. 2275-2279 [doi]
• On the Second- and Third-Order Asymptotics of Smooth Rényi Entropy and Their ApplicationsYuta Sakai, Vincent Y. F. Tan. 2280-2285 [doi]
• Optimum Source Resolvability Rate with Respect to f-Divergences Using the Smooth Rényi EntropyRyo Nomura, Hideki Yagi. 2286-2291 [doi]
• On the Rényi Entropy of Log-Concave SequencesJames Melbourne, Tomasz Tkocz. 2292-2296 [doi]
• Rényi Bounds on Information CombiningChristoph Hirche. 2297-2302 [doi]
• Explicit Renyi Entropy for Hidden Markov ModelsJoachim Breitner, Maciej Skorski. 2303-2308 [doi]
• Lossy coding of a time-limited piece of a band-limited white Gaussian sourceYoussef Jaffal, Ibrahim C. Abou-Faycal. 2309-2313 [doi]
• A High-SNR Normal Approximation for MIMO Rayleigh Block-Fading ChannelsChao Qi, Tobias Koch. 2314-2319 [doi]
• Registration of Finite Resolution Images: a Second-order AnalysisRavi Kiran Raman, Lav R. Varshney. 2320-2325 [doi]
• Second-Order Achievable Rates for a Block Fading Gaussian Multiple Access ChannelDeekshith P. K., Vinod Sharma. 2326-2331 [doi]
• Isomorphism Problem Revisited: Information Spectrum ApproachShun Watanabe, Te Sun Han. 2332-2336 [doi]
• Empirical Properties of Good Channel CodesQinghua Devon Ding, Sidharth Jaggi, Shashank Vatedka, Yihan Zhang. 2337-2342 [doi]
• Exact Expressions in Source and Channel Coding Problems Using Integral RepresentationsNeri Merhav, Igal Sason. 2343-2348 [doi]
• A Universal Low Complexity Compression Algorithm for Sparse Marked GraphsPayam Delgosha, Venkat Anantharam. 2349-2354 [doi]
• On a Redundancy of AIFV-m Codes for m =3, 5Ryusei Fujita, Ken-ichi Iwata, Hirosuke Yamamoto. 2355-2359 [doi]
• A Universal Data Compression Scheme based on the AIVF Coding TechniquesHirosuke Yamamoto, Koki Imaeda, Kengo Hashimoto, Ken-ichi Iwata. 2360-2364 [doi]
• On D-ary Fano CodesFerdinando Cicalese, Eros Rossi. 2365-2370 [doi]
• O (log log n) Worst-Case Local Decoding and Update Efficiency for Data CompressionShashank Vatedka, Venkat Chandar, Aslan Tchamkerten. 2371-2376 [doi]
• Data Deduplication with Random SubstitutionsHao Lou, Farzad Farnoud. 2377-2382 [doi]
• An Alphabet-Size Bound for the Information Bottleneck FunctionChristoph Hirche, Andreas J. Winter 0002. 2383-2388 [doi]
• One shot approach to lossy source coding under average distortion constraintsNir Elkayam, Meir Feder. 2389-2393 [doi]
• Asymptotically Scale-invariant Multi-resolution QuantizationCheuk Ting Li. 2394-2398 [doi]
• Discrete Optimal Reconstruction Distributions for Itakura-Saito Distortion MeasureKazuho Watanabe. 2399-2404 [doi]
• Scalable Source Coding With Causal Side Information and a Causal HelperShraga I. Bross. 2405-2409 [doi]
• Improved Achievable Regions in Networked Scalable Coding ProblemsEmrah Akyol, Urbashi Mitra, Ertem Tuncel, Kenneth Rose. 2410-2415 [doi]
• On optimal weighted-sum rates for the modulo sum problemChandra Nair, Yan Nan Wang. 2416-2420 [doi]
• Some Results on the Vector Gaussian Hypothesis Testing ProblemPierre Escamilla, Abdellatif Zaidi, Michèle A. Wigger. 2421-2425 [doi]
• Hypergraph-based Coding Schemes for Two Source Coding Problems under Maximal DistortionSourya Basu, Daewon Seo, Lav R. Varshney. 2426-2431 [doi]
• Gaussian Multiterminal Source-Coding with Markovity: An Efficiently-Computable Outer BoundOmer Bilgen, Aaron B. Wagner. 2432-2437 [doi]
• Fundamental limits of distributed trackingVictoria Kostina, Babak Hassibi. 2438-2443 [doi]
• Characterization of Conditional Independence and Weak Realizations of Multivariate Gaussian Random Variables: Applications to NetworksCharalambos D. Charalambous, Jan H. van Schuppen. 2444-2449 [doi]
• On Effective Stochastic Mechanisms for On-The-Fly Codebook RegenerationAhmed Elshafiy, Mahmoud Namazi, Kenneth Rose. 2450-2455 [doi]
• Optimal Causal Rate-Constrained Sampling for a Class of Continuous Markov ProcessesNian Guo, Victoria Kostina. 2456-2461 [doi]
• Tracking an Auto-Regressive Process with Limited CommunicationRooji Jinan, Parimal Parag, Himanshu Tyagi. 2462-2467 [doi]
• Adaptive Coding for Two-Way Lossy Source-Channel CommunicationJian-Jia Weng, Fady Alajaji, Tamás Linder. 2468-2473 [doi]
• Robust Gaussian Joint Source-Channel Coding Under the Near-Zero Bandwidth RegimeMohammadamin Baniasadi, Ertem Tuncel. 2474-2479 [doi]
• Achievability Bounds for Community Detection and Matrix Completion with Two-Sided Graph Side-InformationQiaosheng Zhang, Vincent Y. F. Tan, Changho Suh. 2480-2485 [doi]
• Provable Efficient Skeleton Learning of Encodable Discrete Bayes Nets in Poly-Time and Sample ComplexityAdarsh Bank, Jean Honorio. 2486-2491 [doi]
• Optimal Learning of Joint Alignments with a Faulty OracleKasper Green Larsen, Michael Mitzenmacher, Charalampos E. Tsourakakis. 2492-2497 [doi]
• An Efficient Neural Network Architecture for Rate Maximization in Energy Harvesting Downlink ChannelsHeasung Kim, Taehyun Cho, Jungwoo Lee 0001, Wonjae Shin, H. Vincent Poor. 2498-2503 [doi]
• Online Memorization of Random Firing Sequences by a Recurrent Neural NetworkPatrick Murer, Hans-Andrea Loeliger. 2504-2509 [doi]
• Evaluation of Error Probability of Classification Based on the Analysis of the Bayes CodeShota Saito, Toshiyasu Matsushima. 2510-2514 [doi]
• Optimality of Least-squares for Classification in Gaussian-Mixture ModelsHossein Taheri, Ramtin Pedarsani, Christos Thrampoulidis. 2515-2520 [doi]
• A Fair Classifier Using Mutual InformationJaewoong Cho, Gyeongjo Hwang, Changho Suh. 2521-2526 [doi]
• Analytic Study of Double Descent in Binary Classification: The Impact of LossGanesh Ramachandra Kini, Christos Thrampoulidis. 2527-2532 [doi]
• On Binary Statistical Classification from Mismatched Empirically Observed StatisticsHung-Wei Hsu, I-Hsiang Wang. 2533-2538 [doi]
• Communication Efficient Distributed Approximate Newton MethodAvishek Ghosh, Raj Kumar Maity, Arya Mazumdar, Kannan Ramchandran. 2539-2544 [doi]
• Communication Efficient and Byzantine Tolerant Distributed LearningAvishek Ghosh, Raj Kumar Maity, Swanand Kadhe, Arya Mazumdar, Kannan Ramchandran. 2545-2550 [doi]
• Crowdsourced Classification with XOR Queries: An Algorithm with Optimal Sample ComplexityDaesung Kim, Hye Won Chung. 2551-2555 [doi]
• Reliable Distributed Clustering with Redundant Data AssignmentVenkata Gandikota, Arya Mazumdar, Ankit Singh Rawat. 2556-2561 [doi]
• Analysis of K Nearest Neighbor KL Divergence Estimation for Continuous DistributionsPuning Zhao, Lifeng Lai. 2562-2567 [doi]
• Entropy property testing with finitely many errorsChanglong Wu, Narayana Santhanam. 2568-2573 [doi]
• On Learning Parametric Non-Smooth Continuous DistributionsSudeep Kamath, Alon Orlitsky, Venkatadheeraj Pichapati, Ehsan Zobeidi. 2574-2579 [doi]
• Latent Factor Analysis of Gaussian Distributions under Graphical ConstraintsMd Mahmudul Hasan, Shuangqing Wei, Ali Moharrer. 2580-2585 [doi]
• Learning Additive Noise Channels: Generalization Bounds and AlgorithmsNir Weinberger. 2586-2591 [doi]
• Federated Recommendation System via Differential PrivacyTan Li, Linqi Song, Christina Fragouli. 2592-2597 [doi]
• Update Aware Device Scheduling for Federated Learning at the Wireless EdgeMohammad Mohammadi Amiri, Deniz Gündüz, Sanjeev R. Kulkarni, H. Vincent Poor. 2598-2603 [doi]
• Wireless Federated Learning with Local Differential PrivacyMohamed Seif, Ravi Tandon, Ming Li. 2604-2609 [doi]
• The Communication-Aware Clustered Federated Learning ProblemNir Shlezinger, Stefano Rini, Yonina C. Eldar. 2610-2615 [doi]
• Hierarchical Coded Gradient Aggregation for Learning at the EdgeSaurav Prakash, Amirhossein Reisizadeh, Ramtin Pedarsani, Amir Salman Avestimehr. 2616-2621 [doi]
• Numerically Stable Binary Gradient CodingNeophytos Charalambides, Hessam Mahdavifar, Alfred O. Hero III. 2622-2627 [doi]
• On Byzantine-Resilient High-Dimensional Stochastic Gradient DescentDeepesh Data, Suhas N. Diggavi. 2628-2633 [doi]
• Communication-Efficient Gradient Coding for Straggler Mitigation in Distributed LearningSwanand Kadhe, Onur Ozan Koyluoglu, Kannan Ramchandran. 2634-2639 [doi]
• 2-Divergence in High DimensionsZiv Goldfeld, Kengo Kato. 2640-2645 [doi]
• High-dimensional rank-one nonsymmetric matrix decomposition: the spherical caseClément Luneau, Nicolas Macris, Jean Barbier. 2646-2651 [doi]
• Multi-Product Dynamic Pricing in High-Dimensions with Heterogeneous Price SensitivityAdel Javanmard, Hamid Nazerzadeh, Simeng Shao. 2652-2657 [doi]
• Limits on Gradient Compression for Stochastic OptimizationPrathamesh Mayekar, Himanshu Tyagi. 2658-2663 [doi]
• The Power of Graph Convolutional Networks to Distinguish Random Graph ModelsAbram Magner, Mayank Baranwal, Alfred O. Hero III. 2664-2669 [doi]
• Exponentially Fast Concentration of Vector Approximate Message Passing to its State EvolutionCollin Cademartori, Cynthia Rush. 2670-2675 [doi]
• Online Message Passing-based Inference in the Hierarchical Gaussian FilterIsmail Senöz, Bert de Vries. 2676-2681 [doi]
• Data-Driven Factor Graphs for Deep Symbol DetectionNir Shlezinger, Nariman Farsad, Yonina C. Eldar, Andrea J. Goldsmith. 2682-2687 [doi]
• CodNN - Robust Neural Networks From Coded ClassificationNetanel Raviv, Siddharth Jain, Pulakesh Upadhyaya, Jehoshua Bruck, Anxiao Andrew Jiang. 2688-2693 [doi]
• Functional Error Correction for Reliable Neural NetworksKunping Huang, Paul H. Siegel, Anxiao Andrew Jiang. 2694-2699 [doi]
• On the α-loss Landscape in the Logistic ModelTyler Sypherd, Mario Diaz, Lalitha Sankar, Gautam Dasarathy. 2700-2705 [doi]
• Max-affine regression with universal parameter estimation for small-ball designsAvishek Ghosh, Ashwin Pananjady, Aditya Guntuboyina, Kannan Ramchandran. 2706-2710 [doi]
• Model Projection: Theory and Applications to Fair Machine LearningWael Alghamdi, Shahab Asoodeh, Hao Wang 0063, Flávio P. Calmon, Dennis Wei, Karthikeyan Natesan Ramamurthy. 2711-2716 [doi]
• On Estimation of Modal DecompositionsAnuran Makur, Gregory W. Wornell, Lizhong Zheng. 2717-2722 [doi]
• Robust Generalization via f-Mutual InformationAmedeo Roberto Esposito, Michael Gastpar, Ibrahim Issa. 2723-2728 [doi]
• Learning Representations by Maximizing Mutual Information in Variational AutoencodersAli Lotfi-Rezaabad, Sriram Vishwanath. 2729-2734 [doi]
• Stochastic Bottleneck: Rateless Auto-Encoder for Flexible Dimensionality ReductionToshiaki Koike-Akino, Ye Wang 0001. 2735-2740 [doi]
• Generalization Error Bounds via mth Central Moments of the Information DensityFredrik Hellström, Giuseppe Durisi. 2741-2746 [doi]
• Exploring Unique Relevance for Mutual Information based Feature SelectionShiyu Liu, Mehul Motani. 2747-2752 [doi]
• Clustering piecewise stationary processesAzadeh Khaleghi, Daniil Ryabko. 2753-2758 [doi]
• On Top-k Selection from m-wise Partial Rankings via Borda CountingWenjing Chen, Ruida Zhou, Chao Tian, Cong Shen. 2759-2764 [doi]
• Polarization in Attraction-Repulsion ModelsElisabetta Cornacchia, Neta Singer, Emmanuel Abbe. 2765-2770 [doi]
• Information-theoretic limits of a multiview low-rank symmetric spiked matrix modelJean Barbier, Galen Reeves. 2771-2776 [doi]
• A Hoeffding Inequality for Finite State Markov Chains and its Applications to Markovian BanditsVrettos Moulos. 2777-2782 [doi]
• An Improved Regret Bound for Thompson Sampling in the Gaussian Linear Bandit SettingCem Kalkanli, Ayfer Özgür. 2783-2788 [doi]
• Learned Scheduling of LDPC Decoders Based on Multi-armed BanditsSalman Habib, Allison Beemer, Jörg Kliewer. 2789-2794 [doi]
• Detecting an Odd Restless Markov Arm with a Trembling HandP. N. Karthik, Rajesh Sundaresan. 2795-2800 [doi]
• Active Learning for Classification with AbstentionShubhanshu Shekhar, Mohammad Ghavamzadeh, Tara Javidi. 2801-2806 [doi]
• Rényi Entropy Bounds on the Active Learning Cost-Performance TradeoffVahid Jamali, Antonia Maria Tulino, Jaime Llorca, Elza Erkip. 2807-2812 [doi]
• An Efficient Running Quantile Estimation Technique alongside Correntropy for Outlier Rejection in Online RegressionSajjad Bahrami, Ertem Tuncel. 2813-2818 [doi]
• Information-theoretic analysis for transfer learningXuetong Wu, Jonathan H. Manton, Uwe Aickelin, Jingge Zhu. 2819-2824 [doi]
• What is the Value of Data? on Mathematical Methods for Data Quality EstimationNetanel Raviv, Siddharth Jain, Jehoshua Bruck. 2825-2830 [doi]
• On the Exact Lower Bounds of Encoding Circuit Sizes of Hamming Codes and Hadamard CodesZhengrui Li, Sian-Jheng Lin, Yunghsiang S. Han. 2831-2836 [doi]
• Computing the Partition Function of the Sherrington-Kirkpatrick Model is Hard on AverageDavid Gamarnik, Eren C. Kizildag. 2837-2842 [doi]
• Interactive Verifiable Polynomial EvaluationSaeid Sahraei, Mohammad Ali Maddah-Ali, Salman Avestimehr. 2843-2848 [doi]
• Learning a Neural-Network Controller for a Multiplicative Observation Noise SystemVignesh Subramanian, Moses Won, Gireeja Ranade. 2849-2854 [doi]
• Stabilizing Dynamical Systems with Fixed-Rate Feedback using Constrained QuantizersOron Sabag, Victoria Kostina, Babak Hassibi. 2855-2860 [doi]
• Distributed State Estimation with Bounded Errors over Multiple Access ChannelsGhassen Zafzouf, Girish N. Nair. 2861-2866 [doi]
• Structural Properties of Nonanticipatory Epsilon Entropy of Multivariate Gaussian SourcesCharalambos D. Charalambous, Themistoklis Charalambous, Christos K. Kourtellaris, Jan H. van Schuppen. 2867-2872 [doi]
• Poisson channel with binary Markov input and average sojourn time constraintMark Sinzger, Maximilian Gehri, Heinz Koeppl. 2873-2878 [doi]
• How else can we define Information Flow in Neural Circuits?Praveen Venkatesh, Sanghamitra Dutta, Pulkit Grover. 2879-2884 [doi]
• Coding for Efficient DNA SynthesisAndreas Lenz, Yi Liu 0052, Cyrus Rashtchian, Paul H. Siegel, Antonia Wachter-Zeh, Eitan Yaakobi. 2885-2890 [doi]
• Bee-Identification Error Exponent with Absentee BeesAnshoo Tandon, Vincent Y. F. Tan, Lav R. Varshney. 2891-2896 [doi]
• Efficient Algorithm for the Linear Complexity of Sequences and Some Related ConsequencesYeow Meng Chee, Johan Chrisnata, Tuvi Etzion, Han Mao Kiah. 2897-2902 [doi]
• Duplication with transposition distance to the root for q-ary stringsNikita Polyanskii, Ilya Vorobyev. 2903-2908 [doi]
• The Numbers of De Bruijn Sequences in Extremal Weight ClassesMing Li 0033, Yupeng Jiang, Dongdai Lin. 2909-2914 [doi]
• On the 2-Adic Complexity of A Class of Binary Sequences of Period 4p with Optimal Autocorrelation MagnitudeMinghui Yang, Lulu Zhang, Keqin Feng. 2915-2920 [doi]
• New Optimal Sets of Perfect Polyphase Sequences Based on Circular Florentine ArraysDan Zhang 0013, Tor Helleseth. 2921-2925 [doi]
• Cross Z-Complementary Pairs (CZCPs) for Optimal Training in Broadband Spatial Modulation SystemsZilong Liu 0001, Ping Yang, Yong Liang Guan, Pei Xiao. 2926-2930 [doi]
• *Cheng-Yu Pai, Chao-Yu Chen. 2931-2935 [doi]
• Optimality of Treating Inter-Cell Interference as Noise Under Finite Precision CSITHamdi Joudeh, Giuseppe Caire. 2936-2941 [doi]
• Channel Models, Favorable Propagation and MultiStage Linear Detection in Cell-Free Massive MIMORoya Gholami, Laura Cottatellucci, Dirk T. M. Slock. 2942-2947 [doi]
• Approaching Capacity Without Pilots via Nonlinear Processing at the EdgeGuido Carlo Ferrante. 2948-2952 [doi]
• On Optimal Multi-user Beam Alignment in Millimeter Wave Wireless SystemsAbbas Khalili, Shahram Shahsavari, Mohammad Ali Amir Khojastepour, Elza Erkip. 2953-2958 [doi]
• Bursty Wireless Networks of Bounded CapacityGrace Villacrés, Tobias Koch 0001, Gonzalo Vazquez-Vilar. 2959-2964 [doi]
• Beyond Max-SNR: Joint Encoding for Reconfigurable Intelligent SurfacesRoy Karasik, Osvaldo Simeone, Marco Di Renzo, Shlomo Shamai Shitz. 2965-2970 [doi]
• Reconfigurable Surface Assisted Multi-User Opportunistic BeamformingQurrat-Ul-Ain Nadeem, Anas Chaaban, Mérouane Debbah. 2971-2976 [doi]
• On the Capacity of Intelligent Reflecting Surface Aided MIMO CommunicationShuowen Zhang, Rui Zhang 0006. 2977-2982 [doi]
• Message-Passing Based Channel Estimation for Reconfigurable Intelligent Surface Assisted MIMOHang Liu, Xiaojun Yuan 0002, Ying Jun Angela Zhang. 2983-2988 [doi]
• Minimum Feedback for Collision-Free Scheduling in Massive Random AccessJustin Kang, Wei Yu. 2989-2994 [doi]
• On Approximate Message Passing for Unsourced Access with Coded Compressed SensingVamsi K. Amalladinne, Asit Department, Asit Kumar Pradhan, Cynthia Rush, Jean-François Chamberland, Krishna R. Narayanan. 2995-3000 [doi]
• Unsourced Multiuser Sparse Regression Codes achieve the Symmetric MAC CapacityAlexander Fengler, Peter Jung 0001, Giuseppe Caire. 3001-3006 [doi]
• Interleaved Block Coding for Achieving Gaussian Random Access Channel CapacityTugcan Aktas, Pinar Sen. 3007-3012 [doi]
• Gaussian Multiple and Random Access in the Finite Blocklength RegimeRecep Can Yavas, Victoria Kostina, Michelle Effros. 3013-3018 [doi]
• A Polar Code Based TIN-SIC Scheme for the Unsourced Random Access in the Quasi-Static Fading MACKirill V. Andreev, Evgeny Marshakov, Alexey A. Frolov. 3019-3024 [doi]
• Capacity per Unit-Energy of Gaussian Random Many-Access ChannelsJithin Ravi, Tobias Koch 0001. 3025-3030 [doi]
• Online Estimation and Adaptation for Random Access with Successive Interference CancellationSang-Woon Jeon, Hu Jin. 3031-3036 [doi]
• On The Capacity of Gaussian MIMO Channels Under Interference ConstraintsSergey Loyka. 3037-3042 [doi]
• Bounding the Achievable Region of Sparse NOMABenjamin M. Zaidel, Ori Shental, Shlomo Shamai Shitz. 3043-3048 [doi]
• Resource Allocation in Low Density Spreading Uplink NOMA via Asymptotic AnalysisHossein Asgharimoghaddam, Antti Tölli. 3049-3054 [doi]
• Rate-Diversity Optimal Multiblock Space-Time Codes via Sum-Rank CodesMohannad Shehadeh, Frank R. Kschischang. 3055-3060 [doi]
• On MIMO Gaussian Wiretap Channels with Optimal Energy HarvestingNima Tavangaran, Mojtaba Vaezi, H. Vincent Poor. 3061-3066 [doi]
• Information-Energy Capacity Region for SWIPT Systems with Power Amplifier NonlinearityIoannis Krikidis. 3067-3072 [doi]