版权说明 操作指南
首页 > 成果 > 详情

Matrix product codes over finite commutative Frobenius rings

认领
导出
Link by 万方学术期刊
反馈
分享
QQ微信 微博
成果类型:
期刊论文
作者:
Fan, Yun;Ling, San;Liu, Hongwei*
通讯作者:
Liu, Hongwei
作者机构:
[Liu, Hongwei; Fan, Yun] Cent China Normal Univ, Sch Math & Stat, Wuhan 430079, Peoples R China.
[Ling, San] Nanyang Technol Univ, Sch Phys Math Sci, Div Math Sci, Singapore 637616, Singapore.
通讯机构:
[Liu, Hongwei] C
Cent China Normal Univ, Sch Math & Stat, Wuhan 430079, Peoples R China.
语种:
英文
关键词:
Matrix product code;Frobenius ring;Minimum distance;Dual code;Quasi-cyclic code
期刊:
DESIGNS CODES AND CRYPTOGRAPHY
ISSN:
0925-1022
年:
2014
卷:
71
期:
2
页码:
201-227
基金类别:
Acknowledgments This work was done while the first and third authors were visiting the Division of Mathematical Sciences, School of Physical and Mathematical Sciences, Nanyang Technological University, Singapore, in Autumn 2011. They are grateful for the hospitality and support. They also thank NSFC for the support through Grants No. 10871079 and No. 11171370. The work of S. Ling was partially supported by Singapore MOE-AcRF Tier 2 Research Grant T208B2204. It is also the authors’ pleasure to thank the anonymous referees for their helpful comments.
机构署名:
本校为第一且通讯机构
院系归属:
数学与统计学学院
摘要:
Properties of matrix product codes over finite commutative Frobenius rings are investigated. The minimum distance of matrix product codes constructed with several types of matrices is bounded in different ways. The duals of matrix product codes are also explicitly described in terms of matrix product codes. © 20...

反馈

验证码:
看不清楚,换一个
确定
取消

成果认领

标题:
用户 作者 通讯作者
请选择
请选择
确定
取消

提示

该栏目需要登录且有访问权限才可以访问

如果您有访问权限,请直接 登录访问

如果您没有访问权限,请联系管理员申请开通

管理员联系邮箱:yun@hnwdkj.com