A coding theory construction of new systematic authentication codes
From MaRDI portal
(Redirected from Publication:1763702)
Recommendations
Cites work
- scientific article; zbMATH DE number 1024067 (Why is no real title available?)
- scientific article; zbMATH DE number 1161253 (Why is no real title available?)
- A Generic Construction of Cartesian Authentication Codes
- Authentication Theory/Coding Theory
- Codes Which Detect Deception
- Combinatorial characterizations of authentication codes
- Combinatorial characterizations of authentication codes. II
- 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
- Universal hash functions from exponential sums over finite fields and Galois rings
- Universal hashing and geometric codes
- Weights of irreducible cyclic codes
Cited in
(only showing first 100 items - show all)- Two classes of binary cyclic codes and their weight distributions
- scientific article; zbMATH DE number 2170431 (Why is no real title available?)
- Codes with few weights arising from linear sets
- Difference packing arrays and systematic authentication codes
- Linear codes from quadratic forms
- New linear codes with few weights derived from Kloosterman sums
- A class of binary cyclic codes with optimal parameters
- Evaluation of the Hamming weights of a class of linear codes based on Gauss sums
- On the weight distributions of a class of cyclic codes
- More constructions of 3-weight linear codes
- Antipodal two-weight rank metric codes
- Several classes of linear codes with few weights over finite fields
- scientific article; zbMATH DE number 5732575 (Why is no real title available?)
- Two new classes of projective two-weight linear codes
- Some two-weight and three-weight linear codes
- Infinite families of optimal linear codes and their applications to distributed storage systems
- A construction of q-ary linear codes with two weights
- Weight distributions of generalized quasi-cyclic codes over \(\mathbb{F}_q + u \mathbb{F}_q\)
- A unified construction of optimal and distance optimal two or three-weight codes
- Determination for minimum symbol-pair and RT weights via torsional degrees of repeated-root cyclic codes
- A class of optimal ternary cyclic codes and their duals
- Construction and comparison of authentication codes
- Constructions of several classes of linear codes with a few weights
- Simple and Efficient Systematic a-Codes from Error Correcting Codes
- A note on the minimal binary linear code
- Linear codes with few weights from cyclotomic classes and weakly regular bent functions
- Linear codes with few weights from weakly regular plateaued functions
- Two-weight and three-weight linear codes based on Weil sums
- Constructions for several classes of few-weight linear codes and their applications
- Two families of few-weight codes over a finite chain ring
- Vectorial bent functions and linear codes from quadratic forms
- A construction of linear codes and strongly regular graphs from \(q\)-polynomials
- A note on error-correcting codes for authentication and subliminal channels
- Binary linear codes from vectorial Boolean functions and their weight distribution
- Several classes of linear codes with a few weights from defining sets over \(\mathbb {F}_p+u\mathbb {F}_p\)
- Constructions of linear codes with two or three weights from vectorial dual-bent functions
- Several classes of new weakly regular bent functions outside \(\mathcal{RF}\), their duals and some related (minimal) codes with few weights
- Authentication codes based on resilient Boolean maps
- A construction of binary linear codes from Boolean functions
- Three-weight ternary linear codes from a family of power functions
- Optimal quinary negacyclic codes with minimum distance four
- A construction of \(p\)-ary linear codes with two or three weights
- Linear codes from a generic construction
- Complete weight enumerators of some linear codes and their applications
- Linear codes with two or three weights from quadratic bent functions
- Authentication codes from difference balanced functions
- Complete weight enumerators of some cyclic codes
- Three classes of linear codes with two or three weights
- Two classes of optimal few-weight codes over \({\mathbb{F}}_q+u{\mathbb{F}}_q\)
- Several classes of new projective three-weight or four-weight linear codes and their applications in \(s\)-sum sets
- Quantum codes from trace codes
- A family of optimal ternary cyclic codes from the Niho-type exponent
- Complete weight enumerators of a class of two-weight linear codes
- New upper bounds on the number of non-zero weights of constacyclic codes
- Constructing few-weight linear codes and strongly regular graphs
- The subfield and extended codes of a subclass of optimal three-weight cyclic codes
- On the subfield codes of a subclass of optimal cyclic codes and their covering structures
- Complete weight enumerators of a class of linear codes
- Complete weight enumerators of a class of linear codes
- Four families of minimal binary linear codes with \(w_{\min }/w_{\max }\le 1/2\)
- New constructions of systematic authentication codes from three classes of cyclic codes
- Recent results and problems on constructions of linear codes from cryptographic functions
- Binary linear codes with few weights from Boolean functions
- Hamming weight distributions of multi-twisted codes over finite fields
- Three-weight ternary linear codes from a family of cyclic difference sets
- The punctured codes of two classes of cyclic codes with few weights
- Complete weight enumerators of three classes of linear codes
- The weight distribution of a class of two-weight linear codes derived from Kloosterman sums
- Cones from maximum \(h\)-scattered linear sets and a stability result for cylinders from hyperovals
- Two classes of linear codes and their weight distributions
- Few-weight linear codes over \(\mathbb{F}_p\) from \(t\)-to-one mappings
- Linear codes with few weights over finite fields
- The minimum Hamming distances of repeated-root cyclic codes of length \(6p^s\) and their MDS codes
- Three-weight cyclic codes and their weight distributions
- Several classes of linear codes with few weights from the closed butterfly structure
- Complete weight enumerators for several classes of two-weight and three-weight linear codes
- Complete weight enumerator of torsion codes
- A class of two or three weights linear codes and their complete weight enumerators
- scientific article; zbMATH DE number 1302854 (Why is no real title available?)
- The Hamming distances of repeated-root cyclic codes of length 5 p^s
- A new class of distance-optimal binary cyclic codes and their duals
- Systematic Authentication Codes From Highly Nonlinear Functions
- Weight distributions of Q2DC codes over finite fields
- Two classes of 2-weight and 3-weight linear codes in terms of Kloosterman sums
- A class of three-weight linear codes over finite fields of odd characteristic
- The weight distributions of several classes of few-weight linear codes
- A class of linear codes and their complete weight enumerators
- Complete weight enumerators of a class of linear codes over finite fields
- Complete weight enumerators of two classes of linear codes with a few weights
- Complete weight enumerators of a class of linear codes with two weights
- Complete weight enumerators of a class of linear codes with two or three weights
- Linear codes from planar functions and related covering codes
- A class of linear codes with a few weights
- A class of three-weight linear codes and their complete weight enumerators
- Complete weight enumerators of some linear codes from quadratic forms
- Linear codes with few weights from weakly regular bent functions based on a generic construction
- Two classes of \(p\)-ary bent functions and linear codes with three or four weights
- Complete weight enumerators of a family of three-weight linear codes
- Binary linear codes with two or three weights from Niho exponents
- A construction of linear codes and their complete weight enumerators
This page was built for publication: A coding theory construction of new systematic authentication codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1763702)
