首页 | 本学科首页   官方微博 | 高级检索  
     


Maximum distance separable codes over {mathbb{Z}_4} and {mathbb{Z}_2 times mathbb{Z}_4}
Authors:M. Bilal  J. Borges  S. T. Dougherty  C. Fern��ndez-C��rdoba
Affiliation:1. Department of Information and Communications Engineering, Universitat Aut??noma de Barcelona, 08193, Bellaterra, Spain
2. Department of Mathematics, University of Scranton, Scranton, PA, 18510, USA
Abstract:Known upper bounds on the minimum distance of codes over rings are applied to the case of ${mathbb Z_{2}mathbb Z_{4}}$ -additive codes, that is subgroups of ${mathbb Z_{2}^{alpha}mathbb Z_{4}^{beta}}$ . Two kinds of maximum distance separable codes are studied. We determine all possible parameters of these codes and characterize the codes in certain cases. The main results are also valid when ?? = 0, namely for quaternary linear codes.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号