期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

矩阵乘积码的自对偶码

Matrix-product self-dual codes
下载PDF
导出
摘要 Blackmore和Norton引入了矩阵乘积码的概念,并给出其对偶码的形式,但未涉及其自对偶码的研究.给出了存在矩阵使得构成的矩阵乘积码成为自对偶码的充分必要条件及其应用举例. Blackmore and Norton introduced the definitions of matrix-product codes, giving their dual codes, but did not do any study of self-dual code. The sufficient and necessary conditions for the matrix-product codes to be self-dual code are given, and the relevant application examples are presented.
作者 杨建生 常岭
机构地区 上海大学理学院
出处 《应用数学与计算数学学报》 2012年第4期403-413,共11页 Communication on Applied Mathematics and Computation
基金 国家自然科学基金资助项目(61071186) 上海市自然科学基金资助项目(10ZR1412100) 上海市学科建设资助项目(A.13-0101-12-005)
关键词 矩阵乘积码 自对偶码 线性码 矩阵 matrix-product code self-dual code linear code matrix
分类号 O157.4 [理学—基础数学]
  • 相关文献

参考文献15

  • 1Blackmore T, Norton G H. Matrix-product codes over Fq [J]. Applicable Algebra in Engineering, Communication and Computinq, 2001, 12(6): 477-500.
  • 2Ozbudak F, Stichtenoth H. Note on Niederreiter-Xing's propagation rule for linear codes [J]. Applicable Algebra in Engineering, Communication and Computing, 2002, 13(1): 53-56.
  • 3Hernando F, Lally K, Ruano D. Construction and decoding of matrix-product codes from nested codes [J]. Applicable Algebra in Engineering, Communication and Computing, 2009, 20(5/6): 497-507.
  • 4Hernando F, Ruano D. New liner codes from matrix-product codes with polynomial units [J]. Advances in Mathematics of Communications, 2010, 4(3): 363-367.
  • 5Gulliver T A, Kim J L, Lee Y J. New MDS or near-MDS self-dual codes [J]. Institute of Electrical and Electronics Engineers Information Theory Society, 2008, 54(9): 4354-4360.
  • 6Kim J L, Lee Y J. Euclidean and Hermitian self-dual MDS codes over large finite fields [J]. Journal of Combinatorial Theory. Series A, 2004, 105(1): 79-95.
  • 7Nedeloaia C S. Weight distributions of cyclic self-dual codes [J]. Institute of Electrical and Electronics Engineers Transactions on Information Theory, 2003, 49(6): 1582-1591.
  • 8Conway J H, Pless V. On the enumeration of self-dual codes [J]. Journal of Combinatorial Theory. Series A, 1980, 28(1): 26-53.
  • 9Conway J H, Pless V, Sloane N J A. The binary self-dual codes of length up to 32: a revised enumeration [J]. Journal of Combinatorial Theory. Series A, 1992, 60(2): 183-195.
  • 10Conway J H, Sloane N J A. A new upper bound on the minimal distance of self-dual codes [J]. Institute of Electrical and Electronics Engineers Transactions on Information Theory, 1990, 36(6): 1319-1333.
应用数学与计算数学学报
2012年 第4期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部