Quantitative storage and key widths for the chosen high-rate code #
These inequalities retain the rate-one factor and charge at most one whole codeword for rounding. They concern exact integer counts and are ready for eventual parameter estimates.
theorem
Algebraic.MassProduction.Nonuniform.FiniteBound.resourceCount_le_rate
{blocks precision blockWidth dimension prefixWidth : ℕ}
(blocksPositive : 0 < blocks)
(blocksLarge : precision * (2 ^ (blockWidth * dimension) - 1) ≤ blocks)
:
Rate-one storage bound including the one-codeword rounding term.
theorem
Algebraic.MassProduction.Nonuniform.FiniteBound.resourceCount_le_nearOne
{blocks precision blockWidth dimension prefixWidth : ℕ}
(blocksPositive : 0 < blocks)
(blocksLarge : precision * (2 ^ (blockWidth * dimension) - 1) ≤ blocks)
(roundingSmall : precision * (2 ^ (dimension * (blockWidth * blocks)) * (blockWidth * blocks)) ≤ 2 ^ prefixWidth)
:
If one codeword is negligible at the selected precision, the complete
bank has expansion at most (precision+2)/precision.
theorem
Algebraic.MassProduction.Nonuniform.FiniteBound.copies_bitWidth_le
(prefixWidth dimension blockWidth blocks : ℕ)
:
Copy-index keys use at most one bit more than the source prefix.
A field-basis selector fits in at most the field symbol's bit width.