A class of linear codes with their complete weight enumerators over finite fields
- 10 June 2021
- journal article
- research article
- Published by Springer Nature in Cryptography and Communications
- Vol. 13 (5) , 695-725
Abstract
No abstract availableKeywords
Funding Information
- University Grants Commission (11-04-2016-413564.)
This publication has 20 references indexed in Scilit:
- Two classes of two-weight linear codesFinite Fields and Their Applications, 2016
- 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
- A Class of Two-Weight and Three-Weight Codes and Their Applications in Secret SharingIEEE Transactions on Information Theory, 2015
- Binary Linear Codes With Three WeightsIEEE Communications Letters, 2014
- A Construction of Optimal Constant Composition CodesDesigns, Codes and Cryptography, 2006
- On constant composition codesDiscrete Applied Mathematics, 2006
- A coding theory construction of new systematic authentication codesTheoretical Computer Science, 2005
- On constant-composition codes over Z/sub q/IEEE Transactions on Information Theory, 2003
- Finite fields, by Rudolf Lidl and Harald Niederreiter. Pp 755. £57·80. 1983. ISBN 0-201-13519-3 (Addison-Wesley)The Mathematical Gazette, 1984