The Weight Hierarchy of a Family of Cyclic Codes with Arbitrary Number of Nonzeroes
Abstract
The generalized Hamming weights (GHWs) are fundamental parameters of linear codes. GHWs are of great interest in many applications since they convey detailed information of linear codes. In this paper, we continue the work of [10] to study the GHWs of a family of cyclic codes with arbitrary number of nonzeroes. The weight hierarchy is determined by employing a number-theoretic approach.
- Publication:
-
arXiv e-prints
- Pub Date:
- February 2017
- DOI:
- 10.48550/arXiv.1702.01309
- arXiv:
- arXiv:1702.01309
- Bibcode:
- 2017arXiv170201309L
- Keywords:
-
- Computer Science - Information Theory
- E-Print:
- 16 pages, Finite Fields and Their Applications, Accepted