Linear codes over F_q[x]/(x^2) and GR(p^2,m) reaching the Griesmer bound

DOI10.1007/S10623-018-0479-0zbMATH Open1442.94057arXiv1612.01096OpenAlexW2585050175MaRDI QIDQ1801098FDOQ1801098

Authors: Jin Li, Aixian Zhang, Keqin Feng 

Publication date: 26 October 2018

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Abstract: We construct two series of linear codes over finite ring $mathbb{F}_q[x]/(x^2)$ and Galois ring $GR(p^2,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]/(x^2)$ 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.

Full work available at URL: https://arxiv.org/abs/1612.01096

Recommendations

• New constructions of codes meeting the Griesmer bound
• Further classifications of codes meeting the Griesmer bound (Corresp.)
• On linear codes over \(\mathbb Z_2\)
• On the nonexistence of \(g\)-ary linear codes attaining the Griesmer bound.
• Characterization of two classes of codes that attain the Griesmer bound

zbMATH Keywords

Gray mapGriesmer boundhomogeneous weightlinear codeGalois ring

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Other character sums and Gauss sums (11T24)

Cites Work

• Title not available (Why is that?)
• The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
• Algebraically punctured cyclic codes
• A Bound for Error-Correcting Codes
• A Griesmer bound for linear codes over finite quasi-Frobenius rings
• Gray isometries for finite chain rings and a nonlinear ternary (36, 3/sup 12/, 15) code
• On codes meeting the Griesmer bound.
• Homogeneous weights and exponential sums.
• A combinatorial construction of the Gray map over Galois rings
• A construction of some \([n,k,d;q]\)-codes meeting the Griesmer bound

Cited In (11)

• Title not available (Why is that?)
• Weight distributions of generalized quasi-cyclic codes over \(\mathbb{F}_q + u \mathbb{F}_q\)
• Weight distribution of double cyclic codes over Galois rings
• Minimal linear codes from defining sets over \(\mathbb{F}_p + u \mathbb{F}_p\)
• The Griesmer codes of Belov type and optimal quaternary codes via multi-variable functions
• Two families of few-weight codes over a finite chain ring
• The homogeneous distance of \((1+u^2)\)-constacyclic codes over \(\mathbb{F}_2[u]/\langle u^3\rangle\) and its applications
• Weight distribution of double cyclic codes over \(\mathbb{F}_q + u \mathbb{F}_q\)
• On the bounds and achievability about the ODPC of \(\mathrm{GRM}(2,m)^*\) over prime fields for increasing message length
• Linear codes close to the Griesmer bound and the related geometric structures
• Construction of one-Gray weight codes and two-Gray weight codes over \(\mathbb{Z}_{4} + u \mathbb{Z}_{4}\)

This page was built for publication: Linear codes over \(\mathbb {F}_{q}[x]/(x^2)\) and \(\mathrm{GR}(p^2,m)\) reaching the Griesmer bound

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1801098)