Codes With Parity Conditions on Subsets of Coordinates
New theorems aid search for efficient code alphabets. Paper discusses theory of finding largest binary codes 2k bits in length, in which all words differ from each other in at least d places and in which words truncated by ignoring certain subsets of bit positions belong to shorter linear codes.
Posner, E.↗