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

DOI10.1007/s10623-018-0479-0zbMath1442.94057arXiv1612.01096OpenAlexW2585050175MaRDI QIDQ1801098

Aixian Zhang, Jin Li, Ke Qin Feng

Publication date: 26 October 2018

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

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

zbMATH Keywords

Griesmer boundlinear codeGalois ringGray maphomogeneous weight

Mathematics Subject Classification ID

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

Related Items (6)

The homogeneous distance of \((1+u^2)\)-constacyclic codes over \(\mathbb{F}_2[u/\langle u^3\rangle\) and its applications] ⋮ Two families of few-weight codes over a finite chain ring ⋮ Minimal linear codes from defining sets over \(\mathbb{F}_p + u \mathbb{F}_p\) ⋮ Weight distribution of double cyclic codes over \(\mathbb{F}_q + u \mathbb{F}_q\) ⋮ Weight distributions of generalized quasi-cyclic codes over \(\mathbb{F}_q + u \mathbb{F}_q\) ⋮ Weight distribution of double cyclic codes over Galois rings

Cites Work

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

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