2000 character limit reached
Generalized Reed-Muller codes over Galois rings
Published 16 Jan 2018 in cs.IT and math.IT | (1801.05114v1)
Abstract: Recently, Bhaintwal and Wasan studied the Generalized Reed-Muller codes over the prime power integer residue ring. In this paper, we give a generalization of these codes to Generalized Reed-Muller codes over Galois rings.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.