Back to Search
Start Over
Minimal Linear Codes in Odd Characteristic.
- Source :
-
IEEE Transactions on Information Theory . Jul2019, Vol. 65 Issue 7, p4152-4155. 4p. - Publication Year :
- 2019
-
Abstract
- In this paper, we generalize constructions in two recent works of Ding, Heng, and Zhou to any field $\mathbb {F}_{{q}}$ , ${q}$ odd, providing infinite families of minimal codes for which the Ashikhmin–Barg bound does not hold. [ABSTRACT FROM AUTHOR]
- Subjects :
- *LINEAR codes
*HAMMING weight
Subjects
Details
- Language :
- English
- ISSN :
- 00189448
- Volume :
- 65
- Issue :
- 7
- Database :
- Academic Search Index
- Journal :
- IEEE Transactions on Information Theory
- Publication Type :
- Academic Journal
- Accession number :
- 137099082
- Full Text :
- https://doi.org/10.1109/TIT.2019.2891992