National Natural Science Foundation of China (No.11171370);2014 Science and Technology Development Project of Henan Province (No.144300510051);Funding Project of Young Backbone Teachers of Universities in Henan Province in 2013 (No.2013GGJS-152);Fundamental Research project of Natural Science Project of Education Department of Henan Province (No.148110004)
ZHANG Guang-hui. On the Minimum Support Hierarchy of Linear Codes over Fp+vFp[J]. Acta Electronica Sinica, 2015, 43(8): 1621-1626.
DOI:
ZHANG Guang-hui. On the Minimum Support Hierarchy of Linear Codes over Fp+vFp[J]. Acta Electronica Sinica, 2015, 43(8): 1621-1626. DOI: 10.3969/j.issn.0372-2112.2015.08.023.
On the Minimum Support Hierarchy of Linear Codes over Fp+vFp
Based on the direct sum decomposition of linear codes over
F
p
+
vF
p
(
v
2
=
v
)
the minimum support hierarchy of linear codes over
F
p
+
vF
p
and their dual codes are studied by means of the Torsion codes and parity check matrice of these linear codes.With these results the Hamming distance of linear codes over
F
p
+
vF
p
are determined in terms of that of linear codes over the finite field
F
p
and an explicit construction for linear codes over