AI & ML
Rates and Nearly-Lossless State over a Multi-Access Channel with Causal State Information
arXiv math.IT0 views
arXiv:2610.41860v1 Announce Type: new Abstract: The problem of transmitting both data and state over a memoryless state-dependent multi-access channel with causal state information is addressed. The state comprises three independent components: a common component, which is revealed to both en- coders, and two private components, each of which is revealed to a different encoder. The data are to be recovered with arbitrarily-small probability of error, and the state sequence with arbitrarily-small symbol-error rate. Under the assumption that the capacity region in the absence of a state recon- struction constraint is nonempty, the capacity region is derived and is shown to be achievable using a Block-Markov coding scheme employing binning and superposition coding.
Source：https://arxiv.org/abs/2610.41860PreviousBatch Universal Prediction via Conditional Additive SmoothingNextCapacity Meets the Four Subspace Problem: Distributed Linear Computation and the Cross-Ratio
Related posts
The Download: the agentic web arrives and the drive for safer roads
0MIT Technology Review
Stop counting tokens, start counting what ships
0MIT Technology Review
OpenAI is finally merging ChatGPT’s chat and Work tabs
0TechCrunch
10 Open-Source Robotics Repositories for 3D Perception, VLA Policies, and Sensor Calibration
0dev.to
My self-modifying system tried to wire a gate-passing module into its own protection enforcer. It was refused three times.
0dev.to
Last night an AI agent performed brain surgery on a mouse
0Hacker News