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.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
