OAI/Combinatorics/LowSpaceSubsetSum/Storage/PermutationSubsetCode.lean

GitHub source file

7 declarations, 0 contain sorry, 0 declared as axioms

Packing a sampled fixed-size subset from a stored permutation

The first k permutation entries are retained as a bounded list. Each output bit is computed by a measured membership scan.

  1. def OAI.LowSpaceSubsetSum.PermutationSubsetCode.prefixIndices line 17
  2. theorem OAI.LowSpaceSubsetSum.PermutationSubsetCode.prefix_length line 20
  3. theorem OAI.LowSpaceSubsetSum.PermutationSubsetCode.initial_mem line 24
  4. theorem OAI.LowSpaceSubsetSum.PermutationSubsetCode.prefix_value line 33
  5. def OAI.LowSpaceSubsetSum.PermutationSubsetCode.pack line 41
  6. theorem OAI.LowSpaceSubsetSum.PermutationSubsetCode.pack_value line 49
  7. theorem OAI.LowSpaceSubsetSum.PermutationSubsetCode.pack_work line 60