A Z₄-linear code of high minimum Lee distance derived from a hyperoval
DOI10.3934/AMC.2011.5.275zbMATH Open1252.94120OpenAlexW2209705785MaRDI QIDQ2275880FDOQ2275880
Authors: Michael Kiermaier, Johannes Zwanzger 
Publication date: 10 August 2011
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/amc.2011.5.275
Recommendations
Blocking sets, ovals, (k)-arcs (51E21) Linear codes (general theory) (94B05) Bounds on codes (94B65) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Ring geometry (Hjelmslev, Barbilian, etc.) (51C05)
Cited In (11)
- New ring-linear codes from dualization in projective Hjelmslev geometries
- The maximal size of 6- and 7-arcs in projective Hjelmslev planes over chain rings of order 9
- Improved estimates via exponential sums for the minimum distance of Z/sub 4/-linear trace codes
- A Z/sub 8/-linear lift of the binary Golay code and a nonlinear binary (96,2/sup 37/,24)-code
- The existence of maximal \((q^2,2)\)-arcs in projective Hjelmslev planes over chain rings of length 2 and odd prime characteristic
- Non-free extensions of the simplex codes over a chain ring with four elements
- The maximum number of homogeneous weights of linear codes over chain rings
- OPTIMAL LINEAR CODES OVER ℤm
- Title not available (Why is that?)
- Distance colorings of hypercubes from \(\mathbb{Z}_2 \mathbb{Z}_4\)-linear codes
- Ovals in \({\mathbb{Z}}^2_{2p} \)
This page was built for publication: A \(\mathbb Z_{4}\)-linear code of high minimum Lee distance derived from a hyperoval
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2275880)
