Hexagonal metric for linear codes over a finite field

DOI10.1007/S11424-011-9049-5MaRDI QIDQ646745zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

constacyclic codesPlotkin boundconstant weighthexagonal metric

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Cyclic codes (94B15)

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

• scientific article; zbMATH DE number 3756556 (Why is no real title available?)
• scientific article; zbMATH DE number 691473 (Why is no real title available?)
• Algebraic coding theory
• Codes Over Algebraic Integer Rings of Cyclotomic Fields
• Codes over Gaussian integers
• Distance on a Hexagonal Grid
• Lattice constellations and codes from quadratic number fields
• The structure of linear codes of constant weight

Cited in

(1)

• Modeling hexagonal constellations with Eisenstein-Jacobi graphs

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)