Seated one day at an analogue of the aperiodic Penrose tiling, I struck one 10-dimensional rank-4 null space of beauty with the (redundant) weight-4 basis: [ 1, 0, 0, 0, -1, -1, -1, 0, 0, 0] [ 0, 1, 0, 0, -1, 0, 0, 0, -1, 1] [ 0, 0, 1, 0, 0, -1, 0, 1, 0, -1] [ 0, 0, 0, 1, 0, 0, -1, -1, 1, 0] [ 1, -1, -1, -1, 0, 0, 0, 0, 0, 0] ; and on dropping signs it struck me (back!) that this was case n,m = 5,2 of an elementary binary block code with: number = n words, weight = (n-1)_C_(m-1) , length = n_C_m , distance = 2 (n-2)_C_(m-1) , where n_C_m denotes binomial coefficient. I have sought, but I seek it vainly --- along with its name and rank. Can somebody please jog my memory? Fred Lunnon