The covering problem for finite rings with respect to the RT-metric
暂无分享,去创建一个
[1] Irfan Siap,et al. Linear Codes over $\mathbb{F}_{q}[u]/(u^s)$ with Respect to the Rosenbloom–Tsfasman Metric , 2006, Des. Codes Cryptogr..
[2] Irfan Siap,et al. Codes over Galois rings with respect to the Rosenbloom-Tsfasman metric , 2007, J. Frankl. Inst..
[3] Thomas Honold,et al. Linear Codes over Finite Chain Rings , 1999, Electron. J. Comb..
[4] Patric R. J. Östergård,et al. New Results on Codes with Covering Radius 1 and Minimum Distance 2 , 2005, Des. Codes Cryptogr..
[5] Irfan Siap,et al. The complete weight enumerator for codes over M n times s(R) , 2004, Appl. Math. Lett..
[6] Claude Carlet. Z2k-Linear Codes , 1998, IEEE Trans. Inf. Theory.
[7] Irene N. Nakaoka,et al. A covering problem over finite rings , 2010, Appl. Math. Lett..
[8] S. Dougherty,et al. MacWilliams Duality and the Rosenbloom—Tsfasman Metric , 2002 .
[9] Irfan Siap. The Complete Weight Enumerator for Codes over Mn×s(Fq) , 2001, IMACC.