Hexagonal metric for linear codes over a finite field
From MaRDI portal
Publication:646745
DOI10.1007/S11424-011-9049-5zbMATH Open1233.94029OpenAlexW2110517438MaRDI QIDQ646745FDOQ646745
Authors: Ying Gao 
Publication date: 17 November 2011
Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11424-011-9049-5
Recommendations
- The metric structure of linear codes
- Codes from generalized hexagons
- Linear codes over finite fields and finite projective geometries
- A metric for codes over residue class rings
- scientific article; zbMATH DE number 1795249
- On the least covering radius of binary linear codes of dimension 6
- Codes for the \(m\)-metric
- New metrics arising from matroids of linear codes
- On linear programming bounds for codes in polynomial metric spaces
- Linear codes close to the Griesmer bound and the related geometric structures
Cites Work
- The structure of linear codes of constant weight
- Title not available (Why is that?)
- Algebraic coding theory
- Distance on a Hexagonal Grid
- Codes Over Algebraic Integer Rings of Cyclotomic Fields
- Codes over Gaussian integers
- Title not available (Why is that?)
- Lattice constellations and codes from quadratic number fields
Cited In (1)
This page was built for publication: Hexagonal metric for linear codes over a finite field
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q646745)
