Decomposing and shortening codes using automorphisms (Corresp.)
W. Cary Huffman · IEEE Transactions on Information Theory · 1986
Codes possessing certain types of automorphisms are examined. In one case, the code can be decomposed as a direct sum of two subcodes, which can be viewed as shorter length codes. In a second case, the code itself corresponds to a shorter length code. Related results and applications are given.