Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
158 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Linear Codes over $\mathbb{F}_{q}[x]/(x^2)$ and $GR(p^2,m)$ Reaching the Griesmer Bound (1612.01096v1)

Published 4 Dec 2016 in cs.IT and math.IT

Abstract: We construct two series of linear codes over finite ring $\mathbb{F}{q}[x]/(x2)$ and Galois ring $GR(p2,m)$ respectively reaching the Griesmer bound. They derive two series of codes over finite field $\mathbb{F}{q}$ by Gray map. The first series of codes over $\mathbb{F}{q}$ derived from $\mathbb{F}{q}[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.

Summary

We haven't generated a summary for this paper yet.