Back to Search
Start Over
The Weight Hierarchy of Some Reducible Cyclic Codes.
- Source :
- IEEE Transactions on Information Theory; Jul2016, Vol. 62 Issue 7, p4071-4080, 10p
- Publication Year :
- 2016
-
Abstract
- The generalized Hamming weights (GHWs) of linear codes are fundamental parameters, the knowledge of which is of great interest in many applications. However, to determine the GHWs of linear codes is difficult in general. In this paper, we study the GHWs for a family of reducible cyclic codes and obtain the complete weight hierarchy in several cases. This is achieved by extending the idea of Yang et al. into higher dimension and by employing some interesting combinatorial arguments. It shall be noted that these cyclic codes may have arbitrary number of nonzeros. [ABSTRACT FROM PUBLISHER]
- Subjects :
- HAMMING weight
LINEAR codes
CYCLIC codes
VECTOR spaces
CRYPTOGRAPHY
Subjects
Details
- Language :
- English
- ISSN :
- 00189448
- Volume :
- 62
- Issue :
- 7
- Database :
- Complementary Index
- Journal :
- IEEE Transactions on Information Theory
- Publication Type :
- Academic Journal
- Accession number :
- 116255028
- Full Text :
- https://doi.org/10.1109/TIT.2016.2570236