default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDISIT 2020: Los Angeles, CA, USA
- IEEE International Symposium on Information Theory, ISIT 2020, Los Angeles, CA, USA, June 21-26, 2020. IEEE 2020, ISBN 978-1-7281-6432-8
- Rachel N. Berman, Ron M. Roth:
On the Number of Factorizations of Polynomials over Finite Fields. 1-6 - Wei Zhao, Kenneth W. Shum, Shenghao Yang:
Optimal Locally Repairable Constacyclic Codes of Prime Power Lengths. 7-12 - Renaud-Alexandre Pitaval, Yi Qin:
Grassmannian Frames in Composite Dimensions by Exponentiating Quadratic Forms. 13-18 - Julian Renner, Sven Puchinger, Antonia Wachter-Zeh, Camilla Hollanti
, Ragnar Freij-Hollanti:
Low-Rank Parity-Check Codes over the Ring of Integers Modulo a Prime Power. 19-24 - Ryan Gabrys, Srilakshmi Pattabiraman, Olgica Milenkovic:
Mass Error-Correction Codes for Polymer-Based Data Storage. 25-30 - Mahdi Soleymani, Hessam Mahdavifar:
Analog Subspace Coding: A New Approach to Coding for Non-Coherent Wireless Networks. 31-36 - Tuan Thanh Nguyen, Kui Cai, Kees A. Schouhamer Immink:
Binary Subblock Energy-Constrained Codes: Knuth's Balancing and Sequence Replacement Techniques. 37-41 - Mengke Lian, Christian Häger, Henry D. Pfister:
Decoding Reed-Muller Codes Using Redundant Code Constraints. 42-47 - Shohei Satake, Yujie Gu:
Constructions of Complex Codebooks Asymptotically Meeting the Welch Bound: A Graph Theoretic Approach. 48-53 - Sven Puchinger, Julian Renner, Johan Rosenkilde:
Generic Decoding in the Sum-Rank Metric. 54-59 - Hikmet Yildiz, Netanel Raviv, Babak Hassibi:
Support Constrained Generator Matrices of Gabidulin Codes in Characteristic Zero. 60-65 - Fatemeh Kazemi, Sascha Kurz, Emina Soljanin:
A Geometric View of the Service Rates of Codes Problem and its Application to the Service Rate of the First Order Reed-Muller Codes. 66-71 - Rishabh K. Iyer, Jeff A. Bilmes:
Concave Aspects of Submodular Functions. 72-77 - Nicolas Charpenay, Maël Le Treust:
Zero-Error Coding with a Generator Set of Variable-Length Words. 78-83 - Roni Con, Amir Shpilka:
Explicit and Efficient Constructions of Coding Schemes for the Binary Deletion Channel. 84-89 - Ilya Vorobyev:
Optimal Multistage Group Testing Algorithm for 3 Defectives. 90-95 - Chong Shangguan, Itzhak Tamo:
Error Detection and Correction in Communication Networks. 96-101 - Aditya Potukuchi, Yihan Zhang:
Improved efficiency for covering codes matching the sphere-covering bound. 102-107 - Duc Tu Dao, Han Mao Kiah, Hengjia Wei:
Maximum Length of Robust Positioning Sequences. 108-113 - Jing Hao, Han Huang, Galyna V. Livshyts, Konstantin E. Tikhomirov:
Distribution of the Minimum Distance of Random Linear Codes. 114-119 - Dor Elimelech:
The Capacity of Multidimensional Permutations with Restricted Movement. 120-125 - Yonatan Yehezkeally, Moshe Schwartz:
Uncertainty of Reconstructing Multiple Messages from Uniform-Tandem-Duplication Noise. 126-131 - Abhishek Agarwal, Olgica Milenkovic, Srilakshmi Pattabiraman, João Ribeiro:
Group Testing with Runlength Constraints for Topological Molecular Storage. 132-137 - Gianira Nicoletta Alfarano, Julia Lieb, Joachim Rosenthal:
Construction of Rate (n - 1 )/n Non-Binary LDPC Convolutional Codes via Difference Triangle Sets. 138-143 - Mira Gonen, Ishay Haviv, Michael Langberg, Alex Sprintson:
Minimizing the alphabet size of erasure codes with restricted decoding sets. 144-149 - Steven T. Dougherty, Josep Rifà, Mercè Villanueva:
Constructions of Nonequivalent Fp-Additive Generalised Hadamard Codes. 150-155 - Jinwen Shi, Cong Ling, Osvaldo Simeone, Jörg Kliewer:
Coded Computation Against Straggling Channel Decoders in the Cloud for Gaussian Channels. 156-161 - Shailja Agrawal, Prasad Krishnan:
Low Complexity Distributed Computing via Binary Matrices with Extension to Stragglers. 162-167 - Nicholas Woolsey, Rong-Rong Chen, Mingyue Ji:
Heterogeneous Computation Assignments in Coded Elastic Computing. 168-173 - Hoang Dau, Ryan Gabrys, Yu-Chih Huang, Chen Feng, Quang-Hung Luu, Eidah J. Alzahrani, Zahir Tari:
Optimizing the Transition Waste in Coded Elastic Computing. 174-178 - Shunsuke Horii:
Improved Computation-Communication Trade-Off for Coded Distributed Computing using Linear Dependence of Intermediate Values. 179-184 - Chien-Sheng Yang, Ramtin Pedarsani, Amir Salman Avestimehr:
Coded Computing in Unknown Environment via Online Learning. 185-190 - Quang Minh Nguyen, Haewon Jeong, Pulkit Grover:
Coded QR Decomposition. 191-196 - Adarsh M. Subramaniam, Anoosheh Heidarzadeh, Asit Kumar Pradhan, Krishna R. Narayanan:
Product Lagrange Coded Computing. 197-202 - Songze Li, Mingchao Yu, Chien-Sheng Yang, Amir Salman Avestimehr, Sreeram Kannan, Pramod Viswanath:
PolyShard: Coded Sharding Achieves Linearly Scaling Efficiency and Security Simultaneously. 203-208 - Yu Ye, Hao Chen, Ming Xiao, Mikael Skoglund, H. Vincent Poor:
Incremental ADMM with Privacy-Preservation for Decentralized Consensus Optimization. 209-214 - Kuikui Li, Meixia Tao, Jingjing Zhang, Osvaldo Simeone:
Multi-Cell Mobile Edge Coded Computing: Trading Communication and Computing for Distributed Matrix Multiplication. 215-220 - Xian Su, Xiaomei Zhong, Xiaodi Fan, Jun Li:
Local Re-encoding for Coded Matrix Multiplication. 221-226 - Zhen Chen, Zhuqing Jia, Zhiying Wang, Syed Ali Jafar:
GCSA Codes with Noise Alignment for Secure Coded Multi-Party Batch Matrix Multiplication. 227-232 - Pedro Soto, Jun Li:
Straggler-free Coding for Concurrent Matrix Multiplications. 233-238 - Asit Kumar Pradhan, Anoosheh Heidarzadeh, Krishna R. Narayanan:
Factored LT and Factored Raptor Codes for Large-Scale Distributed Matrix Multiplication. 239-244 - Qian Yu, Amir Salman Avestimehr:
Entangled Polynomial Codes for Secure, Private, and Batch Distributed Matrix Multiplication: Breaking the "Cubic" Barrier. 245-250 - Burak Hasircioglu, Jesús Gómez-Vilardebó, Deniz Gündüz:
Bivariate Polynomial Coding for Straggler Exploitation with Heterogeneous Workers. 251-256 - Pei Peng, Emina Soljanin, Philip Whiting:
Diversity vs. Parallelism in Distributed Computing with Redundancy. 257-262 - Andrew Thangaraj, Henry D. Pfister:
Efficient Maximum-Likelihood Decoding of Reed-Muller RM(m-3, m) Codes. 263-268 - Zilong Wang, Erzhong Xue, Guang Gong:
A New Construction of QAM Golay Complementary Sequence Pair. 269-273 - Cheuk Ting Leung, Mehul Motani, Rajshekhar Vishweshwar Bhat:
Multi-Label and Concatenated Neural Block Decoders. 274-279 - Hajir Roozbehani, Yury Polyanskiy:
Graceful degradation over the BEC via non-linear codes. 280-285 - Li Peng:
Time-Frequency Division Multiple Access and the TFDMA Ad Hoc Network Based on the (n, n(n-1), n-1) Permutation Group Codes. 286-291 - Hengjie Yang, Linfang Wang, Vincent Lau, Richard D. Wesel:
An Efficient Algorithm for Designing Optimal CRCs for Tail-Biting Convolutional Codes. 292-297 - Jiongyue Xing, Li Chen, Martin Bossert:
Low-Complexity Chase Decoding of Reed-Solomon Codes through Basis Reduction. 298-302 - Suihua Cai, Xiao Ma:
Twisted-Pair Superposition Transmission for Low Latency Communications. 303-308 - Arnaud Dumenil, Elie Awwad, Cyril Measson:
Tetrahedral Coding and Non-Unitary Resilience in Polarization-Multiplexed Lightwave Transmissions. 309-314 - Alejandro Cohen, Amit Solomon, Ken R. Duffy, Muriel Médard:
Noise Recycling. 315-320 - Tomer Raviv, Nir Raviv, Yair Be'ery:
Data-Driven Ensembles for Deep and Hard-Decision Hybrid Decoding. 321-326 - Marco Ferrari, Ramon Marenzi, Luca Barletta:
Message Flow Analysis in Practical LDPC Decoders for the Interpretation of Absorbing Set Thresholds. 327-332 - Jiongyue Xing, Martin Bossert, Sebastian Bitzer, Li Chen:
Iterative Decoding of Non-Binary Cyclic Codes Using Minimum-Weight Dual Codewords. 333-337 - Andreas Buchberger, Christian Häger, Henry D. Pfister, Laurent Schmalen, Alexandre Graell i Amat:
Pruning Neural Belief Propagation Decoders. 338-342 - Sundara Rajan Srinivasavaradhan, Suhas N. Diggavi, Christina Fragouli:
Equivalence of ML decoding to a continuous optimization problem. 343-348 - Viduranga Bandara Wijekoon, Emanuele Viterbo, Yi Hong:
A Low Complexity Decoding Algorithm for NB-LDPC Codes over Quadratic Extension Fields. 349-354 - Emna Ben Yacoub, Gianluigi Liva:
Asymptotic Absorbing Set Enumerators for Non-Binary Protograph-Based LDPC Code Ensembles. 355-360 - Yuxin Liu, Michelle Effros:
Finite-Blocklength and Error-Exponent Analyses for LDPC Codes in Point-to-Point and Multiple Access Communication. 361-366 - Emily McMillon, Allison Beemer, Christine A. Kelley:
Analysis of Absorbing Sets using Cosets and Syndromes. 367-372 - Yihan Zhang:
List Decoding for Oblivious Arbitrarily Varying MACs: Constrained and Gaussian. 373-378 - Noga Ron-Zewi, Mary Wootters, Gilles Zémor:
Linear-time Erasure List-decoding of Expander Codes. 379-383 - Changryoul Choi, Jechang Jeong:
Fast Soft Decision Decoding of Linear Block Codes Using Partial Syndrome Search. 384-388 - Boaz Shuval, Ido Tal:
List Decoding of Universal Polar Codes. 389-394 - Marvin Geiselhart, Ahmed Elkelesh, Moustafa Ebada, Sebastian Cammerer, Stephan ten Brink:
CRC-Aided Belief Propagation List Decoding of Polar Codes. 395-400 - Marco Mondelli, Seyyed Ali Hashemi, John M. Cioffi, Andrea Goldsmith:
Simplified Successive Cancellation Decoding of Polar Codes Has Sublinear Latency. 401-406 - Peter Trifonov:
Recursive Trellis Decoding Techniques of Polar Codes. 407-412 - Binghao Li, Baoming Bai, Min Zhu, Shenyang Zhou:
Improved Belief Propagation List Decoding for Polar Codes. 413-418 - Jincheng Dai, Kai Niu, Zhongwei Si:
Asynchronous Polar-Coded Modulation. 419-424 - Yunus Inan, Emre Telatar:
Finite-Level Quantization Procedures for Construction and Decoding of Polar Codes. 425-430 - Jaume del Olmo Alòs, Javier R. Fonollosa:
Polar Coding for the Wiretap Broadcast Channel with Multiple Messages. 431-436 - Mustafa Cemil Coskun, Joachim Neu, Henry D. Pfister:
Successive Cancellation Inactivation Decoding for Modified Reed-Muller and eBCH Codes. 437-442 - Hanwen Yao, Arman Fazeli, Alexander Vardy:
List Decoding of Arıkan's PAC Codes. 443-448 - James Chin-Jen Pang, Hessam Mahdavifar, S. Sandeep Pradhan:
Capacity-achieving Polar-based LDGM Codes with Crowdsourcing Applications. 449-454 - Arman Fazeli, Alexander Vardy, Hanwen Yao:
Hardness of Successive-Cancellation Decoding of Linear Codes. 455-460 - Xiaowei Wu, Min Qiu, Jinhong Yuan:
Partially Information Coupled Duo-Binary Turbo Codes. 461-466 - Homa Esfahanizadeh, Eshed Ram, Yuval Cassuto, Lara Dolecek:
Spatially Coupled Codes with Sub-Block Locality: Joint Finite Length-Asymptotic Design Approach. 467-472 - Min Zhu, David G. M. Mitchell, Michael Lentmaier, Daniel J. Costello Jr.:
A Novel Design of Spatially Coupled LDPC Codes for Sliding Window Decoding. 473-478 - Muhammad Umar Farooq, Saeedeh Moloudi, Michael Lentmaier:
Generalized LDPC Codes with Convolutional Code Constraints. 479-484 - Lev Tauz, Homa Esfahanizadeh, Lara Dolecek:
Non-Uniform Windowed Decoding For Multi-Dimensional Spatially-Coupled LDPC Codes. 485-490 - Pin-Wen Su, Yu-Chih Huang, Shih-Chun Lin, I-Hsiang Wang, Chih-Chun Wang:
Error Rate Analysis for Random Linear Streaming Codes in the Finite Memory Length Regime. 491-496 - Elad Domanovitz, Ashish Khisti, Wai-Tian Tan, Xiaoqing Zhu, John G. Apostolopoulos:
Streaming Erasure Codes over Multi-hop Relay Network. 497-502 - Vinayak Ramkumar, Myna Vajha, M. Nikhil Krishnan, P. Vijay Kumar:
Staggered Diagonal Embedding Based Linear Field Size Streaming Codes. 503-508 - Michael Rudow, K. V. Rashmi:
Online Versus Offline Rate in Streaming Codes for Variable-Size Messages. 509-514 - Jia Liu, Chaoyong Wang:
Tangential-Sphere Bound Revisited. 515-518 - Vincent Corlay, Joseph J. Boutros, Philippe Ciblat, Loïc Brunel:
On the decoding of Barnes-Wall lattices. 519-524 - Huseyin A. Inan, Ayfer Özgür:
Strongly Explicit and Efficiently Decodable Probabilistic Group Testing. 525-530 - Tefjol Pllaha, Olav Tirkkonen, A. Robert Calderbank:
Reconstruction of Multi-user Binary Subspace Chirps. 531-536 - Maiara F. Bollauf, Sueli I. R. Costa, Ram Zamir:
Lattice Construction C⋆ from Self-Dual Codes. 537-541 - Yeow Meng Chee, Tuvi Etzion, Han Mao Kiah, Hui Zhang:
Recovery Sets for Subspaces from a Vector Space. 542-547 - Rawad Bitar, Sidharth Jaggi:
Communication Efficient Secret Sharing in the Presence of Malicious Adversary. 548-553 - Hanxu Hou, Patrick P. C. Lee, Yunghsiang S. Han:
Minimum Storage Rack-Aware Regenerating Codes with Exact Repair and Small Sub-Packetization. 554-559 - Hanxu Hou, Patrick P. C. Lee, Yunghsiang S. Han:
Toward Optimality in Both Repair and Update via Generic MDS Code Transformation. 560-565 - Yeow Meng Chee, Charles Joseph Colbourn, Hoang Dau, Ryan Gabrys, Alan Chi Hung Ling, Dylan Lusi, Olgica Milenkovic:
Access Balancing in Storage Systems by Labeling Partial Steiner Systems. 566-570 - Han Cai, Moshe Schwartz:
On Optimal Locally Repairable Codes and Generalized Sector-Disk Codes. 571-576 - Francisco Maturana, V. S. Chaitanya Mukka, K. V. Rashmi:
Access-optimal Linear MDS Convertible Codes for All Parameters. 577-582 - Talha Cihad Gulcu:
Secure Node Repair of Reed-Solomon Codes. 583-588 - Zitan Chen, Min Ye, Alexander Barg:
Repair of RS codes with optimal access and error correction. 589-594 - Weijun Fang, Bin Chen, Shu-Tao Xia, Fang-Wei Fu:
Complete Characterization of Optimal LRCs with Minimum Distance 6 and Locality 2: Improved Bounds and Constructions. 595-599 - Weijun Fang, Bin Chen, Shu-Tao Xia, Fang-Wei Fu:
Perfect LRCs and k-Optimal LRCs. 600-604 - Rémi A. Chou, Jörg Kliewer:
Secure Distributed Storage: Rate-Privacy Trade-Off and XOR-Based Coding Scheme. 605-610 - Jie Hao, Jun Zhang, Shu-Tao Xia, Fang-Wei Fu, Yi-Xian Yang:
Weight Distributions of q-ary Optimal Locally Repairable Codes with Locality 2, Distance 5 and Even Dimension. 611-615 - Zitan Chen, Alexander Barg:
Cyclic LRC codes with hierarchy and availability. 616-621 - Siyi Yang, Ahmed H. Hareedy, A. Robert Calderbank, Lara Dolecek:
Topology-Aware Cooperative Data Protection in Blockchain-Based Decentralized Storage Networks. 622-627 - Lukas Holzbaur, Sven Puchinger, Eitan Yaakobi, Antonia Wachter-Zeh:
Partial MDS Codes with Local Regeneration. 628-633 - Lukas Holzbaur, Rina Polyanskaya, Nikita Polyanskii, Ilya Vorobyev:
Lifted Reed-Solomon Codes with Application to Batch Codes. 634-639 - Prasad Krishnan, V. Lalitha, Lakshmi Natarajan:
Coded Data Rebalancing: Fundamental Limits and Constructions. 640-645 - Fatemeh Kazemi, Esmaeil Karimi, Emina Soljanin, Alex Sprintson:
A Combinatorial View of the Service Rates of Codes Problem, its Equivalence to Fractional Matching and its Connection with Batch Codes. 646-651 - Michelle Kleckler, Soheil Mohajer:
Secure Determinant Codes: Type-II Security. 652-657 - Sagi Marcovich, Eitan Yaakobi:
Reconstruction of Strings from their Substrings Spectrum. 658-663 - Ryan Gabrys, Han Mao Kiah, Alexander Vardy, Eitan Yaakobi, Yiwei Zhang:
Locally Balanced Constraints. 664-669 - Lev Yohananov, Eitan Yaakobi:
Codes over Trees. 670-675 - Han Mao Kiah, Tuan Thanh Nguyen, Eitan Yaakobi:
Coding for Sequence Reconstruction for Single Edits. 676-681 - Ron M. Roth, Paul H. Siegel:
On Parity-Preserving Variable-Length Constrained Coding. 682-687 - Ahmed H. Hareedy, Beyza Dabak, A. Robert Calderbank:
Q-ary Asymmetric LOCO Codes: Constrained Codes Supporting Flash Evolution. 688-693 - Tuan Thanh Nguyen, Kui Cai, Kees A. Schouhamer Immink, Han Mao Kiah:
Constrained Coding with Error Control for DNA-Based Data Storage. 694-699 - Utkarsh Gupta, Han Mao Kiah, Alexander Vardy, Hanwen Yao:
Polar Codes with Balanced Codewords. 700-705 - Renfei Bu, Jos H. Weber, Kees A. Schouhamer Immink:
Maximum Likelihood Decoding for Channels with Uniform Noise and Signal Dependent Offset. 706-710 - Siddharth Jain, Farzad Farnoud, Moshe Schwartz, Jehoshua Bruck:
Coding for Optimized Writing Rate in DNA Storage. 711-716 - Jin Sima, Netanel Raviv, Jehoshua Bruck:
Robust Indexing - Optimal Codes for DNA Storage. 717-722 - Andreas Lenz, Cyrus Rashtchian, Paul H. Siegel, Eitan Yaakobi:
Covering Codes for Insertions and Deletions. 723-728 - Takayuki Nozaki:
Weight Enumerators for Number-Theoretic Codes and Cardinalities of Tenengolts' Non-binary Codes. 729-733 - Yuanyuan Tang, Farzad Farnoud:
Error-correcting Codes for Short Tandem Duplication and Substitution Errors. 734-739 - Jin Sima, Ryan Gabrys, Jehoshua Bruck:
Optimal Codes for the q-ary Deletion Channel. 740-745 - Yeow Meng Chee, Van Khu Vu:
Codes Correcting Synchronization Errors for Symbol-Pair Read Channels. 746-750 - Jin Sima, Ryan Gabrys, Jehoshua Bruck:
Syndrome Compression for Optimal Redundancy Codes. 751-756 - Andreas Lenz, Nikita Polyanskii:
Optimal Codes Correcting a Burst of Deletions of Variable Length. 757-762 - Omer Sabary, Eitan Yaakobi, Alexander Yucovich:
The Error Probability of Maximum-Likelihood Decoding over Two Deletion/Insertion Channels. 763-768 - Jin Sima, Ryan Gabrys, Jehoshua Bruck:
Optimal Systematic t-Deletion Correcting Codes. 769-774 - Ilia Smagloy, Lorenz Welter, Antonia Wachter-Zeh, Eitan Yaakobi:
Single-Deletion Single-Substitution Correcting Codes. 775-780 - Ryo Sakogawa, Haruhiko Kaneko:
Symbolwise MAP Estimation for Multiple-Trace Insertion/Deletion/Substitution Channels. 781-785 - Yixin Wang, Md. Noor-A-Rahim, Erry Gunawan, Yong Liang Guan, Chueh-Loo Poh:
Thermodynamically Stable DNA Code Design using a Similarity Significance Model. 786-791 - Yongjune Kim, Yoocharn Jeon, Cyril Guyot, Yuval Cassuto:
Optimizing the Write Fidelity of MRAMs. 792-797 - Nastaran Abadi Khooshemehr, Mohammad Ali Maddah-Ali:
Fundamental Limits of Distributed Encoding. 798-803 - Elsa Dupraz, Lav R. Varshney:
Noisy In-Memory Recursive Computation with Memristor Crossbars. 804-809 - Hyeon-Seong Im, Si-Hyeon Lee:
Mobility-Assisted Covert Communication over Wireless Ad Hoc Networks. 810-815 - Kang-Hee Cho, Si-Hyeon Lee:
Treating Interference as Noise is Optimal for Covert Communication over Interference Channels. 816-821 - Diego Lentner, Gerhard Kramer:
Stealth Communication with Vanishing Power over Binary Symmetric Channels. 822-827 - Shi-Yuan Wang, Matthieu R. Bloch:
Covert MIMO Communications under Variational Distance Constraint. 828-833 - Hassan ZivariFard, Matthieu R. Bloch, Aria Nosratinia:
Keyless Covert Communication in the Presence of Channel State Information. 834-839 - Mehrdad Tahmasbi, Matthieu R. Bloch:
Active Covert Sensing. 840-845 - Terry Shue Chien Lau, Chik How Tan:
Rank Preserving Code-based Signature. 846-851 - Yohei Okawa, Hiroki Koga:
An Ideal Secret Sharing Scheme Realizing an Access Structure Based on a Finite Projective Plane of Order 3. 852-857 - Ido Shahaf, Or Ordentlich, Gil Segev:
An Information-Theoretic Proof of the Streaming Switching Lemma for Symmetric Encryption. 858-863 - Deepak Agrawal, Smarajit Das, Srinivasan Krishanaswamy:
Secret sharing schemes based on Nonlinear codes. 864-867 - Yoshinori Ogawa, Shingo Sato, Junji Shikata, Hideki Imai:
Aggregate Message Authentication Codes with Detecting Functionality from Biorthogonal Codes. 868-873 - Onur Günlü, Rafael F. Schaefer, H. Vincent Poor:
Biometric and Physical Identifiers with Correlated Noise for Controllable Private Authentication. 874-878 - Congduan Li, Jingliang He, Shiqiu Liu, Dongliang Guo, Linqi Song:
On Secrecy Key of a class of Secure Asymmetric Multilevel Diversity Coding System. 879-883 - Bo Guan, Nazanin Takbiri, Dennis L. Goeckel, Amir Houmansadr, Hossein Pishro-Nik:
Sequence Obfuscation to Thwart Pattern Matching Attacks. 884-889 - Ajaykrishnan Nageswaran, Prakash Narayan:
Distribution Privacy Under Function Recoverability. 890-895 - Shahab Asoodeh, Mario Díaz, Flávio P. Calmon:
Privacy Amplification of Iterative Algorithms via Contraction Coefficients. 896-901 - Fangwei Ye, Hyunghoon Cho, Salim El Rouayheb:
Mechanisms for Hiding Sensitive Genotypes with Information-Theoretic Privacy. 902-907 - Zhuolun Xiang, Bolin Ding, Xi He, Jingren Zhou:
Linear and Range Counting under Metric-based Local Differential Privacy. 908-913 - Antonious M. Girgis, Deepesh Data, Suhas N. Diggavi:
Hiding Identities: Estimation Under Local Differential Privacy. 914-919 - Shahab Asoodeh, Jiachun Liao, Flávio P. Calmon, Oliver Kosut, Lalitha Sankar:
A Better Bound Gives a Hundred Rounds: Enhanced Privacy Guarantees via f-Divergences. 920-925 - Yucheng Liu, Ni Ding, Parastoo Sadeghi, Thierry Rakotoarivelo:
Privacy-Utility Tradeoff in a Guessing Framework Inspired by Index Coding. 926-931 - Giulia Cervia, Tobias J. Oechtering, Mikael Skoglund:
Remote Joint Strong Coordination and Reliable Communication. 932-937 - Carsten Rudolf Janda, Eduard A. Jorswieck, Moritz Wiese, Holger Boche:
Arbitrarily Varying Wiretap Channels with Non-Causal Side Information at the Jammer. 938-943 - Zhou Li, Hua Sun:
Conditional Disclosure of Secrets: A Noise and Signal Alignment Approach. 944-948 - Hao Xu, Giuseppe Caire, Cunhua Pan:
An Achievable Region for the Multiple Access Wiretap Channels with Confidential and Open Messages. 949-954 - Qiaoqiao Zhou, Chung Chan, Raymond W. Yeung:
On the Discussion Rate Region for the PIN Model. 955-959 - Anna Frank:
Delay-Optimal Coding for Secure Transmission over Parallel Burst Erasure Channels with an Eavesdropper. 960-965 - Chung Chan, Navin Kashyap, Praneeth Kumar Vippathalla, Qiaoqiao Zhou:
Secure Information Exchange for Omniscience. 966-971 - Gowtham R. Kurri, Vinod M. Prabhakaran:
Secure Computation to Hide Functions of Inputs. 972-977 - Hongchao Zhou, Abbas El Gamal:
Network Information Theoretic Security. 978-983 - Allison Beemer, Eric Graves, Jörg Kliewer, Oliver Kosut, Paul L. Yu:
Authentication with Mildly Myopic Adversaries. 984-989 - Noha M. Helal, Matthieu R. Bloch, Aria Nosratinia:
Resolvability of the Multiple Access Channel with Two-Sided Cooperation. 990-994 - Yanina Y. Shkel, H. Vincent Poor:
A compression perspective on secrecy measures. 995-1000 - Varun Narayanan, Manoj Mishra, Vinod M. Prabhakaran:
Private Two-Terminal Hypothesis Testing. 1001-1006 - Fatemeh Hosseinigoki, Oliver Kosut:
Capacity Region of the Gaussian Arbitrarily-Varying Broadcast Channel. 1007-1011 - Chao Tian:
On the Storage Cost of Private Information Retrieval. 1012-1017 - Tao Guo, Ruida Zhou, Chao Tian:
On the Information Leakage in Private Information Retrieval Systems. 1018-1023 - Mohammad Nassar, Eitan Yaakobi:
Array Codes for Functional PIR and Batch Codes. 1024-1029 - Yanliang Zhou, Qiwen Wang, Hua Sun, Shengli Fu:
The Minimum Upload Cost of Symmetric Private Information Retrieval. 1030-1034 - Zhusheng Wang, Karim Banawan, Sennur Ulukus:
Private Set Intersection Using Multi-Message Symmetric Private Information Retrieval. 1035-1040 - Xinyu Yao, Nan Liu, Wei Kang:
The Capacity of Private Information Retrieval Under Arbitrary Collusion Patterns. 1041-1046 - Ori Shmuel, Asaf Cohen:
Private Information Retrieval Over Gaussian MAC. 1047-1052 - Hsuan-Yin Lin, Siddhartha Kumar, Eirik Rosnes, Alexandre Graell i Amat, Eitan Yaakobi:
The Capacity of Single-Server Weakly-Private Information Retrieval. 1053-1058 - Matteo Allaix, Lukas Holzbaur, Tefjol Pllaha, Camilla Hollanti:
Quantum Private Information Retrieval from MDS-coded and Colluding Servers. 1059-1064 - Lukas Holzbaur, Camilla Hollanti, Antonia Wachter-Zeh:
Computational Code-Based Single-Server Private Information Retrieval. 1065-1070 - Islam Samy, Mohamed Adel Attia, Ravi Tandon, Loukas Lazos:
Latent-variable Private Information Retrieval. 1071-1076 - Seunghoan Song, Masahito Hayashi:
Capacity of Quantum Private Information Retrieval with Colluding Servers. 1077-1082 - Su Li:
Single-server Multi-message Private Information Retrieval with Side Information: the General Cases. 1083-1088 - Ruida Zhou, Tao Guo, Chao Tian:
Weakly Private Information Retrieval Under the Maximal Leakage Metric. 1089-1094 - Xiang Zhang, Kai Wan, Hua Sun, Mingyue Ji:
Cache-aided Multiuser Private Information Retrieval. 1095-1100 - Yinfei Xu, Daming Cao:
Secret Key Generation From Vector Gaussian Sources With Public and Private Communications. 1101-1105 - Jari Lietzén, Roope Vehkalahti, Olav Tirkkonen:
A Two-way QKD Protocol Outperforming One-way Protocols at Low QBER. 1106-1111 - Anoosheh Heidarzadeh, Alex Sprintson:
Private Computation with Individual and Joint Privacy. 1112-1117 - Behrooz Tahmasebi, Mohammad Ali Maddah-Ali:
Private Function Computation. 1118-1123 - Jaber Kakar, Anton Khristoforov, Seyedhamed Ebadifar, Aydin Sezgin:
Uplink Cost Adjustable Schemes in Secure Distributed Matrix Multiplication. 1124-1129 - Xiaochuan Ma, Lifeng Lai, Shuguang Cui:
Optimal Two-Stage Bayesian Sequential Change Diagnosis. 1130-1135 - Qunzhi Xu, Yajun Mei, George V. Moustakides:
Second-Order Asymptotically Optimal Change-point Detection Algorithm with Sampling Control. 1136-1140 - Anamitra Chaudhuri, Georgios Fellouris:
Sequential Detection and Isolation of a Correlated Pair. 1141-1146 - Taposh Banerjee, Prudhvi Gurram, Gene T. Whipps:
Multislot and Multistream Quickest Change Detection in Statistically Periodic Processes. 1147-1152 - Ruizhi Zhang, Shaofeng Zou:
A Game-Theoretic Approach to Sequential Detection in Adversarial Environments. 1153-1158 - Subhrakanti Dey:
Asymptotics of Quickest Change Detection with an Energy Harvesting Sensor. 1159-1164 - Aristomenis Tsopelakos, Georgios Fellouris:
Sequential anomaly detection with observation control under a generalized error metric. 1165-1170 - Georgios Rovatsos, Venugopal V. Veeravalli, George V. Moustakides:
Quickest Detection of a Dynamic Anomaly in a Heterogeneous Sensor Network. 1171-1176 - Mangqing Guo, Mustafa Cenk Gursoy, Pramod K. Varshney:
Sparse Activity Detection in Cell-Free Massive MIMO systems. 1177-1182 - Alex Dytso, H. Vincent Poor, Shlomo Shamai Shitz:
A General Derivative Identity for the Conditional Mean Estimator in Gaussian Noise and Some Applications. 1183-1188 - Xiangxiang Xu, Weida Wang, Shao-Lun Huang:
On the Sample Complexity of Estimating Small Singular Modes. 1189-1194 - Xiao-Wen Chang, Zhilong Chen, Yingzi Xu:
On the Randomized Babai Point. 1195-1200 - Banghua Zhu, Jiantao Jiao, Jacob Steinhardt:
When does the Tukey Median work? 1201-1206 - Prafulla Chandra, Andrew Thangaraj, Nived Rajaraman:
Missing Mass of Markov Chains. 1207-1212 - Kuan-Yun Lee, Thomas A. Courtade:
Linear Models are Most Favorable among Generalized Linear Models. 1213-1218 - Neri Merhav:
Weak-Noise Modulation-Estimation of Vector Parameters. 1219-1223 - Kenneth Chang, Nathaniel Raymondi, Ashutosh Sabharwal, Suhas N. Diggavi:
"Wireless Paint": Code Design for 3D Orientation Estimation with Backscatter Arrays. 1224-1229 - Osman Emre Dai, Daniel Cullina, Negar Kiyavash:
Achievability of nearly-exact alignment for correlated Gaussian databases. 1230-1235 - Elyas Sabeti, Peter X. K. Song, Alfred O. Hero III:
Pattern-Based Analysis of Time Series: Estimation. 1236-1241 - Aolin Xu, Todd Coleman:
Minimax Lower Bounds for Circular Source Localization. 1242-1247 - Meng-Che Chang, Matthieu R. Bloch:
Evasive Active Hypothesis Testing. 1248-1253 - Xi Zhang, Qixuan ZW, H. Vincent Poor:
Sequential Hypothesis Criterion Based Optimal Caching Schemes Over Mobile Wireless Networks. 1254-1258 - Tomer Berg, Or Ordentlich, Ofer Shayevitz:
Binary Hypothesis Testing with Deterministic Finite-Memory Decision Rules. 1259-1264 - Daewon Seo, Ravi Kiran Raman, Lav R. Varshney:
Social Learning with Beliefs in a Parallel Network. 1265-1270 - Charvi Rastogi, Sivaraman Balakrishnan, Nihar B. Shah, Aarti Singh:
Two-Sample Testing on Pairwise Comparison Data and the Role of Modeling Assumptions. 1271-1276 - Dhruva Kartik, Ashutosh Nayyar, Urbashi Mitra:
Testing for Anomalies: Active Strategies and Non-asymptotic Analysis. 1277-1282 - Sreejith Sreekumar, Deniz Gündüz:
Strong Converse for Testing Against Independence over a Noisy channel. 1283-1288 - Abdellatif Zaidi:
Hypothesis Testing Against Independence Under Gaussian Noise. 1289-1294 - Yonglong Li, Vincent Y. F. Tan:
Second-Order Asymptotics of Sequential Hypothesis Testing. 1295-1300 - Mauricio E. Gonzalez, Jorge F. Silva:
Data-Driven Representations for Testing Independence: A Connection with Mutual Information Estimation. 1301-1306 - Min-Oh Jeong, Alex Dytso, Martina Cardone, H. Vincent Poor:
Recovering Structure of Noisy Data through Hypothesis Testing. 1307-1312 - Jiachun Pan, Yonglong Li, Vincent Y. F. Tan, Yonina C. Eldar:
On the Error Exponent of Approximate Sufficient Statistics for M-ary Hypothesis Testing. 1313-1318 - Saurabh Sihag, Ali Tajer:
Approximate Recovery Of Ising Models with Side Information. 1319-1324 - Guy Bresler, Mina Karzand:
Minimax Prediction in Tree Ising Models. 1325-1330 - Yuwen Huang, Pascal O. Vontobel:
Characterizing the Bethe Partition Function of Double-Edge Factor Graphs via Graph Covers. 1331-1336 - Albert Podusenko, Wouter M. Kouw, Bert de Vries:
Online Variational Message Passing in Hierarchical Autoregressive Models. 1337-1342 - Mansi Sood, Osman Yagan:
k-Connectivity in Random Graphs induced by Pairwise Key Predistribution Schemes. 1343-1348 - Krzysztof Turowski, Jithin K. Sreedharan, Wojciech Szpankowski:
Temporal Ordered Clustering in Dynamic Networks. 1349-1354 - Mohammad Esmaeili, Aria Nosratinia:
Community Detection with Secondary Latent Variables. 1355-1360 - Ian Hogeboom-Burr, Serdar Yüksel:
Comparison of Information Structures for Zero-Sum Games in Standard Borel Spaces. 1361-1366 - Ertan Kazikli, Sinan Gezici, Serdar Yüksel:
Quadratic Privacy-Signaling Games and Payoff Dominant Equilibria. 1367-1372 - Pawan Poojary, Randall Berry:
Observational Learning with Fake Agents. 1373-1378 - Anuj S. Vora, Ankur A. Kulkarni:
Achievable Rates for Strategic Communication. 1379-1384 - Junhan Kim, Byonghyo Shim:
Optimal Restricted Isometry Condition for Exact Sparse Recovery with Orthogonal Least Squares. 1385-1390 - Avishek Ghosh, Kannan Ramchandran:
Some Performance Guarantees of Global LASSO with Local Assumptions for Convolutional Sparse Design Matrices. 1391-1396 - Zhongxing Sun, Wei Cui, Yulong Liu:
Quantized Corrupted Sensing with Random Dithering. 1397-1402 - Takashi Takahashi, Yoshiyuki Kabashima:
Macroscopic Analysis of Vector Approximate Message Passing in a Model Mismatch Setting. 1403-1408 - Jeongmin Chae, Song-Nam Hong:
A Novel B-MAP Proxy for Greedy Sparse Signal Recovery Algorithms. 1409-1413 - Thach V. Bui, Mahdi Cheraghchi, Isao Echizen:
Improved non-adaptive algorithms for threshold group testing with a gap. 1414-1419 - Nelvin Tan, Jonathan Scarlett:
Near-Optimal Sparse Adaptive Group Testing. 1420-1425 - Orhan Ocal, Kannan Ramchandran:
Fast Compressive Large-Scale Matrix-Matrix Multiplication Using Product Codes. 1426-1431 - Kuan Hsieh, Ramji Venkataramanan:
Modulated Sparse Regression Codes. 1432-1437 - Parth K. Thaker, Gautam Dasarathy, Angelia Nedic:
On the Sample Complexity and Optimization Landscape for Quadratic Feasibility Problems. 1438-1443 - Yi Qin, Renaud-Alexandre Pitaval:
Structured Quasi-Gray labelling for Reed-Muller Grassmannian Constellations. 1444-1449 - Thuan Nguyen, Thinh Nguyen:
Structure of Optimal Quantizer for Binary-Input Continuous-Output Channels with Output Constraints. 1450-1455 - Nishant Mehrotra, Ashutosh Sabharwal:
DoF Analysis for Multipath-Assisted Imaging: Single Frequency Illumination. 1456-1461 - P. Charantej Reddy, Aditya Siripuram, Brad Osgood:
Some results on convolution idempotents. 1462-1467 - Antonio Bazco Nogueras, Arash Gholami Davoodi, Paul de Kerret, David Gesbert, Nicolas Gresset, Syed Ali Jafar:
DoF Region of the Decentralized MIMO Broadcast Channel - How many informed antennas do we need? 1468-1473 - Siyao Li, Daniela Tuninetti, Natasha Devroye:
The Fading Gaussian Broadcast Channel with Channel State Information and Output Feedback. 1474-1479 - Aditya Narayan Ravi, Sibi Raj B. Pillai, Vinod M. Prabhakaran, Michèle A. Wigger:
When does Partial Noisy Feedback Enlarge the Capacity of a Gaussian Broadcast Channel? 1480-1485 - Mohamed Salman, Mahesh K. Varanasi:
On the Capacity Region of the Three-Receiver Broadcast Channel With Receiver Message Cognition. 1486-1491 - Amin Gohari, Chandra Nair:
New Outer Bounds for the Two-Receiver Broadcast Channel. 1492-1497 - Mohamed Salman, Mahesh K. Varanasi:
Diamond Message Set Groupcasting: From an Achievable Rate Region for the DM Broadcast Channel to the Capacity of the Combination Network. 1498-1503 - Yuzhou Gu, Hajir Roozbehani, Yury Polyanskiy:
Broadcasting on trees near criticality. 1504-1509 - Mohamed Salman, Mahesh K. Varanasi:
On the Broadcast Channel with Non-Distinct Message Demands and Symmetric Side Information. 1510-1515 - Jinyuan Chen:
Multi-layer Interference Alignment and GDoF of the K-User Asymmetric Interference Channel. 1516-1521 - Max H. M. Costa, Chandra Nair, David Ng, Yan Nan Wang:
On the structure of certain non-convex functionals and the Gaussian Z-interference channel. 1522-1527 - Maha Zohdy, Ali Tajer, Shlomo Shamai Shitz:
Interference Management without CSIT: A Broadcast Approach. 1528-1533 - Milad Johnny, Alireza Vahid:
Embedding Information in Radiation Pattern Fluctuations. 1534-1539 - Chandra Nair, Mehdi Yazdanpanah:
On the AND-OR Interference Channel and the Sandglass Conjecture. 1540-1545 - Min Qiu, Yu-Chih Huang, Jinhong Yuan:
On Discrete Signaling and Treating Interference as Noise for Complex Gaussian Interference Channels. 1546-1551 - Fan Li, Jinyuan Chen:
Secure Communications with Limited Common Randomness at Transmitters. 1552-1557 - Yao-Chia Chan, Syed Ali Jafar:
Secure GDoF of the Z-channel with Finite Precision CSIT: How Robust are Structured Codes? 1558-1563 - Viswanathan Ramachandran, Sibi Raj B. Pillai, Vinod M. Prabhakaran:
Strong Coordination with Side Information. 1564-1569 - Touheed Anwar Atif, Arun Padakandla, S. Sandeep Pradhan:
Source Coding for Synthesizing Correlated Randomness. 1570-1575 - Rumia Sultana, Rémi A. Chou:
Explicit Construction of Multiple Access Channel Resolvability Codes from Source Resolvability Codes. 1576-1580 - Shouvik Ganguly, Lele Wang, Young-Han Kim:
A Functional Construction of Codes for Multiple Access and Broadcast Channels. 1581-1586 - Yihan Zhang, Shashank Vatedka, Sidharth Jaggi:
Quadratically Constrained Two-way Adversarial Channels. 1587-1592 - Sarthak Jain, Soheil Mohajer, Martina Cardone:
On the Fraction of Capacity One Relay can Achieve in Gaussian Half-Duplex Diamond Networks. 1593-1598 - Yahya H. Ezzeldin, Martina Cardone, Christina Fragouli, Giuseppe Caire:
Gaussian 1-2-1 Networks with Imperfect Beamforming. 1599-1604 - Jonathan Ponniah, Liang-Liang Xie:
Multi-Cast Channels with Hierarchical Flow. 1605-1610 - Xiaoshen Song, Giuseppe Caire:
Queue-Aware Beam Scheduling for Half-Duplex mmWave Relay Networks. 1611-1616 - Kai Cai, Guangyue Han:
The Langberg-Médard Multiple Unicast Conjecture: Stable 3-Pair Networks. 1617-1622 - Mohammad Ishtiyaq Qureshi, Satyajit Thakor:
On the Partition Bound for Undirected Unicast Network Information Capacity. 1623-1628 - Shenghao Yang, Jie Wang:
Upper Bound Scalability on Achievable Rates of Batched Codes for Line Networks. 1629-1634 - Xuan Guang, Raymond W. Yeung:
Linear Network Error Correction Coding Revisited. 1635-1640 - Kenneth W. Shum, Hanxu Hou:
Network Coding Based on Byte-wise Circular Shift and Integer Addition. 1641-1645 - Hedongliang Liu, Hengjia Wei, Sven Puchinger, Antonia Wachter-Zeh, Moshe Schwartz:
On the Gap between Scalar and Vector Solutions of Generalized Combination Networks. 1646-1651 - Hoover H. F. Yin, Ka Hei Ng, Xishi Wang, Qi Cao, Lucien K. L. Ng:
On the Memory Requirements of Block Interleaver for Batched Network Codes. 1652-1657 - Arno Schneuwly, Derya Malak, Muriel Médard:
Discrete Water Filling Multi-Path Packet Scheduling. 1658-1663 - Nujoom Sageer Karat, Kodi Lakshmi Vijith Bhargav, B. Sundar Rajan:
On the Optimality of Two Decentralized Coded Caching Schemes With and Without Error Correction. 1664-1669 - Sonu Rathi, Anoop Thomas, Monolina Dutta:
An Optimal Linear Error Correcting Scheme for Shared Caching with Small Cache Sizes. 1670-1674 - Emanuele Parrinello, Petros Elia, Eleftherios Lampiris:
Extending the Optimality Range of Multi-Antenna Coded Caching with Shared Caches. 1675-1680 - Aniruddha Phatak, Mahesh K. Varanasi:
Eliminating Pairing Loss for Coded Caching with Three Erasure-Coded Servers. 1681-1686 - Mohamed Salman, Mahesh K. Varanasi:
An Upper Bound on the Capacity-Memory Tradeoff of Interleavable Discrete Memoryless Broadcast Channels with Uncoded Prefetching. 1687-1692 - Hamdi Joudeh, Eleftherios Lampiris, Petros Elia, Giuseppe Caire:
Fundamental Limits of Wireless Caching Under Mixed Cacheable and Uncacheable Traffic. 1693-1698 - Xiang Zhang, Xianfeng Terry Yang, Mingyue Ji:
A New Design Framework on D2D Coded Caching with Optimal Rate and Less Subpacketizations. 1699-1704 - Kai Wan, Hua Sun, Mingyue Ji, Daniela Tuninetti, Giuseppe Caire:
Novel Converse for Device-to-Device Demand-Private Caching with a Trusted Server. 1705-1710 - Pinar Sen, Michael Gastpar, Young-Han Kim:
Successive Refinement to Caching for Dynamic Requests. 1711-1716 - Kai Wan, Hua Sun, Mingyue Ji, Daniela Tuninetti, Giuseppe Caire:
Cache-Aided Scalar Linear Function Retrieval. 1717-1722 - Anjana Ambika Mahesh, Nujoom Sageer Karat, B. Sundar Rajan:
Min-rank of Embedded Index Coding Problems. 1723-1728 - Tang Liu, Daniela Tuninetti:
Secure Decentralized Pliable Index Coding. 1729-1734 - Lawrence Ong, Badri N. Vellambi:
Secure Network and Index Coding Equivalence: The Last Piece of the Puzzle. 1735-1740 - Subhankar Banerjee, Rajarshi Bhattacharjee, Abhishek Sinha:
Fundamental Limits of Age-of-Information in Stationary and Non-stationary Environments. 1741-1746 - Ali Maatouk, Saad Kriouile, Mohamad Assaad, Anthony Ephremides:
Asymptotically Optimal Scheduling Policy For Minimizing The Age of Information. 1747-1752 - Qian Wang, He Chen, Yonghui Li, Branka Vucetic:
Minimizing Age of Information via Hybrid NOMA/OMA. 1753-1758 - Roy D. Yates, Sanjit K. Kaul:
Age of Information in Uncoordinated Unslotted Updating. 1759-1764 - Mohammad Moltafet, Markus Leinonen, Marian Codreanu:
Average Age of Information for a Multi-Source M/M/1 Queueing Model With Packet Management. 1765-1769 - Xingran Chen, Konstantinos Gatsis, Hamed Hassani, Shirin Saeedi Bidokhti:
Age of Information in Random Access Channels. 1770-1775 - Songtao Feng, Jing Yang:
AoI Minimization in Broadcast Channels with Channel State Information. 1776-1781 - Cho-Hsin Tsai, Chih-Chun Wang:
Age-of-Information Revisited: Two-way Delay and Distribution-oblivious Online Algorithm. 1782-1787 - Omur Ozel:
Timely Status Updating Through Intermittent Sensing and Transmission. 1788-1793 - Baturalp Buyukates, Melih Bastopcu, Sennur Ulukus:
Optimal Selective Encoding for Timely Updates with Empty Symbol. 1794-1799 - Melih Bastopcu, Sennur Ulukus:
Partial Updates: Losing Information for Freshness. 1800-1805 - Amir Behrouzi-Far, Emina Soljanin, Roy D. Yates:
Data Freshness in Leader-Based Replicated Storage. 1806-1811 - Ahmed Arafa, Karim Banawan, Karim G. Seddik, H. Vincent Poor:
Timely Estimation Using Coded Quantized Samples. 1812-1817 - Uzi Pereg:
Communication over Quantum Channels with Parameter Estimation. 1818-1823 - Narayanan Rengaswamy, Kaushik P. Seshadreesan, Saikat Guha, Henry D. Pfister:
Quantum Advantage via Qubit Belief Propagation. 1824-1829 - Marco Fanizza, Matteo Rosati, Michalis Skotiniotis, John Calsamiglia, Vittorio Giovannetti:
Performance of Gaussian encodings for classical communication on correlated quantum phase-noise channels. 1830-1834 - Saikat Guha, Quntao Zhuang, Boulat A. Bash:
Infinite-fold enhancement in communications capacity using pre-shared entanglement. 1835-1839 - Kun Wang, Masahito Hayashi:
Permutation Enhances Classical Communication Assisted by Entangled States. 1840-1845 - Dina Abdelhadi, Joseph M. Renes:
Second-order asymptotics of quantum data compression from partially-smoothed conditional entropy. 1846-1851 - Zahra Baghali Khanian, Andreas J. Winter:
General Mixed State Quantum Data Compression with and without Entanglement Assistance. 1852-1857 - Zahra Baghali Khanian, Andreas J. Winter:
Quantum State Redistribution for Ensemble Sources. 1858-1863 - Eyuri Wakakuwa, Yoshifumi Nakata, Min-Hsiu Hsieh:
One-Shot Trade-Off Bounds for State Redistribution of Classical-Quantum Sources. 1864-1869 - Manabu Hagiwara, Ayumu Nakayama:
A Four-Qubits Code that is a Quantum Deletion Error-Correcting Code with the Optimal Length. 1870-1874 - Yingkai Ouyang, Ching-Yi Lai:
Linear programming bounds for quantum amplitude damping codes. 1875-1879 - Alexei Ashikhmin:
Fidelity of Finite Length Quantum Codes in Qubit Erasure Channel. 1880-1885 - Sangjun Lee, Mehdi Mhalla, Valentin Savin:
Trimming Decoding of Color Codes over the Quantum Erasure Channel. 1886-1890 - Narayanan Rengaswamy, A. Robert Calderbank, Michael Newman, Henry D. Pfister:
Classical Coding Problem from Transversal T Gates. 1891-1896 - Sarah Brandsen, Kevin D. Stubbs, Henry D. Pfister:
Reinforcement Learning with Neural Networks for Quantum Multiple Hypothesis Testing. 1897-1902 - Gilad Gour, Mark M. Wilde:
Entropy of a Quantum Channel: Definition, Properties, and Application. 1903-1908 - Navneeth Ramakrishnan, Raban Iten, Volkher B. Scholz, Mario Berta:
Quantum Blahut-Arimoto Algorithms. 1909-1914 - Mark M. Wilde:
Coherent Quantum Channel Discrimination. 1915-1920 - Xavier Coiteux-Roy, Stefan Wolf:
On the Advantage of Irreversible Processes in Single-System Games. 1921-1926 - Yichen Huang:
2D Local Hamiltonian with Area Laws Is QMA-Complete. 1927-1932 - Sarah Brandsen, Mengke Lian, Kevin D. Stubbs, Narayanan Rengaswamy, Henry D. Pfister:
Adaptive Procedures for Discriminating Between Arbitrary Tensor-Product Quantum States. 1933-1938 - Kun Wang, Xin Wang, Mark M. Wilde:
Quantification of Unextendible Entanglement and Its Applications in Entanglement Distillation. 1939-1943 - Omar Amer, Walter O. Krawec:
Finite Key Analysis of the Extended B92 Protocol. 1944-1948 - Farzin Salek, Andreas J. Winter:
Multi-User Distillation of Common Randomness and Entanglement from Quantum States. 1949-1954 - Janis Nötzel, Stephen Diadamo:
Entanglement-Assisted Data Transmission as an Enabling Technology: A Link-Layer Perspective. 1955-1960 - Holger Boche, Gisbert Janßen, Sajad Saeedinaeeni:
Universal superposition codes: capacity regions of compound quantum broadcast channel with confidential messages. 1961-1966 - Hao-Chung Cheng, Nilanjana Datta, Cambyse Rouzé:
Strong Converse Bounds in Quantum Network Information Theory. 1967-1972 - Yuuya Yoshida, Masahito Hayashi:
Classical Mechanism is Optimal in Classical-Quantum Differentially Private Mechanisms. 1973-1977 - Walter O. Krawec:
A New High-Dimensional Quantum Entropic Uncertainty Relation with Applications. 1978-1983 - Eric P. Hanson, Vishal Katariya, Nilanjana Datta, Mark M. Wilde:
Guesswork with Quantum Side Information: Optimal Strategies and Aspects of Security. 1984-1989 - Holger Boche, Minglai Cai, Moritz Wiese, Christian Deppe, Roberto Ferrara:
Semantic Security for Quantum Wiretap Channels. 1990-1995 - Arkin Tikku, Joseph M. Renes, Mario Berta:
Additivity in Classical-Quantum Wiretap Channels. 1996-2001 - V Arvind Rameshwar, Navin Kashyap:
Computable Lower Bounds for Capacities of Input-Driven Finite-State Channels. 2002-2007 - Holger Boche, Rafael F. Schaefer, H. Vincent Poor:
On the Algorithmic Computability of Achievability and Converse: ϵ-Capacity of Compound Channels and Asymptotic Bounds of Error-Correcting Codes. 2008-2013 - Ziv Aharoni, Dor Tsur, Ziv Goldfeld, Haim H. Permuter:
Capacity of Continuous Channels with Memory via Directed Information Neural Estimator. 2014-2019 - Holger Boche, Christian Deppe:
Computability of the Zero-Error Capacity with Kolmogorov Oracle. 2020-2025 - Anuran Makur:
Bounds on Permutation Channel Capacity. 2026-2031 - Antonino Favano, Marco Ferrari, Maurizio Magarini, Luca Barletta:
Capacity Bounds for Amplitude-Constrained AWGN MIMO Channels with Fading. 2032-2037 - Sourjya Dutta, Abbas Khalili, Elza Erkip, Sundeep Rangan:
Capacity Bounds for Communication Systems with Quantization and Spectral Constraints. 2038-2043 - Heedong Do, Namyoon Lee, Angel Lozano:
Capacity of Line-of-Sight MIMO Channels. 2044-2048 - Yong Jin Daniel Kim, Yi Feng:
Capacity of Multicarrier Faster-than-Nyquist Signaling. 2049-2054 - Song Fang, Quanyan Zhu:
A Connection between Feedback Capacity and Kalman Filter for Colored Gaussian Noises. 2055-2060 - Christian Deppe, Georg Maringer, Vladimir S. Lebedev:
Bounds for the capacity error function for unidirectional channels with noiseless feedback. 2061-2066 - Yonatan Urman, David Burshtein:
Feedback Channel Communication with Low Precision Arithmetic. 2067-2072 - Christos K. Kourtellaris, Charalambos D. Charalambous, Sergey Loyka:
New Formulas of Ergodic Feedback Capacity of AGN Channels Driven by Stable and Unstable Autoregressive Noise. 2073-2078 - Nancy Ronquillo, Tara Javidi:
Measurement Dependent Noisy Search with Stochastic Coefficients. 2079-2084 - Achilleas Anastasopoulos, S. Sandeep Pradhan:
Decentralized sequential active hypothesis testing and the MAC feedback capacity. 2085-2090 - Christos K. Kourtellaris, Charalambos D. Charalambous, Sergey Loyka:
From Feedback Capacity to Tight Achievable Rates without Feedback for AGN Channels with Stable and Unstable Autoregressive Noise. 2091-2096 - Uzi Pereg, Yossef Steinberg:
The Arbitrarily Varying Channel with Colored Gaussian Noise. 2097-2102 - Amitalok J. Budkuley, Bikash Kumar Dey, Sidharth Jaggi, Michael Langberg, Anand D. Sarwate, Carol Wang:
Symmetrizability for Myopic AVCs. 2103-2107 - Amir Saberi, Farhad Farokhi, Girish N. Nair:
An Explicit Formula for the Zero-Error Feedback Capacity of a Class of Finite-State Additive Noise Channels. 2108-2113 - Yonglong Li, Vincent Y. F. Tan:
On the Capacity of Deletion Channels with States. 2114-2119 - Eli Shemuel, Oron Sabag, Haim H. Permuter:
Feedback Capacity of Finite-State Channels with Causal State Known at the Encoder. 2120-2125 - Yasutada Oohama:
Strong Converse for the State Dependent Channel. 2126-2130 - Ling-Hua Chang, Po-Ning Chen, Fady Alajaji, Yunghsiang S. Han:
The Asymptotic Generalized Poor-Verdú Bound Achieves the BSC Error Exponent at Zero Rate. 2131-2136 - Sergey Tridenski, Anelia Somekh-Baruch, Ram Zamir:
Proof of Convergence for Correct-Decoding Exponent Computation. 2137-2142 - Marco Bondaschi, Marco Dalai:
Revisiting Zero-Rate Bounds on the Reliability Function of Discrete Memoryless Channels. 2143-2148 - Hao-Chung Cheng, Baris Nakiboglu:
Refined Strong Converse for the Constant Composition Codes. 2149-2154 - Yuta Sakai, Vincent Y. F. Tan:
Variable-Length Source Dispersions Differ under Maximum and Average Error Criteria. 2155-2160 - Hengjie Yang, Richard D. Wesel:
Finite-Blocklength Performance of Sequential Transmission over BSC with Noiseless Feedback. 2161-2166 - Lin Zhou, Alfred O. Hero III:
Resolution Limits of Non-Adaptive Querying for Noisy 20 Questions Estimation. 2167-2172 - Amaael Antonini, Hengjie Yang, Richard D. Wesel:
Low Complexity Algorithms for Transmission of Short Blocks over the BSC with Full Feedback. 2173-2178 - Lampros Gavalakis, Ioannis Kontoyiannis:
Lossless Data Compression with Side Information: Nonasymptotics and Dispersion. 2179-2183 - Neri Merhav:
Noisy Guesses. 2184-2188 - Robert Graczyk, Amos Lapidoth:
Gray-Wyner and Slepian-Wolf Guessing. 2189-2193 - Suayb S. Arslan, Elif Haytaoglu:
Cost of Guessing: Applications to Data Repair. 2194-2198 - Yanjun Han:
Constrained Functional Value under General Convexity Conditions with Applications to Distributed Simulation. 2199-2204 - Leighton Pate Barnes, Ayfer Özgür:
The Courtade-Kumar Most Informative Boolean Function Conjecture and a Symmetrized Li-Médard Conjecture are Equivalent. 2205-2209 - Yikun Bai, Xiugang Wu, Ayfer Özgür:
Information Constrained Optimal Transport: From Talagrand, to Marton, to Cover. 2210-2215 - Wei Cao, Alex Dytso, Michael Fauß, H. Vincent Poor, Gang Feng:
On Nonparametric Estimation of the Fisher Information. 2216-2221 - Benjamin Wu, Aaron B. Wagner, G. Edward Suh, Ibrahim Issa:
Strong Asymptotic Composition Theorems for Sibson Mutual Information. 2222-2227 - Baran Tan Bacinoglu, Yin Sun, Elif Uysal:
On the Trackability of Stochastic Processes Based on Causal Information. 2228-2233 - Salman Salamatian, Asaf Cohen, Muriel Médard:
Approximate Gács-Körner Common Information. 2234-2239 - Mohammad-Amin Charusaie, Stefano Rini, Arash Amini:
On the Compressibility of Affinely Singular Random Vectors. 2240-2245 - Aolin Xu:
Continuity of Generalized Entropy. 2246-2251 - Shao-Lun Huang, Xiangxiang Xu, Lizhong Zheng, Gregory W. Wornell:
A Local Characterization for Wyner Common Information. 2252-2257 - Matthieu Fradelizi, Jiange Li, Mokshay Madiman:
Usable deviation bounds for the information content of convex measures. 2258-2263 - Maciej Obremski, Maciej Skorski:
Complexity of Estimating Rényi Entropy of Markov Chains. 2264-2269 - Mohammad A. Alhejji, Graeme Smith:
A Tight Uniform Continuity Bound for Equivocation. 2270-2274 - Valérie Girardin, Philippe Regnault:
Rényi Divergence rates of Ergodic Markov Chains: existence, explicit expressions and properties. 2275-2279 - Yuta Sakai, Vincent Y. F. Tan:
On the Second- and Third-Order Asymptotics of Smooth Rényi Entropy and Their Applications. 2280-2285 - Ryo Nomura, Hideki Yagi:
Optimum Source Resolvability Rate with Respect to f-Divergences Using the Smooth Rényi Entropy. 2286-2291 - James Melbourne, Tomasz Tkocz:
On the Rényi Entropy of Log-Concave Sequences. 2292-2296 - Christoph Hirche:
Rényi Bounds on Information Combining. 2297-2302 - Joachim Breitner, Maciej Skorski:
Explicit Renyi Entropy for Hidden Markov Models. 2303-2308 - Youssef Jaffal, Ibrahim C. Abou-Faycal:
Lossy coding of a time-limited piece of a band-limited white Gaussian source. 2309-2313 - Chao Qi, Tobias Koch:
A High-SNR Normal Approximation for MIMO Rayleigh Block-Fading Channels. 2314-2319 - Ravi Kiran Raman, Lav R. Varshney:
Registration of Finite Resolution Images: a Second-order Analysis. 2320-2325 - Deekshith P. K., Vinod Sharma:
Second-Order Achievable Rates for a Block Fading Gaussian Multiple Access Channel. 2326-2331 - Shun Watanabe, Te Sun Han:
Isomorphism Problem Revisited: Information Spectrum Approach. 2332-2336 - Qinghua Devon Ding, Sidharth Jaggi, Shashank Vatedka, Yihan Zhang:
Empirical Properties of Good Channel Codes. 2337-2342 - Neri Merhav, Igal Sason:
Exact Expressions in Source and Channel Coding Problems Using Integral Representations. 2343-2348 - Payam Delgosha, Venkat Anantharam:
A Universal Low Complexity Compression Algorithm for Sparse Marked Graphs. 2349-2354 - Ryusei Fujita, Ken-ichi Iwata, Hirosuke Yamamoto:
On a Redundancy of AIFV-m Codes for m =3, 5. 2355-2359 - Hirosuke Yamamoto, Koki Imaeda, Kengo Hashimoto, Ken-ichi Iwata:
A Universal Data Compression Scheme based on the AIVF Coding Techniques. 2360-2364 - Ferdinando Cicalese, Eros Rossi:
On D-ary Fano Codes. 2365-2370 - Shashank Vatedka, Venkat Chandar, Aslan Tchamkerten:
O (log log n) Worst-Case Local Decoding and Update Efficiency for Data Compression. 2371-2376 - Hao Lou, Farzad Farnoud:
Data Deduplication with Random Substitutions. 2377-2382 - Christoph Hirche, Andreas J. Winter:
An Alphabet-Size Bound for the Information Bottleneck Function. 2383-2388 - Nir Elkayam, Meir Feder:
One shot approach to lossy source coding under average distortion constraints. 2389-2393 - Cheuk Ting Li:
Asymptotically Scale-invariant Multi-resolution Quantization. 2394-2398 - Kazuho Watanabe:
Discrete Optimal Reconstruction Distributions for Itakura-Saito Distortion Measure. 2399-2404 - Shraga I. Bross:
Scalable Source Coding With Causal Side Information and a Causal Helper. 2405-2409 - Emrah Akyol, Urbashi Mitra, Ertem Tuncel, Kenneth Rose:
Improved Achievable Regions in Networked Scalable Coding Problems. 2410-2415 - Chandra Nair, Yan Nan Wang:
On optimal weighted-sum rates for the modulo sum problem. 2416-2420 - Pierre Escamilla, Abdellatif Zaidi, Michèle A. Wigger:
Some Results on the Vector Gaussian Hypothesis Testing Problem. 2421-2425 - Sourya Basu, Daewon Seo, Lav R. Varshney:
Hypergraph-based Coding Schemes for Two Source Coding Problems under Maximal Distortion. 2426-2431 - Omer Bilgen, Aaron B. Wagner:
Gaussian Multiterminal Source-Coding with Markovity: An Efficiently-Computable Outer Bound. 2432-2437 - Victoria Kostina, Babak Hassibi:
Fundamental limits of distributed tracking. 2438-2443 - Charalambos D. Charalambous, Jan H. van Schuppen:
Characterization of Conditional Independence and Weak Realizations of Multivariate Gaussian Random Variables: Applications to Networks. 2444-2449 - Ahmed Elshafiy, Mahmoud Namazi, Kenneth Rose:
On Effective Stochastic Mechanisms for On-The-Fly Codebook Regeneration. 2450-2455 - Nian Guo, Victoria Kostina:
Optimal Causal Rate-Constrained Sampling for a Class of Continuous Markov Processes. 2456-2461 - Rooji Jinan, Parimal Parag, Himanshu Tyagi:
Tracking an Auto-Regressive Process with Limited Communication. 2462-2467 - Jian-Jia Weng, Fady Alajaji, Tamás Linder:
Adaptive Coding for Two-Way Lossy Source-Channel Communication. 2468-2473 - Mohammadamin Baniasadi, Ertem Tuncel:
Robust Gaussian Joint Source-Channel Coding Under the Near-Zero Bandwidth Regime. 2474-2479 - Qiaosheng Eric Zhang, Vincent Y. F. Tan, Changho Suh:
Achievability Bounds for Community Detection and Matrix Completion with Two-Sided Graph Side-Information. 2480-2485 - Adarsh Bank, Jean Honorio:
Provable Efficient Skeleton Learning of Encodable Discrete Bayes Nets in Poly-Time and Sample Complexity. 2486-2491 - Kasper Green Larsen, Michael Mitzenmacher, Charalampos E. Tsourakakis:
Optimal Learning of Joint Alignments with a Faulty Oracle. 2492-2497 - Heasung Kim, Taehyun Cho, Jungwoo Lee, Wonjae Shin, H. Vincent Poor:
An Efficient Neural Network Architecture for Rate Maximization in Energy Harvesting Downlink Channels. 2498-2503 - Patrick Murer, Hans-Andrea Loeliger:
Online Memorization of Random Firing Sequences by a Recurrent Neural Network. 2504-2509 - Shota Saito, Toshiyasu Matsushima:
Evaluation of Error Probability of Classification Based on the Analysis of the Bayes Code. 2510-2514 - Hossein Taheri, Ramtin Pedarsani, Christos Thrampoulidis:
Optimality of Least-squares for Classification in Gaussian-Mixture Models. 2515-2520 - Jaewoong Cho, Gyeongjo Hwang, Changho Suh:
A Fair Classifier Using Mutual Information. 2521-2526 - Ganesh Ramachandra Kini, Christos Thrampoulidis:
Analytic Study of Double Descent in Binary Classification: The Impact of Loss. 2527-2532 - Hung-Wei Hsu, I-Hsiang Wang:
On Binary Statistical Classification from Mismatched Empirically Observed Statistics. 2533-2538 - Avishek Ghosh, Raj Kumar Maity, Arya Mazumdar, Kannan Ramchandran:
Communication Efficient Distributed Approximate Newton Method. 2539-2544 - Avishek Ghosh, Raj Kumar Maity, Swanand Kadhe, Arya Mazumdar, Kannan Ramchandran:
Communication Efficient and Byzantine Tolerant Distributed Learning. 2545-2550 - Daesung Kim, Hye Won Chung:
Crowdsourced Classification with XOR Queries: An Algorithm with Optimal Sample Complexity. 2551-2555 - Venkata Gandikota, Arya Mazumdar, Ankit Singh Rawat:
Reliable Distributed Clustering with Redundant Data Assignment. 2556-2561 - Puning Zhao, Lifeng Lai:
Analysis of K Nearest Neighbor KL Divergence Estimation for Continuous Distributions. 2562-2567 - Changlong Wu, Narayana Santhanam:
Entropy property testing with finitely many errors. 2568-2573 - Sudeep Kamath, Alon Orlitsky, Venkatadheeraj Pichapati, Ehsan Zobeidi:
On Learning Parametric Non-Smooth Continuous Distributions. 2574-2579 - Md Mahmudul Hasan, Shuangqing Wei, Ali Moharrer:
Latent Factor Analysis of Gaussian Distributions under Graphical Constraints. 2580-2585 - Nir Weinberger:
Learning Additive Noise Channels: Generalization Bounds and Algorithms. 2586-2591 - Tan Li, Linqi Song, Christina Fragouli:
Federated Recommendation System via Differential Privacy. 2592-2597 - Mohammad Mohammadi Amiri, Deniz Gündüz, Sanjeev R. Kulkarni, H. Vincent Poor:
Update Aware Device Scheduling for Federated Learning at the Wireless Edge. 2598-2603 - Mohamed Seif, Ravi Tandon, Ming Li:
Wireless Federated Learning with Local Differential Privacy. 2604-2609 - Nir Shlezinger, Stefano Rini, Yonina C. Eldar:
The Communication-Aware Clustered Federated Learning Problem. 2610-2615 - Saurav Prakash, Amirhossein Reisizadeh, Ramtin Pedarsani, Amir Salman Avestimehr:
Hierarchical Coded Gradient Aggregation for Learning at the Edge. 2616-2621 - Neophytos Charalambides, Hessam Mahdavifar, Alfred O. Hero III:
Numerically Stable Binary Gradient Coding. 2622-2627 - Deepesh Data, Suhas N. Diggavi:
On Byzantine-Resilient High-Dimensional Stochastic Gradient Descent. 2628-2633 - Swanand Kadhe, Onur Ozan Koyluoglu, Kannan Ramchandran:
Communication-Efficient Gradient Coding for Straggler Mitigation in Distributed Learning. 2634-2639 - Ziv Goldfeld, Kengo Kato:
Limit Distributions for Smooth Total Variation and χ2-Divergence in High Dimensions. 2640-2645 - Clément Luneau, Nicolas Macris, Jean Barbier:
High-dimensional rank-one nonsymmetric matrix decomposition: the spherical case. 2646-2651 - Adel Javanmard, Hamid Nazerzadeh, Simeng Shao:
Multi-Product Dynamic Pricing in High-Dimensions with Heterogeneous Price Sensitivity. 2652-2657 - Prathamesh Mayekar, Himanshu Tyagi:
Limits on Gradient Compression for Stochastic Optimization. 2658-2663 - Abram Magner, Mayank Baranwal, Alfred O. Hero III:
The Power of Graph Convolutional Networks to Distinguish Random Graph Models. 2664-2669 - Collin Cademartori, Cynthia Rush:
Exponentially Fast Concentration of Vector Approximate Message Passing to its State Evolution. 2670-2675 - Ismail Senöz, Bert de Vries:
Online Message Passing-based Inference in the Hierarchical Gaussian Filter. 2676-2681 - Nir Shlezinger, Nariman Farsad, Yonina C. Eldar, Andrea J. Goldsmith:
Data-Driven Factor Graphs for Deep Symbol Detection. 2682-2687 - Netanel Raviv, Siddharth Jain, Pulakesh Upadhyaya, Jehoshua Bruck, Anxiao Andrew Jiang:
CodNN - Robust Neural Networks From Coded Classification. 2688-2693 - Kunping Huang, Paul H. Siegel, Anxiao Andrew Jiang:
Functional Error Correction for Reliable Neural Networks. 2694-2699 - Tyler Sypherd, Mario Díaz, Lalitha Sankar, Gautam Dasarathy:
On the α-loss Landscape in the Logistic Model. 2700-2705 - Avishek Ghosh, Ashwin Pananjady, Aditya Guntuboyina, Kannan Ramchandran:
Max-affine regression with universal parameter estimation for small-ball designs. 2706-2710 - Wael Alghamdi, Shahab Asoodeh, Hao Wang, Flávio P. Calmon, Dennis Wei, Karthikeyan Natesan Ramamurthy:
Model Projection: Theory and Applications to Fair Machine Learning. 2711-2716 - Anuran Makur, Gregory W. Wornell, Lizhong Zheng:
On Estimation of Modal Decompositions. 2717-2722 - Amedeo Roberto Esposito, Michael Gastpar, Ibrahim Issa:
Robust Generalization via f-Mutual Information. 2723-2728 - Ali Lotfi-Rezaabad, Sriram Vishwanath:
Learning Representations by Maximizing Mutual Information in Variational Autoencoders. 2729-2734 - Toshiaki Koike-Akino, Ye Wang:
Stochastic Bottleneck: Rateless Auto-Encoder for Flexible Dimensionality Reduction. 2735-2740 - Fredrik Hellström, Giuseppe Durisi:
Generalization Error Bounds via mth Central Moments of the Information Density. 2741-2746 - Shiyu Liu, Mehul Motani:
Exploring Unique Relevance for Mutual Information based Feature Selection. 2747-2752 - Azadeh Khaleghi, Daniil Ryabko:
Clustering piecewise stationary processes. 2753-2758 - Wenjing Chen, Ruida Zhou, Chao Tian, Cong Shen:
On Top-k Selection from m-wise Partial Rankings via Borda Counting. 2759-2764 - Elisabetta Cornacchia, Neta Singer, Emmanuel Abbe:
Polarization in Attraction-Repulsion Models. 2765-2770 - Jean Barbier, Galen Reeves:
Information-theoretic limits of a multiview low-rank symmetric spiked matrix model. 2771-2776 - Vrettos Moulos:
A Hoeffding Inequality for Finite State Markov Chains and its Applications to Markovian Bandits. 2777-2782 - Cem Kalkanli, Ayfer Özgür:
An Improved Regret Bound for Thompson Sampling in the Gaussian Linear Bandit Setting. 2783-2788 - Salman Habib, Allison Beemer, Jörg Kliewer:
Learned Scheduling of LDPC Decoders Based on Multi-armed Bandits. 2789-2794 - P. N. Karthik, Rajesh Sundaresan:
Detecting an Odd Restless Markov Arm with a Trembling Hand. 2795-2800 - Shubhanshu Shekhar, Mohammad Ghavamzadeh, Tara Javidi:
Active Learning for Classification with Abstention. 2801-2806 - Vahid Jamali, Antonia M. Tulino, Jaime Llorca, Elza Erkip:
Rényi Entropy Bounds on the Active Learning Cost-Performance Tradeoff. 2807-2812 - Sajjad Bahrami, Ertem Tuncel:
An Efficient Running Quantile Estimation Technique alongside Correntropy for Outlier Rejection in Online Regression. 2813-2818 - Xuetong Wu, Jonathan H. Manton, Uwe Aickelin, Jingge Zhu:
Information-theoretic analysis for transfer learning. 2819-2824 - Netanel Raviv, Siddharth Jain, Jehoshua Bruck:
What is the Value of Data? on Mathematical Methods for Data Quality Estimation. 2825-2830 - Zhengrui Li, Sian-Jheng Lin, Yunghsiang S. Han:
On the Exact Lower Bounds of Encoding Circuit Sizes of Hamming Codes and Hadamard Codes. 2831-2836 - David Gamarnik, Eren C. Kizildag:
Computing the Partition Function of the Sherrington-Kirkpatrick Model is Hard on Average. 2837-2842 - Saeid Sahraei, Mohammad Ali Maddah-Ali, Salman Avestimehr:
Interactive Verifiable Polynomial Evaluation. 2843-2848 - Vignesh Subramanian, Moses Won, Gireeja Ranade:
Learning a Neural-Network Controller for a Multiplicative Observation Noise System. 2849-2854 - Oron Sabag, Victoria Kostina, Babak Hassibi:
Stabilizing Dynamical Systems with Fixed-Rate Feedback using Constrained Quantizers. 2855-2860 - Ghassen Zafzouf, Girish N. Nair:
Distributed State Estimation with Bounded Errors over Multiple Access Channels. 2861-2866 - Charalambos D. Charalambous, Themistoklis Charalambous, Christos K. Kourtellaris, Jan H. van Schuppen:
Structural Properties of Nonanticipatory Epsilon Entropy of Multivariate Gaussian Sources. 2867-2872 - Mark Sinzger, Maximilian Gehri, Heinz Koeppl:
Poisson channel with binary Markov input and average sojourn time constraint. 2873-2878 - Praveen Venkatesh, Sanghamitra Dutta, Pulkit Grover:
How else can we define Information Flow in Neural Circuits? 2879-2884 - Andreas Lenz, Yi Liu, Cyrus Rashtchian, Paul H. Siegel, Antonia Wachter-Zeh, Eitan Yaakobi:
Coding for Efficient DNA Synthesis. 2885-2890 - Anshoo Tandon, Vincent Y. F. Tan, Lav R. Varshney:
Bee-Identification Error Exponent with Absentee Bees. 2891-2896 - Yeow Meng Chee, Johan Chrisnata, Tuvi Etzion, Han Mao Kiah:
Efficient Algorithm for the Linear Complexity of Sequences and Some Related Consequences. 2897-2902 - Nikita Polyanskii, Ilya Vorobyev:
Duplication with transposition distance to the root for q-ary strings. 2903-2908 - Ming Li, Yupeng Jiang, Dongdai Lin:
The Numbers of De Bruijn Sequences in Extremal Weight Classes. 2909-2914 - Minghui Yang, Lulu Zhang, Keqin Feng:
On the 2-Adic Complexity of A Class of Binary Sequences of Period 4p with Optimal Autocorrelation Magnitude. 2915-2920 - Dan Zhang, Tor Helleseth:
New Optimal Sets of Perfect Polyphase Sequences Based on Circular Florentine Arrays. 2921-2925 - Zilong Liu, Ping Yang, Yong Liang Guan, Pei Xiao:
Cross Z-Complementary Pairs (CZCPs) for Optimal Training in Broadband Spatial Modulation Systems. 2926-2930 - Cheng-Yu Pai, Chao-Yu Chen:
Constructions of Two-Dimensional Golay Complementary Array Pairs Based on Generalized Boolean Functions*. 2931-2935 - Hamdi Joudeh, Giuseppe Caire:
Optimality of Treating Inter-Cell Interference as Noise Under Finite Precision CSIT. 2936-2941 - Roya Gholami, Laura Cottatellucci, Dirk T. M. Slock:
Channel Models, Favorable Propagation and MultiStage Linear Detection in Cell-Free Massive MIMO. 2942-2947 - Guido Carlo Ferrante:
Approaching Capacity Without Pilots via Nonlinear Processing at the Edge. 2948-2952 - Abbas Khalili, Shahram Shahsavari, Mohammad Ali Amir Khojastepour, Elza Erkip:
On Optimal Multi-user Beam Alignment in Millimeter Wave Wireless Systems. 2953-2958 - Grace Villacrés, Tobias Koch, Gonzalo Vazquez-Vilar:
Bursty Wireless Networks of Bounded Capacity. 2959-2964 - Roy Karasik, Osvaldo Simeone, Marco Di Renzo, Shlomo Shamai Shitz:
Beyond Max-SNR: Joint Encoding for Reconfigurable Intelligent Surfaces. 2965-2970 - Qurrat-Ul-Ain Nadeem, Anas Chaaban, Mérouane Debbah:
Reconfigurable Surface Assisted Multi-User Opportunistic Beamforming. 2971-2976 - Shuowen Zhang, Rui Zhang:
On the Capacity of Intelligent Reflecting Surface Aided MIMO Communication. 2977-2982 - Hang Liu, Xiaojun Yuan, Ying-Jun Angela Zhang:
Message-Passing Based Channel Estimation for Reconfigurable Intelligent Surface Assisted MIMO. 2983-2988 - Justin Singh Kang, Wei Yu:
Minimum Feedback for Collision-Free Scheduling in Massive Random Access. 2989-2994 - Vamsi K. Amalladinne, Asit Kumar Pradhan, Cynthia Rush, Jean-François Chamberland, Krishna R. Narayanan:
On Approximate Message Passing for Unsourced Access with Coded Compressed Sensing. 2995-3000 - Alexander Fengler, Peter Jung, Giuseppe Caire:
Unsourced Multiuser Sparse Regression Codes achieve the Symmetric MAC Capacity. 3001-3006 - Tugcan Aktas, Pinar Sen:
Interleaved Block Coding for Achieving Gaussian Random Access Channel Capacity. 3007-3012 - Recep Can Yavas, Victoria Kostina, Michelle Effros:
Gaussian Multiple and Random Access in the Finite Blocklength Regime. 3013-3018 - Kirill Andreev, Evgeny Marshakov, Alexey A. Frolov:
A Polar Code Based TIN-SIC Scheme for the Unsourced Random Access in the Quasi-Static Fading MAC. 3019-3024 - Jithin Ravi, Tobias Koch:
Capacity per Unit-Energy of Gaussian Random Many-Access Channels. 3025-3030 - Sang-Woon Jeon, Hu Jin:
Online Estimation and Adaptation for Random Access with Successive Interference Cancellation. 3031-3036 - Sergey Loyka:
On The Capacity of Gaussian MIMO Channels Under Interference Constraints. 3037-3042 - Benjamin M. Zaidel, Ori Shental, Shlomo Shamai Shitz:
Bounding the Achievable Region of Sparse NOMA. 3043-3048 - Hossein Asgharimoghaddam, Antti Tölli:
Resource Allocation in Low Density Spreading Uplink NOMA via Asymptotic Analysis. 3049-3054 - Mohannad Shehadeh, Frank R. Kschischang:
Rate-Diversity Optimal Multiblock Space-Time Codes via Sum-Rank Codes. 3055-3060 - Nima Tavangaran, Mojtaba Vaezi, H. Vincent Poor:
On MIMO Gaussian Wiretap Channels with Optimal Energy Harvesting. 3061-3066 - Ioannis Krikidis:
Information-Energy Capacity Region for SWIPT Systems with Power Amplifier Nonlinearity. 3067-3072
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-01-28 00:24 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
