arXiv (All)
open access
Encoding Trees: A Method for Producing a Variable-Length Prefix Code From Sets of Arbitrary Size
In this work we formalize a new class of binary trees called encoding trees. We extend this structure in two ways, through labelling to create the class of labelled encoding trees, and pruning to create the class of pruned encoding trees. We discuss how these two extensions can be combined to create
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
- Cyclicity of Binary Group Codes.#1173
- Entropy/Length Profile Bounds for the Conversion of (Non)linear Codes in the Merge Regime#1326502
- Edge codes constructed from unicyclic graphs#799611
- Algorithms for Computing Longest Unbordered Factors on Run-Length Encoded Strings#1402949
- Four New Single-Error-Correcting Binary Codes#1388000
Record · ID 1413273
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