Abstract

For q = p m and m ? 1, we construct systematic authentication codes over finite field $$\mathbb{F}_{q}$$ using Galois rings. We give corrections of the construction of [2]. We generalize corresponding systematic authentication codes of [6] in various ways.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call