:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Borah, Rimpi, Harshan, J., Sharma, Aaditya
Format:	Preprint
Published:	2026
Subjects:	Information Theory
Online Access:	https://arxiv.org/abs/2601.18661
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Robust Analog Lagrange Coded Computing: Theory and Algorithms via Discrete Fourier Transforms
by: Borah, Rimpi, et al.
Published: (2025)

On Securing Analog Lagrange Coded Computing from Colluding Adversaries
by: Borah, Rimpi, et al.
Published: (2024)

On Securing Berrut Approximated Coded Computing Through Discrete Cosine Transforms
by: Borah, Rimpi, et al.
Published: (2025)

Basis-Spline Assisted Coded Computing: Strategies and Error Bounds
by: Borah, Rimpi, et al.
Published: (2026)

On Spatial-Provenance Recovery in Wireless Networks with Relaxed-Privacy Constraints
by: Bansal, Manish, et al.
Published: (2025)

On Scaling LT-Coded Blockchains in Heterogeneous Networks and their Vulnerabilities to DoS Threats
by: K., Harikrishnan, et al.
Published: (2024)

On Learning Spatial Provenance in Privacy-Constrained Wireless Networks
by: Bansal, Manish, et al.
Published: (2024)

Cooperative Mitigation against Learning-Based Reactive Jammers: Analysis and SDR Validation
by: Hazra, Soumita, et al.
Published: (2026)

Helper-Friendly Latency-Bounded Mitigation Strategies against Reactive Jamming Adversaries
by: Hazra, Soumita, et al.
Published: (2025)

Network-Centric Countermeasures Against Integrated Sensing Enabled Jamming Adversaries
by: Hazra, Soumita, et al.
Published: (2025)

FORTA: Byzantine-Resilient FL Aggregation via DFT-Guided Krum
by: Shahul, Usayd, et al.
Published: (2025)

Linear Network Coding for Robust Function Computation and Its Applications in Distributed Computing
by: Wei, Hengjia, et al.
Published: (2024)

Tighter Confidence Intervals under Without Replacement Sampling via Empirical Rate Functions
by: Shekhar, Shubhanshu, et al.
Published: (2026)

Nonparametric Two-Sample Testing by Betting
by: Shekhar, Shubhanshu, et al.
Published: (2021)

Quantum Low-Density Parity-Check Codes
by: Vasic, Bane, et al.
Published: (2025)

Coding-Enforced Robust Secure Aggregation for Federated Learning Under Unreliable Communication
by: Weng, Shudi, et al.
Published: (2025)

List Privacy Under Function Recoverability
by: Nageswaran, Ajaykrishnan, et al.
Published: (2023)

Rate-Optimal Streaming Codes Under an Extended Delay Profile for Three-Node Relay Networks With Burst Erasures
by: Li, Zhipeng, et al.
Published: (2025)

On Homomorphic Encryption Based Strategies for Class Imbalance in Federated Learning
by: Guleria, Arpit, et al.
Published: (2024)

$t$-Balanced Codes with the Kendall-$τ$ Metric
by: Jany, Benjamin, et al.
Published: (2024)

Adaptive Privacy of Sequential Data Releases Under Collusion
by: Taylor, Sophie, et al.
Published: (2026)

A complete characterization of testable hypotheses
by: Larsson, Martin, et al.
Published: (2026)

Differentially Private Spectral Graph Clustering: Balancing Privacy, Accuracy, and Efficiency
by: Koskela, Antti, et al.
Published: (2025)

On the Height Profile of Analog Error-Correcting Codes
by: Roth, Ron M., et al.
Published: (2026)

Cache-Aided Variable-Length Coding with Perfect Privacy
by: Zamani, Amirreza, et al.
Published: (2023)

Decoding Balanced Linear Codes With Preprocessing
by: Bogdanov, Andrej, et al.
Published: (2025)

A unified recipe for deriving (time-uniform) PAC-Bayes bounds
by: Chugg, Ben, et al.
Published: (2023)

On the existence of powerful p-values and e-values for composite hypotheses
by: Zhang, Zhenyuan, et al.
Published: (2023)

A Note on the Theoretical Support to Compute Dimension in Abelian Codes
by: Bernal, J. J., et al.
Published: (2025)

Time-Uniform Confidence Spheres for Means of Random Vectors
by: Chugg, Ben, et al.
Published: (2023)

Secure Coded Distributed Computing
by: Sasi, Shanuja, et al.
Published: (2024)

On the Maximum Size of Codes Under the Damerau-Levenshtein Metric
by: Ye, Zuo, et al.
Published: (2025)

Hierarchical Gradient Coding: From Optimal Design to Privacy at Intermediate Nodes
by: Gholami, Ali, et al.
Published: (2025)

Universal Sequential Changepoint Detection of Quantum Observables via Classical Shadows
by: Zecchin, Matteo, et al.
Published: (2026)

Privacy-aware Berrut Approximated Coded Computing for Federated Learning
by: Luaña, Xavier Martínez, et al.
Published: (2024)

Balancing Privacy and Utility in Correlated Data: A Study of Bayesian Differential Privacy
by: Lange, Martin, et al.
Published: (2025)

Robust Privatization with Multiple Tasks and the Optimal Privacy-Utility Tradeoff
by: Liu, Ta-Yuan, et al.
Published: (2020)

On Distributionally Robust Lossy Source Coding
by: Serra, Giuseppe, et al.
Published: (2025)

Improved Construction of Robust Gray Code
by: Fathollahi, Dorsa, et al.
Published: (2024)

A Short Proof of Coding Theorems for Reed-Muller Codes Under a Mild Assumption
by: Ma, Xiao
Published: (2025)