New constructions of systematic authentication codes from three classes of cyclic codes

DOI10.3934/amc.2018001zbMath1414.94936OpenAlexW2790601876WikidataQ129987398 ScholiaQ129987398MaRDI QIDQ1783702

Longjiang Qu, Yunwen Liu, Chao Li

Publication date: 21 September 2018

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/amc.2018001

zbMATH Keywords

exponential sumscyclic codessystematic authentication code

Mathematics Subject Classification ID

Cyclic codes (94B15) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Unnamed Item
• Universal hashing and geometric codes
• Cartesian authentication codes from functions with optimal nonlinearity.
• A coding theory construction of new systematic authentication codes
• Combinatorial characterizations of authentication codes. II
• Some constructions of systematic authentication codes using Galois rings
• A class of three-weight cyclic codes
• The Weight Distributions of Several Classes of Cyclic Codes From APN Monomials
• Universal Hash Functions from Exponential Sums over Finite Fields and Galois Rings
• Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes
• Systematic Authentication Codes From Highly Nonlinear Functions
• The weight distribution of a class of linear codes from perfect nonlinear functions
• A Generic Construction of Cartesian Authentication Codes
• On the Weight Distributions of Two Classes of Cyclic Codes
• Authentication Theory/Coding Theory
• On subfield subcodes of modified Reed-Solomon codes (Corresp.)
• Linear authentication codes: bounds and constructions
• On the cardinality of systematic authentication codes via error-correcting codes
• Five Families of Three-Weight Ternary Cyclic Codes and Their Duals
• A Family of Five-Weight Cyclic Codes and Their Weight Enumerators

This page was built for publication: New constructions of systematic authentication codes from three classes of cyclic codes