Channel-Aware Selection of Folded Bloom Filters for Distributed Systems

arXiv:2609.14458 · cs.IT, cs.CR, cs.NI, math.IT · Submitted 2026-09-13 · Read on arXiv

cs.IT, cs.CR, cs.NI, math.IT

Submitted: 2026-09-13

Updated: 2026-09-13

Comments: 7 pages, 5 figures. Accepted for presentation at the 2026 IEEE International Conference on Internet of Things and Intelligence System (IoTaIS 2026)

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Terminology

• Fidelity — 1× in this paper · explained in 2 episodes

Related papers

• Clipped Affine Policy: Low-Complexity Near-Optimal Online Power Control for Energy Harvesting Communications over Fading Channels
• Discrepancy for Random Linear Codes
• A New Approach to Code Smoothing Bounds
• Contextual Memory-Enhanced Source Coding for Low-SNR Communications
• Symmetry-Enforced Quadratic Approximate-Degradability Bounds for Noisy Landau-Streater Channels
• Anonymous Shamir's Secret Sharing via Reed-Solomon Codes Against Permutations, Insertions, and Deletions