A coding theory construction of new systematic authentication codes
From MaRDI portal
Publication:1763702
DOI10.1016/J.TCS.2004.09.011zbMATH Open1078.68030OpenAlexW1969945141MaRDI QIDQ1763702FDOQ1763702
Authors: Cunsheng Ding, Xuesong Wang 
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
Recommendations
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)
Cites Work
- Weights of irreducible cyclic codes
- Universal hashing and geometric codes
- Title not available (Why is that?)
- Codes Which Detect Deception
- Linear authentication codes: bounds and constructions
- Combinatorial characterizations of authentication codes. II
- A Generic Construction of Cartesian Authentication Codes
- Authentication Theory/Coding Theory
- Title not available (Why is that?)
- On the cardinality of systematic authentication codes via error-correcting codes
- Combinatorial characterizations of authentication codes
- Universal hash functions from exponential sums over finite fields and Galois rings
- Constructions of authentication codes from algebraic curves over finite fields
Cited In (only showing first 100 items - show all)
- Several classes of linear codes with few weights over finite fields
- More constructions of 3-weight linear codes
- Some two-weight and three-weight linear codes
- A construction of \(q\)-ary linear codes with two weights
- A class of optimal ternary cyclic codes and their duals
- Constructions of several classes of linear codes with a few weights
- 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
- Vectorial bent functions and linear codes from quadratic forms
- Binary linear codes from vectorial Boolean functions and their weight distribution
- A note on error-correcting codes for authentication and subliminal channels
- Several classes of linear codes with a few weights from defining sets over \(\mathbb {F}_p+u\mathbb {F}_p\)
- Three-weight ternary linear codes from a family of power functions
- A construction of binary linear codes from Boolean functions
- A construction of \(p\)-ary linear codes with two or three weights
- Three classes of 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
- Complete weight enumerators of some cyclic codes
- A family of optimal ternary cyclic codes from the Niho-type exponent
- Complete weight enumerators of a class of linear codes
- Complete weight enumerators of a class of linear codes
- New constructions of systematic authentication codes from three classes of cyclic codes
- Three-weight ternary linear codes from a family of cyclic difference sets
- Complete weight enumerators of three classes of linear codes
- The weight distribution of a class of two-weight linear codes derived from Kloosterman sums
- Two classes of linear codes and their weight distributions
- Three-weight cyclic codes and their weight distributions
- Complete weight enumerators for several classes of two-weight and three-weight linear codes
- Title not available (Why is that?)
- A class of two or three weights linear codes and their complete weight enumerators
- Two classes of 2-weight and 3-weight linear codes in terms of Kloosterman sums
- Systematic Authentication Codes From Highly Nonlinear Functions
- The Hamming distances of repeated-root cyclic codes of length \(5 p^s\)
- 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 or three weights
- Complete weight enumerators of a class of linear codes with two weights
- 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
- Two pointsets in \(\mathrm{PG}(2,q^n)\) and the associated codes
- Binary linear codes with two or three weights from Niho exponents
- A construction of linear codes and their complete weight enumerators
- A class of linear codes with their complete weight enumerators over finite fields
- Complete weight enumerator for a class of linear codes from defining sets and their applications
- A kind of three-weight linear codes
- Complete weight distributions of two classes of cyclic codes
- On the complete weight enumerators of some reducible cyclic codes
- Codes with few weights arising from linear sets
- Two classes of binary cyclic codes and their weight distributions
- Linear codes with few weights from inhomogeneous quadratic functions
- 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
- On the weight distributions of a class of cyclic codes
- Evaluation of the Hamming weights of a class of linear codes based on Gauss sums
- Title not available (Why is that?)
- Two new classes of projective two-weight linear codes
- A unified construction of optimal and distance optimal two or three-weight codes
- Infinite families of optimal linear codes and their applications to distributed storage systems
- Determination for minimum symbol-pair and RT weights via torsional degrees of repeated-root cyclic codes
- Weight distributions of generalized quasi-cyclic codes over \(\mathbb{F}_q + u \mathbb{F}_q\)
- Construction and comparison of authentication codes
- Simple and Efficient Systematic a-Codes from Error Correcting Codes
- Constructions for several classes of few-weight linear codes and their applications
- Two families of few-weight codes over a finite chain ring
- 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
- A construction of linear codes and strongly regular graphs from \(q\)-polynomials
- Authentication codes based on resilient Boolean maps
- Optimal quinary negacyclic codes with minimum distance four
- Two classes of optimal few-weight codes over \({\mathbb{F}}_q+u{\mathbb{F}}_q\)
- Authentication codes from difference balanced functions
- Several classes of new projective three-weight or four-weight linear codes and their applications in \(s\)-sum sets
- Quantum codes from trace codes
- 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
- Four families of minimal binary linear codes with \(w_{\min }/w_{\max }\le 1/2\)
- 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
- The punctured codes of two classes of cyclic codes with few weights
- Cones from maximum \(h\)-scattered linear sets and a stability result for cylinders from hyperovals
- 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
- Several classes of linear codes with few weights from the closed butterfly structure
- Complete weight enumerator of torsion codes
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)
