Maximum distance codes over rings of order 4

Steven T. Dougherty, Keisuke Shiromoto · IEEE Transactions on Information Theory · 2001

In this correspondence, we study bounds on the Euclidean, Hamming, Lee, and Bachoc weights of codes over rings of order 4 similar to the Singleton bound and investigate the relationship between these bounds. Moreover, we give some characterizations of the codes meeting these bounds.

Read the paper · More papers on PaperTik