arXiv (All)
open access
CAS I: A Geometric Coding Theorem
This paper establishes a direct analogue of the classical Coding Theorem in the setting of symmetry groups. We consider computable bijections on the set of binary strings and define the symmetry prior of a string x as the probability that a randomly chosen symmetry from a given group G has x as its
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Bayesian Efficient Coding#10030
- Shuffle-compatible permutation statistics II: the exterior peak set#820104
- Puncturing-inclusion constructions of optimal Ferrers diagram rank-metric codes using semifield codes#1342784
- Bounds on Codes Correcting Adjacent Transpositions#609817
- Stable patterns on permutations of multisets#820362
Record · ID 1202156
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive