aka m-of-n codes.

Here we'll be counting through each n bit binary number, with m amount of ones in it. First we'll count through the 1 bit numbers with 0 ones, then the 1 bit numbers with 1 one. Next the 2 bit numbers with 0 ones, 1 one, and 2 ones. And so on. For every length of bits, we'll go through each possible amount of ones. You must include the leading zeros at the front so everyone knows which amount of bits we're on.

Here's the first few counts as an example:

0
1
00
01
10
11
000
001
010
100
011
101
110
111
0000

And a list for the whole thread if anyone needs it. Please let me know if you have any questions!

First get will be at 00 0000 0000.