Concurrent Coded Signal-Multiplexing Ranging for Half-Duplex Asynchronous Networks

arXiv:2609.33753 · cs.IT, cs.IR, cs.SY, eess.SP, eess.SY, math.IT · Submitted 2026-09-27 · Read on arXiv

cs.IT, cs.IR, cs.SY, eess.SP, eess.SY, math.IT

Submitted: 2026-09-27

Updated: 2026-09-27

Terminology

• Accuracy — 21× in this paper · explained in 1 episode
• Redundancy — 10× in this paper · explained in 2 episodes
• Hamming Distance — 3× in this paper · explained in 2 episodes
• Robustness — 3× in this paper · explained in 5 episodes
• Benchmark — 1× in this paper · explained in 2 episodes
• Multi-Agent System — 1× in this paper · explained in 6 episodes
• Reinforcement Learning — 1× in this paper · explained in 4 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