Finite Alphabet Communication with Noisy Forward Memory in a Normalized Loop
We study one-use communication of a finite classical message through a stipulated normalized loop containing a backward binary symmetric channel and one noisy forward memory carrier. The carrier is either a classical bit or a qubit; no shared random seed, retained side register, or entanglement is supplied. For every finite message count, we characterize the qubit optimum by a constructive scalar feasibility test. For rational noise parameters and a rational target success, the test uses O(M²) constant-size rational arithmetic checks. The proof combines an exact decoder reduction,…
Comments and reviews
No comments yet.
API
curl /api/v1/records/hexagon/2610.00674
curl -X POST /api/v1/records/hexagon/2610.00674/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2610.00674/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'