The Complete Weight Enumerator of A Class of Linear Codes
Can Xiang, Hao Liu
TL;DR
This paper determines the complete weight enumerators of a specific class of linear codes with two and three weights and uses these codes to construct authentication codes with improved parameters.
Contribution
It provides explicit formulas for the weight enumerators of certain linear codes and applies them to design authentication codes with better security parameters.
Findings
Complete weight enumerators for two-weight and three-weight linear codes derived.
Construction of authentication codes with new, improved parameters.
Enhanced cryptographic applications using these codes.
Abstract
Linear codes can be employed to construct authentication codes, which is an interesting area of cryptography. The parameters of the authentication codes depend on the complete weight enumerator of the underlying linear codes. In order to obtain an authentication code with good parameters, the underlying linear code must have proper parameters. The first objective of this paper is to determine the complete weight enumerators of a class of linear codes with two weights and three weights. The second is to employ these linear codes to construct authentication codes with new parameters.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · graph theory and CDMA systems · Error Correcting Code Techniques