81 research outputs found
Authentication Codes Based on Resilient Boolean Maps
We introduce new constructions of systematic authentication codes over finite fields and Galois rings. One code is built over finite fields using resilient functions and it provides optimal impersonation and substitution probabilities. Other two proposed codes are defined over Galois rings, one is based on resilient maps and it attains optimal probabilities as well, while the other uses maps whose Fourier transforms get higher values. Being the finite fields special cases of Galois rings, the first code introduced for Galois rings apply also at finite fields. For the special case of characteristic , the maps used at the second case in Galois rings are bent indeed, and this case is subsumed by our current general construction of characteristic , with
On the complete weight enumerators of some linear codes with a few weights
Linear codes with a few weights have important applications in authentication
codes, secret sharing, consumer electronics, etc.. The determination of the
parameters such as Hamming weight distributions and complete weight enumerators
of linear codes are important research topics. In this paper, we consider some
classes of linear codes with a few weights and determine the complete weight
enumerators from which the corresponding Hamming weight distributions are
derived with help of some sums involving Legendre symbol
- …