Computability / CONCEPT
Length-Profile Separation for Immutable Prefix Codes
Equal codeword lengths and equal Kraft mass do not control immutable extension depth.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES0
PROOF DEPTH4
DOCUMENT LINKS1
Equal length profiles hide an unbounded extension gap
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
Certified topology / DOWNSTREAM
Consequences
None recorded in this release.
RELATED KNOWLEDGE
Structural connections
- All-Law Integrability of Sparse-Grid Waitingstructural-affinity · Closed
- Coding-Dependent Orders on Finite Interpretationsstructural-affinity · Closed
- Finite Binary Kraft Conversestructural-affinity · Closed
- First Mass Crossings in a Biased Binary Treestructural-affinity · Closed
- Greedy Prefix Codes with Arbitrary Depth Budgetsstructural-affinity · Closed
- GreedyRenewalstructural-affinity · Closed
- Historical Processes and Depth-Budget Joint Extremastructural-affinity · Closed
- Immutable Prefix-Code Extensionstructural-affinity · Closed
Documents & exposition
Other authored & advisory relationships
None recorded in this release.
LIBRARY / RELEASE VERSIONS
Content history
Loading release versions...
Browse the archiveCertified provenance