The Isometries of Additive Codes
Tefjol Pllaha / Eastern Kentucky University
A code is endowed with the hamming distance, which in turn determines its error-correcting capabilities. This suggests the study of isometries between codes. In 1961, MacWilliams with her famous Extension Theorem, classified Hamming isometries of linear codes over finite fields. This result was generalized for different weight functions, different alphabets and recently, for additive codes. We discuss the extension theorems for isometries of additive codes and connections with quantum error-correction.