Constructing Gray maps from combinatorial geometries

DOI10.1501/COMMUA1_0000000720MaRDI QIDQ2786867zbMATH OpenOpenAlexFDO

Authors Abdullah Paşa, Bahattin Yildiz

Publication date 23 February 2016

Published in Communications de la Faculté des Sciences de l'Université d'Ankara. Séries A1. Mathematics and Statistics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1501/commua1_0000000720

zbMATH Keywords

homogeneous weight, finite chain ringshyperplanesprojective geometries

Mathematics Subject Classification ID

Finite commutative rings (13M99) Finite affine and projective planes (geometric aspects) (51E15) Linear codes (general theory) (94B05) Cyclic codes (94B15) Combinatorial codes (94B25)

Review text

The authors use projective geometries for obtaining distance preserving Gray maps from finite chain rings and the rings \(R_{k}\), \(k=1, 2, \ldots\) to their residue fields. These maps are constructed with respect to the homogeneous weight, a generalization of Hamming weight for finite rings.

Recommendations

• A combinatorial construction of the Gray map over Galois rings
• The Gray image of constacyclic codes over the finite chain ring \(F_{p^m}[u]/\langle u^k\rangle \)
• Codes over \(R_k\), Gray maps and their binary images
• Gray maps on linear codes over \(\mathbb{F}_p[v]/(v^m-v)\) and their applications
• Duality preserving Gray maps for codes over rings

Cited in

(2)

• A combinatorial construction of the Gray map over Galois rings
• The homogeneous weight for Rk, related gray map and new binary quasi-cyclic codes

This page was built for publication: Constructing Gray maps from combinatorial geometries

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