Words / CONCEPT
Hamming capacity and shortest actual words
Actual Boolean words have sharp Hamming capacity under a fixed forbidden run. Their common polynomial remainder image carries a charge giving an actual-length lower bound.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES0
PROOF DEPTH3
DOCUMENT LINKS1
Sharp capacity, explicit shortest words, and common charge
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
- D-Bonacci Namesstructural-affinity · Closed
- D-Bonacci Valuesstructural-affinity · Closed
- Direct concatenation without a separatorstructural-affinity · Closed
- Integer intervals represented by run-avoiding wordsstructural-affinity · Closed
- Joint legal realization over a finite coefficient ringstructural-affinity · Closed
- Poisson Error for Closed Fair Wordsstructural-affinity · Closed
- Run Starts in a Closed Boolean Wordstructural-affinity · Closed
- Tribonacci Representationstructural-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