Generalized Extended Hamming Codes over Galois Ring of Characteristic $2^{n}$
Abstract: In this paper, we introduce generalized extended Hamming codes over Galois rings $GR(2n,m)$ of characteristic $2n$ with extension degree $m$. Furthermore we prove that the minimum Hamming weight of generalized extended Hamming codes over $GR(2n,m)$ is 4 and the minimum Lee weight of generalized extended Hamming codes over $GR(8,m)$ is 6 for all $m \geq 3$.
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.