Linear Codes over Fq[x]/(x2) and GR(p2,m) Reaching the Griesmer Bound
Abstract
We construct two series of linear codes over finite ring Fq[x]/(x2) and Galois ring GR(p2,m) respectively reaching the Griesmer bound. They derive two series of codes over finite field Fq by Gray map. The first series of codes over Fq derived from Fq[x]/(x2) are linear and also reach the Griesmer bound in some cases. Many of linear codes over finite field we constructed have two Hamming (non-zero) weights.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.