A class of affine-invariant codes and their support 2-designs
- 30 June 2021
- journal article
- research article
- Published by Springer Nature in Cryptography and Communications
- Vol. 14 (2) , 215-227
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China (11771007)
- National Natural Science Foundation of China (12001475)
This publication has 20 references indexed in Scilit:
- Infinite families of -designs and -designs from linear codesDiscrete Mathematics, 2017
- An Infinite Family of Steiner Systems from Cyclic CodesJournal of Combinatorial Designs, 2017
- Infinite families of 3-designs from a type of five-weight codeDesigns, Codes and Cryptography, 2017
- Parameters of 2-Designs from Some BCH Codes2017
- Optimal p-ary cyclic codes with minimum distance four from monomialsCryptography and Communications, 2015
- The weight distribution of a family of $p$ p -ary cyclic codesDesigns, Codes and Cryptography, 2013
- On the Weight Distributions of Two Classes of Cyclic CodesIEEE Transactions on Information Theory, 2008
- On subfield subcodes of modified Reed-Solomon codes (Corresp.)IEEE Transactions on Information Theory, 1975
- New 5-designsJournal of Combinatorial Theory, 1969
- Some results on cyclic codes which are invariant under the affine group and their applicationsInformation and Control, 1967