( n, k,d) Just the check bits; append an identity matrix for data bits
 ( 3, 1,3) 0x00000003  00000000000000000000000000000011
 ( 5, 2,3) 0x00000005  00000000000000000000000000000101
 ( 6, 3,3) 0x00000006  00000000000000000000000000000110
 ( 7, 4,3) 0x00000007  00000000000000000000000000000111
 ( 9, 5,3) 0x00000009  00000000000000000000000000001001
 (10, 6,3) 0x0000000a  00000000000000000000000000001010
 (11, 7,3) 0x0000000b  00000000000000000000000000001011
 (12, 8,3) 0x0000000c  00000000000000000000000000001100
 (13, 9,3) 0x0000000d  00000000000000000000000000001101
 (14,10,3) 0x0000000e  00000000000000000000000000001110
 (15,11,3) 0x0000000f  00000000000000000000000000001111
 (17,12,3) 0x00000011  00000000000000000000000000010001
 (18,13,3) 0x00000012  00000000000000000000000000010010
 (19,14,3) 0x00000013  00000000000000000000000000010011
 (20,15,3) 0x00000014  00000000000000000000000000010100
 (21,16,3) 0x00000015  00000000000000000000000000010101
 (22,17,3) 0x00000016  00000000000000000000000000010110
 (23,18,3) 0x00000017  00000000000000000000000000010111
 (24,19,3) 0x00000018  00000000000000000000000000011000
 (25,20,3) 0x00000019  00000000000000000000000000011001
 (26,21,3) 0x0000001a  00000000000000000000000000011010
 (27,22,3) 0x0000001b  00000000000000000000000000011011
 (28,23,3) 0x0000001c  00000000000000000000000000011100
 (29,24,3) 0x0000001d  00000000000000000000000000011101
 (30,25,3) 0x0000001e  00000000000000000000000000011110
 (31,26,3) 0x0000001f  00000000000000000000000000011111
 (33,27,3) 0x00000021  00000000000000000000000000100001
 (34,28,3) 0x00000022  00000000000000000000000000100010
 (35,29,3) 0x00000023  00000000000000000000000000100011
 (36,30,3) 0x00000024  00000000000000000000000000100100
 (37,31,3) 0x00000025  00000000000000000000000000100101
 (38,32,3) 0x00000026  00000000000000000000000000100110
... and so forth.  This is the Hamming code.  The check bits form every
integer other than the powers of two.