A coding theory construction of new systematic authentication codes
From MaRDI portal
Publication:1763702
DOI10.1016/j.tcs.2004.09.011zbMath1078.68030OpenAlexW1969945141MaRDI QIDQ1763702
Publication date: 22 February 2005
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2004.09.011
Data encryption (aspects in computer science) (68P25) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Authentication, digital signatures and secret sharing (94A62)
Related Items (92)
A class of linear codes with their complete weight enumerators over finite fields ⋮ A construction of linear codes and strongly regular graphs from \(q\)-polynomials ⋮ Three-weight ternary linear codes from a family of power functions ⋮ A construction of binary linear codes from Boolean functions ⋮ Linear codes from a generic construction ⋮ Three classes of linear codes with two or three weights ⋮ AUTHENTICATION CODES FROM DIFFERENCE BALANCED FUNCTIONS ⋮ Authentication codes based on resilient Boolean maps ⋮ Complete weight enumerators of some linear codes and their applications ⋮ Linear codes with two or three weights from quadratic bent functions ⋮ Four families of minimal binary linear codes with \(w_{\min }/w_{\max }\le 1/2\) ⋮ Complete weight enumerators of some cyclic codes ⋮ Two classes of linear codes and their weight distributions ⋮ Complete weight enumerator of torsion codes ⋮ Complete weight enumerators of three classes of linear codes ⋮ Binary linear codes from vectorial Boolean functions and their weight distribution ⋮ A construction of \(q\)-ary linear codes with two weights ⋮ A construction of linear codes and their complete weight enumerators ⋮ Linear codes with few weights from cyclotomic classes and weakly regular bent functions ⋮ A class of binary cyclic codes with optimal parameters ⋮ Constructing few-weight linear codes and strongly regular graphs ⋮ Constructions of linear codes with two or three weights from vectorial dual-bent functions ⋮ Two families of few-weight codes over a finite chain ring ⋮ Complete weight enumerators of a class of linear codes with two weights ⋮ Several classes of new weakly regular bent functions outside \(\mathcal{RF}\), their duals and some related (minimal) codes with few weights ⋮ Complete weight enumerator for a class of linear codes from defining sets and their applications ⋮ Several classes of linear codes with few weights over finite fields ⋮ The subfield and extended codes of a subclass of optimal three-weight cyclic codes ⋮ Cones from maximum \(h\)-scattered linear sets and a stability result for cylinders from hyperovals ⋮ Vectorial bent functions and linear codes from quadratic forms ⋮ On the weight distributions of a class of cyclic codes ⋮ Two-weight and three-weight linear codes based on Weil sums ⋮ On the subfield codes of a subclass of optimal cyclic codes and their covering structures ⋮ A new class of distance-optimal binary cyclic codes and their duals ⋮ The punctured codes of two classes of cyclic codes with few weights ⋮ Two pointsets in \(\mathrm{PG}(2,q^n)\) and the associated codes ⋮ Codes with few weights arising from linear sets ⋮ A class of optimal ternary cyclic codes and their duals ⋮ Three-weight cyclic codes and their weight distributions ⋮ Antipodal two-weight rank metric codes ⋮ Quantum codes from trace codes ⋮ A unified construction of optimal and distance optimal two or three-weight codes ⋮ The weight distribution of a class of two-weight linear codes derived from Kloosterman sums ⋮ Binary linear codes with two or three weights from Niho exponents ⋮ Two classes of 2-weight and 3-weight linear codes in terms of Kloosterman sums ⋮ Optimal quinary negacyclic codes with minimum distance four ⋮ Two classes of optimal few-weight codes over \({\mathbb{F}}_q+u{\mathbb{F}}_q\) ⋮ Weight distributions of Q2DC codes over finite fields ⋮ A note on the minimal binary linear code ⋮ Weight distributions of generalized quasi-cyclic codes over \(\mathbb{F}_q + u \mathbb{F}_q\) ⋮ Two new classes of projective two-weight linear codes ⋮ Complete weight enumerators of a class of linear codes ⋮ Complete weight enumerators of two classes of linear codes ⋮ Some two-weight and three-weight linear codes ⋮ Linear codes with few weights from weakly regular plateaued functions ⋮ Complete weight enumerators for several classes of two-weight and three-weight linear codes ⋮ More constructions of 3-weight linear codes ⋮ Linear codes with few weights from weakly regular bent functions based on a generic construction ⋮ A class of linear codes with a few weights ⋮ Two classes of \(p\)-ary bent functions and linear codes with three or four weights ⋮ A class of three-weight linear codes and their complete weight enumerators ⋮ Complete weight enumerators of some linear codes from quadratic forms ⋮ Several classes of linear codes with few weights from the closed butterfly structure ⋮ A kind of three-weight linear codes ⋮ Complete weight distributions of two classes of cyclic codes ⋮ Complete weight enumerators of a family of three-weight linear codes ⋮ Linear codes from quadratic forms ⋮ Linear codes with few weights from inhomogeneous quadratic functions ⋮ Evaluation of the Hamming weights of a class of linear codes based on Gauss sums ⋮ Several classes of linear codes with a few weights from defining sets over \(\mathbb {F}_p+u\mathbb {F}_p\) ⋮ Constructions of several classes of linear codes with a few weights ⋮ A class of two or three weights linear codes and their complete weight enumerators ⋮ A construction of \(p\)-ary linear codes with two or three weights ⋮ A class of linear codes and their complete weight enumerators ⋮ Complete weight enumerators of a class of linear codes over finite fields ⋮ New constructions of systematic authentication codes from three classes of cyclic codes ⋮ Two classes of binary cyclic codes and their weight distributions ⋮ Complete weight enumerators of two classes of linear codes with a few weights ⋮ Three-weight ternary linear codes from a family of cyclic difference sets ⋮ On the complete weight enumerators of some reducible cyclic codes ⋮ Recent results and problems on constructions of linear codes from cryptographic functions ⋮ A family of optimal ternary cyclic codes from the Niho-type exponent ⋮ Complete weight enumerators of a class of linear codes ⋮ Hamming weight distributions of multi-twisted codes over finite fields ⋮ Binary linear codes with few weights from Boolean functions ⋮ New linear codes with few weights derived from Kloosterman sums ⋮ The minimum Hamming distances of repeated-root cyclic codes of length \(6p^s\) and their MDS codes ⋮ Complete weight enumerators of a class of two-weight linear codes ⋮ Complete weight enumerators of a class of linear codes with two or three weights ⋮ The Hamming distances of repeated-root cyclic codes of length \(5 p^s\) ⋮ Linear codes with eight weights over \(\mathbb{F}_p+u\mathbb{F}_p\) ⋮ Infinite families of optimal linear codes and their applications to distributed storage systems
Cites Work
- Unnamed Item
- Unnamed Item
- Combinatorial characterizations of authentication codes
- Universal hashing and geometric codes
- Combinatorial characterizations of authentication codes. II
- Universal Hash Functions from Exponential Sums over Finite Fields and Galois Rings
- A Generic Construction of Cartesian Authentication Codes
- Authentication Theory/Coding Theory
- Codes Which Detect Deception
- Constructions of authentication codes from algebraic curves over finite fields
- Linear authentication codes: bounds and constructions
- On the cardinality of systematic authentication codes via error-correcting codes
- Weights of irreducible cyclic codes
This page was built for publication: A coding theory construction of new systematic authentication codes
