Generalized Hamming Weights of Irreducible Cyclic Codes
Information Theory
2014-10-13 v1 math.IT
Abstract
The generalized Hamming weight (GHW) of linear codes is a natural generalization of the minimum Hamming distance and has become one of important research objects in coding theory since Wei's originary work [23] in 1991. In this paper two general formulas on for irreducible cyclic codes are presented by using Gauss sums and the weight hierarchy are completely determined for several cases.
Keywords
Cite
@article{arxiv.1410.2702,
title = {Generalized Hamming Weights of Irreducible Cyclic Codes},
author = {Minghui Yang and Jin Li and Keqin Feng and Dongdai Lin},
journal= {arXiv preprint arXiv:1410.2702},
year = {2014}
}