Linear codes arising from the point-hyperplane geometry — Part II: the twisted embedding

Let Γ ¯ be the point-hyperplane geometry of a projective space PG ( V ) , where V is a ( n + 1 ) -dimensional vector space over a finite field F q of order q . Suppose that σ is an automorphism of F q and consider the projective embedding ε σ of Γ ¯ into the projective space PG ( V ⊗ V ⁎ ) mapping the point ( [ x ] , [ ξ ] ) ∈ Γ ¯ to the projective point represented by the pure tensor x σ ⊗ ξ , with ξ ( x ) = 0 . In [11] , we focused on the case σ = 1 and we studied the projective code arising from the projective system Λ 1 = ε 1 ( Γ ¯ ) . Here we focus on the case σ ≠ 1 and we investigate the linear code C ( Λ σ ) arising from the projective system Λ σ = ε σ ( Γ ¯ ) . In particular, after having verified that C ( Λ σ ) is a minimal code, we determine its parameters, its minimum distance as well as its automorphism group. We also give a (geometrical) characterization of its minimum and second lowest weight codewords and determine its maximum weight when q and n are both odd.

Authors

Institutions

Publication Details

Journal
Finite Fields and Their Applications
Published
2026-04-15
DOI
https://doi.org/10.1016/j.ffa.2026.102830
Primary Topic
Coding theory and cryptography
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Linear codes arising from the point-hyperplane geometry — Part II: the twisted embedding

Ilaria Cardinali, Luca Giuzzi
Finite Fields and Their Applications
Coding theory and cryptography
article

Linear codes arising from the point-hyperplane geometry — Part II: the twisted embedding

Ilaria Cardinali, Luca Giuzzi
article en

Abstract

Let Γ ¯ be the point-hyperplane geometry of a projective space PG ( V ) , where V is a ( n + 1 ) -dimensional vector space over a finite field F q of order q . Suppose that σ is an automorphism of F q and consider the projective embedding ε σ of Γ ¯ into the projective space PG ( V ⊗ V ⁎ ) mapping the point ( [ x ] , [ ξ ] ) ∈ Γ ¯ to the projective point represented by the pure tensor x σ ⊗ ξ , with ξ ( x ) = 0 . In [11] , we focused on the case σ = 1 and we studied the projective code arising from the projective system Λ 1 = ε 1 ( Γ ¯ ) . Here we focus on the case σ ≠ 1 and we investigate the linear code C ( Λ σ ) arising from the projective system Λ σ = ε σ ( Γ ¯ ) . In particular, after having verified that C ( Λ σ ) is a minimal code, we determine its parameters, its minimum distance as well as its automorphism group. We also give a (geometrical) characterization of its minimum and second lowest weight codewords and determine its maximum weight when q and n are both odd.

Finite Fields and Their ApplicationsVol. 113
University of Siena (IT), University of Brescia (IT)
Openalex Percentile: Top 100%
Coding theory and cryptography
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.