2000 character limit reached
The Generalized Reed-Muller codes and the radical powers of a modular algebra
Published 28 Jan 2016 in cs.IT and math.IT | (1601.07633v1)
Abstract: First, a new proof of Berman and Charpin's characterization of the Reed-Muller codes over the binary field or over an arbitrary prime field is presented. These codes are considered as the powers of the radical of a modular algebra. Secondly, the same method is used for the study of the Generalized Reed-Muller codes over a non prime field.
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.