F_2+uF_2环上接近MDR码

详细信息    查看全文 | 推荐本文 |

英文篇名：Near-MDR codes over F_2+uF_2 作者：刘花璐 ; 陈希 ; 刘修生 英文作者：LIU Hualu;CHEN Xi;LIU Xiusheng;School of Mathematics and Physics,Hubei Polytechnic University;School of Economy and Management,Hubei Polytechnic University; 关键词：线性码 ; 挠码 ; 剩余类码 ; 几乎MDR码 ; 接近MDR码 英文关键词：linear code;;torsion code;;residue code;;almost-MDR code;;near-MDR code 中文刊名：JSGG 英文刊名：Computer Engineering and Applications 机构：湖北理工学院数理学院;湖北理工学院经济与管理学院; 出版日期：2012-09-28 11:25 出版单位：计算机工程与应用 年：2014 期：v.50;No.807 基金：湖北省教育厅自然科学重点项目基金(No.B20114410) 语种：中文; 页：JSGG201408018 页数：4 CN：08 ISSN：11-2127/TP 分类号：81-84

摘要

S.M.Dodunekov和I.N.Landgev定义并研究了域Fq上接近MDS码。对于F2+uF2环,相应地定义了接近MDR码,证明了F2+uF2环上线性码C为接近MDR码的充要条件是它的挠码Tor(C)为它剩余类域F2上的接近MDS码,并给出了F2+uF2环上所有接近MDR码的生成矩阵。
        In 1994, S. M. Dodunekov and I. N. Landgev define and study the near-MDS codes over field Fq. In this paper, the near-MDR codes over ring F2+ uF2are defined, and it is proved that the linear codes over ring F2+ uF2are the near-MDR if and only if the torsion codes Tor(C) are the near-MDS over residue field F2, and generator matrices of all near-MDR codes over ring F2+uF2are given.

引文

[1]Dodunekov S M,Landgev I N.On near MDS codes,Report LiTH-ISY-R-1563[R].Sweden:Department of Engineering,Linkoping University,1994.
    [2]Dodunekov S M,Landgev I N.On near MDS codes[J].Journal of Geometry,1995,54:30-43.
    [3]De Bore M A.Almost MDS codes[J].Designs,Codes,and Cryptography,1996,9:143-155.
    [4]刘九分,李玉辉,陈嘉勇,等.基于三元Golay隐写码的快速隐写算法[J].计算机工程,2008,34(24):149-151.
    [5]朱雪秀,刘九分,张卫明.一种基于汉明码和湿纸码的隐写算法[J].电子与信息学报,2010,32(1):162-165.
    [6]Dougherty S T,Shiromoto K.Maximum distance codes over rings of ordre 4[J].IEEE Trans on Inform Theory,2001,47:400-404.
    [7]Huffman W C,Pless V S.Fundamentals of error-correcting codes[M].Cambridge:Cambrige University Press,2003.
    [8]Word J.Duality for modules over finite rings and applications to coding theory[J].Amer J Math,1999,121:555-575.
    [9]Dougherty S T,Shiromoto K.Maximum distance codes over rings of order 4[J].IEEE Trans on Inform Theory,2011,47:400-404.