电子学报Issue(8)：1621-1626,6.DOI:10.3969/j.issn.0372-2112.2015.08.023
环 Fp ＋vFp 上线性码的极小支座谱
On the Minimum Support Hierarchy of Linear Codes over Fp +vFp
摘要
Abstract
Based on the direct sum decomposition of linear codes over Fp +vFp(v2 =v),the minimum support hierarchy of linear codes over Fp +vFp and their dual codes are studied by means of the Torsion codes and parity check matrice of these lin-ear codes.With these results the Hamming distance of linear codes over Fp +vFp are determined in terms of that of linear codes over the finite field Fpand an explicit construction for linear codes over Fp +vFp are given with the Hamming distance d,wherepis a prime and dis a positive integer.关键词
环 Fp +vFp/支座/极小支座谱/Hamming 距离Key words
Fp +vFp/support/minimum support hierarchy/Hamming distance分类
信息技术与安全科学引用本文复制引用
张光辉..环 Fp ＋vFp 上线性码的极小支座谱[J].电子学报,2015,(8):1621-1626,6.基金项目
国家自然科学基金（No．11171370）；河南省2014科技发展计划（No．144300510051）；2013年度河南省高等学校青年骨干教师资助计划（No．2013GGJS-152）；河南省教育厅自然科学基础研究项目 （）
