The Complete Weight Enumerators of Linear Codes From Generalized Augmented Codes
- 1 October 2026
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 72 (10) , 7482-7499
Abstract
No abstract availableFunding Information
- National Natural Science Foundation of China (12271199)
- Project of International Cooperation and Exchanges NSFC (12411540221)
- National Natural Science Foundation of China (12401689)
- Research Startup Fund of South-Central Minzu University (YZY26009)
This publication has 58 references indexed in Scilit:
- New distance bounds for quasi-cyclic codesDesigns, Codes and Cryptography, 2024
- Several families of irreducible constacyclic and cyclic codesDesigns, Codes and Cryptography, 2023
- The b-symbol weight distributions of all semiprimitive irreducible cyclic codesDesigns, Codes and Cryptography, 2023
- Complete b-symbol weight distribution of some irreducible cyclic codesDesigns, Codes and Cryptography, 2022
- Complete weight enumerators of a family of three-weight linear codesDesigns, Codes and Cryptography, 2016
- Complete weight enumerators of some linear codes and their applicationsDesigns, Codes and Cryptography, 2015
- Complete weight enumerators of some cyclic codesDesigns, Codes and Cryptography, 2015
- A Construction of Optimal Constant Composition CodesDesigns, Codes and Cryptography, 2006
- On near-MDS codesJournal of Geometry, 1995
- A Theorem on the Distribution of Weights in a Systematic Code†Bell System Technical Journal, 1963