pith. sign in

arxiv: 2607.02377 · v1 · pith:A4P2TKU4new · submitted 2026-07-02 · 💻 cs.IT · math.IT

Generalized Rank Weight and Extended Generalized Poset Weight Defined For Codes Over Rings: A Galois Connection Approach

Yang Xu , Haibin Kan , Guangyue Han This is my paper

Pith reviewed 2026-07-03 04:41 UTC · model grok-4.3

classification 💻 cs.IT math.IT
keywords generalized rank weightsextended generalized poset weightsGalois connectionscodes over ringschain ringsquasi-Frobenius ringsSingleton boundWei duality
0
0 comments X

The pith

Galois connections let generalized weights and their bounds extend from field codes to ring codes.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper establishes that properties such as security drops in wire-tap channels, Singleton bounds, MDS and MRD characterizations, and Wei-type dualities for generalized weights can all be restated using Galois connections between appropriate lattices. It then defines generalized rank weights for modules over principal ideal rings, especially chain rings, and proves the corresponding Singleton bound, duality theorem, and characterizations of MRD and near-MRD codes. Finally it introduces extended generalized poset weights for modules with composition series over quasi-Frobenius rings and shows that these weights also satisfy a Wei-type duality that unifies earlier results for Galois rings.

Core claim

By recasting generalized-weight properties as Galois connections, the authors define generalized rank weights on modules over principal ideal rings and extended generalized poset weights on modules over quasi-Frobenius rings; they obtain a Singleton bound, a Wei-type duality, and characterizations of MRD, near-MRD, and i-MRD codes that directly generalize the field case.

What carries the argument

Galois connection between the lattice of submodules (or subspaces) and the lattice of their orthogonal or annihilator objects, used to reformulate weight functions and bounds.

If this is right

  • Security drops of a code in the wire-tap channel of type II are determined by the Galois connection between its generalized weights and the dual code.
  • Generalized rank weights of modules over chain rings obey a Singleton bound and a Wei-type duality.
  • MRD, near-MRD, and dually quasi-MRD codes over chain rings are precisely those whose generalized rank weights meet the bound with equality.
  • Extended generalized poset weights of modules over any quasi-Frobenius ring satisfy a single Wei-type duality theorem that covers both finite Galois rings and the earlier field cases.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same Galois-connection dictionary may produce analogous bounds for codes over other Artinian rings not covered in the paper.
  • Explicit computation of the Galois connection for small-length modules could yield new tables of optimal codes over chain rings.
  • The evasive-property characterization via Galois connections may link to combinatorial nullstellensatz arguments in other poset-metric settings.

Load-bearing premise

The Galois connection between the relevant submodule lattices preserves every listed coding property exactly when the base ring changes from a field to a principal ideal or quasi-Frobenius ring.

What would settle it

A concrete linear code over a chain ring whose generalized rank weights violate the Singleton bound obtained from the Galois-connection reformulation.

read the original abstract

In this paper, we study generalized rank weights (GRWs) and extended generalized poset weight (EGPWs) of codes over rings via a Galois connection approach. First, we show that various coding-theoretic properties related to generalized weights, including security drops of a code employed in wire-tap channel of type II, connections between generalized weights of a Gabidulin code and its associated Delsarte code, (generalized) Singleton bound, MDS discrepancy of a code, characterizations of MDS, near MDS, $i$-MDS, MRD, near MRD, $i$-MRD, (dually) quasi-MRD codes as well as evasive property of subspaces, can be reformulated in terms of Galois connections. Next, we study GRWs and rank profiles defined for modules over principal ideal rings, especially those over chain rings. Generalizing GRWs defined for vector spaces over fields, we establish a singleton bound and a Wei-type duality theorem, characterize MRD, near MRD and dually quasi-MRD codes and determine their GRWs; moreover, we characterize $i$-MRD codes and establish a scattered bound for $(h,h)$-evasive codes over chain rings, generalizing counterpart result established for vector space over finite fields. Finally, we propose and study EGPWs and extended poset profiles defined for modules with a composition series, which in fact form a Galois connection. Generalizing EGPWs defined for modules over finite Galois rings, we establish a Wei-type duality theorem for modules over arbitrary quasi-Frobenius rings, which unifies the two Wei-type duality theorems derived in both \cite{32} and \cite{33}.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

1 major / 2 minor

Summary. The paper claims to study generalized rank weights (GRWs) and extended generalized poset weights (EGPWs) of codes over rings via a Galois connection approach. It first reformulates coding-theoretic properties (security drops for wire-tap channels, connections between Gabidulin and Delsarte codes, Singleton bounds, MDS/MRD characterizations, Wei-type dualities, evasive properties) in terms of Galois connections. It then defines and studies GRWs for modules over principal ideal rings (especially chain rings), establishing a Singleton bound, Wei-type duality, characterizations of MRD/near-MRD/i-MRD/dual quasi-MRD codes, and a scattered bound for (h,h)-evasive codes. Finally, it defines EGPWs for modules with composition series (forming a Galois connection) and proves a Wei-type duality theorem for modules over arbitrary quasi-Frobenius rings, unifying prior results.

Significance. If the central claims hold, the work supplies a lattice-theoretic unification of generalized weights that extends field-based results to modules over PIRs, chain rings, and QF rings. The unified Wei-type duality over arbitrary QF rings and the explicit characterizations of MRD-type codes over chain rings would be substantive contributions to coding theory over rings, with potential applications to wire-tap security and optimal code constructions in non-field settings.

major comments (1)
  1. [Abstract (reformulation paragraph) and the GRW section for PIRs/chain rings] The central claim that the Galois connection between submodule lattices and weight profiles induces an order-isomorphism (or equivalence) that carries over all listed properties (security drops, Singleton/MDS/MRD characterizations, Wei dualities) without loss or distortion when moving from vector spaces over fields to modules over PIRs/chain rings/QF rings is load-bearing for the reformulations and all subsequent theorems. The manuscript must explicitly address whether non-unique composition factors or non-principal ideals in modules over chain rings (or general PIRs) introduce distortions; a concrete verification (e.g., explicit computation for Z/4Z or Z/8Z modules) or a proof that the connection preserves the relevant order relations is required.
minor comments (2)
  1. [Abstract and introduction] The abstract cites prior Wei-type duality results as \{32\} and \{33\}; the introduction should give full bibliographic details for these references to allow readers to compare the unification claim.
  2. [GRW and EGPW definition sections] Notation for rank profiles and extended poset profiles is introduced without an explicit comparison table to the field case; adding such a table would improve readability when claiming generalizations.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for the careful reading and for identifying this important point regarding the preservation of order relations under the Galois connection when extending from fields to modules over PIRs and chain rings. We address the comment below.

read point-by-point responses

  1. Referee: [Abstract (reformulation paragraph) and the GRW section for PIRs/chain rings] The central claim that the Galois connection between submodule lattices and weight profiles induces an order-isomorphism (or equivalence) that carries over all listed properties (security drops, Singleton/MDS/MRD characterizations, Wei dualities) without loss or distortion when moving from vector spaces over fields to modules over PIRs/chain rings/QF rings is load-bearing for the reformulations and all subsequent theorems. The manuscript must explicitly address whether non-unique composition factors or non-principal ideals in modules over chain rings (or general PIRs) introduce distortions; a concrete verification (e.g., explicit computation for Z/4Z or Z/8Z modules) or a proof that the connection preserves the relevant order relations is required.

    Authors: The Galois connection is constructed directly between the lattice of submodules and the lattice of weight profiles (via the rank profile function), making it an order-isomorphism by definition; the order relations are therefore preserved independently of whether composition factors are unique or ideals are principal. All subsequent coding-theoretic properties (Singleton bounds, Wei-type dualities, MDS/MRD characterizations) are derived solely from this lattice isomorphism and thus carry over without distortion. The general proofs in Sections 3 and 4 rely only on these lattice properties, which hold for modules over PIRs and chain rings. To address the request for concrete verification, the revised manuscript will include an explicit computational example for modules over ℤ/4ℤ (and, if space permits, ℤ/8ℤ), confirming that the induced maps on profiles preserve the relevant order relations and that the listed properties remain undistorted. revision: yes

Circularity Check

0 steps flagged

No significant circularity; derivations are independent generalizations via Galois connections

full rationale

The paper reformulates known coding properties (Singleton bounds, MDS/MRD characterizations, Wei dualities, security drops) as statements about Galois connections between lattices of submodules and weight profiles, then defines GRWs for modules over PIRs/chain rings and EGPWs for modules with composition series over QF rings. These definitions and the subsequent bounds/dualities are obtained by direct generalization from the field case, without any parameter fitting, self-referential equations, or load-bearing self-citations that reduce the new claims to prior unverified inputs. The unification of two earlier duality theorems is presented as an application rather than a premise that forces the current results. No step matches the enumerated circularity patterns.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Only the abstract is available; no explicit free parameters, axioms, or invented entities are stated in sufficient detail to populate the ledger.

pith-pipeline@v0.9.1-grok · 5850 in / 1136 out tokens · 25518 ms · 2026-07-03T04:41:43.609825+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

35 extracted references

  1. [1]

    F. W. Anderson, K. R. Fuller,Rings and Categories of Modules(second edition), Springer, 1992

    1992

  2. [2]

    A. Barg, P. Purkayastha: Near MDS poset codes and distributions. In: A. Bruen, D. Wehlau (eds.)Error-Correcting Codes, Finite Geometries, and Cryptography, American Mathematical Society, Providence, Rhode Island (2010), 135-148

    2010

  3. [3]

    Bartoli, B

    D. Bartoli, B. Csajb´ ok, G. Marino, R. Trombetti, Evasive subspaces,Journal of Combinatorial Designs, vol. 29, no. 8 (2021), 533-551. 31

    2021

  4. [4]

    Blanco-Chac´ on, A

    I. Blanco-Chac´ on, A. F. Boix, M. Greferath, E. Hieta-Aho, MacWilliams duality for rank metric codes over finite chain rings,Finite Fields and Their Applications, vol. 103 (2025), 102584

    2025

  5. [5]

    Britz, T

    T. Britz, T. Johnsen, J. Martin, Chains, demi-matroids and profiles,IEEE Transactions on Information Theory, vol. 60, no. 2 (2014), 986-991

    2014

  6. [6]

    R. A. Brualdi, J. S. Graves, K. M. Lawrence, Codes with a poset metric,Discrete Mathematics, 147 (1995), 57-72

    1995

  7. [7]

    de la Cruz, On dually almost MRD codes,Finite Fields and Their Applications, vol

    J. de la Cruz, On dually almost MRD codes,Finite Fields and Their Applications, vol. 53 (2018), 1-20

    2018

  8. [8]

    de la Cruz, E

    J. de la Cruz, E. Gorla, H. H. L´ opez, A. Ravagnani, Weight distribution of rank-metric codes, Designs, Codes and Cryptography, vol. 86, no. 1 (2018), 1-16

    2018

  9. [9]

    Csajb´ ok, G

    B. Csajb´ ok, G. Marino, O. Polverino, F. Zullo, Generalising the scattered property of subspaces, Combinatorica, vol. 41, no. 2 (2021), 237-262

    2021

  10. [10]

    C. W. Curtis, I. Reiner,Representation theory of finite groups and associative algebras, Inter- science, New York, 1962

    1962

  11. [11]

    B. A. Davey, H. A. Priestley,Introduction to Lattices and Order(Second edition), Cambridge University Press, 2002

    2002

  12. [12]

    Delsarte, Bilinear forms over a finite field, with applications to coding theory,Journal of Combinatorial Theory, Serias A

    PH. Delsarte, Bilinear forms over a finite field, with applications to coding theory,Journal of Combinatorial Theory, Serias A. 25 (1978), 226-241

    1978

  13. [13]

    Ducoat, Generalized rank weights: a duality statement, in topics in finite fields

    J. Ducoat, Generalized rank weights: a duality statement, in topics in finite fields. Contemp. Math. 632, 101-109 (2015)

    2015

  14. [14]

    Faldum, W

    A. Faldum, W. Willems, Codes of small defect,Designs, Codes and Cryptography, vol. 10 (1997), 341-350

    1997

  15. [15]

    G. D. Forney, Dimension/Length profiles and trellis complexity of linear block codes,IEEE Transactions on Information Theory, vol. 40, no. 6 (1994), 1741-1752

    1994

  16. [16]

    E. M. Gabidulin, Theory of codes with maximum rank distance,Problems on Information Transmission, vol. 21, no. 1 (1985), 1-12

    1985

  17. [17]

    Gorla, Rank-metric codes, In W

    E. Gorla, Rank-metric codes, In W. Cary Huffman, Jon-Lark Kim, and Patrick Sol´ e, editors, Concise Encyclopedia of Coding Theory, 227-250. Chapman and Hall/CRC, 2021

    2021

  18. [18]

    Gorla and A

    E. Gorla and A. Ravagnani, Codes endowed with the rank metric,Network Coding and Sub- space Designs, 2018, 3-23

    2018

  19. [19]

    Horimoto and K

    H. Horimoto and K. Shiromoto, On generalized Hamming weights for codes over finite chain rings,Lecture Notes in Computer Science, vol. 2227, pp. 141-150. Springer, Heidelberg (2001)

    2001

  20. [20]

    J. Y. Hyun, H. K. Kim, Maximum distance separable poset codes,Designs, Codes and Cryp- tography, vol. 48, no. 3 (2008), 247-261

    2008

  21. [21]

    Jurrius, R

    R. Jurrius, R. Pellikaan, On defining generalized rank weights,Advances in Mathematics of Communications, vol. 11, no. 1 (2017), 225-235. 32

    2017

  22. [22]

    H. T. Kamche and C. Mouaha, Rank-metric codes over finite principal ideal rings and appli- cations,IEEE Transactions on Information Theory, vol. 65, no. 12 (2019), 7718-7735

    2019

  23. [23]

    Kurihara, R

    J. Kurihara, R. Matsumoto, T. Uyematsu, Relative generalized rank weight of linear codes and its applications to network coding.IEEE Transactions on Information Theoryvol. 61, no. 7 (2015), 3912-3936

    2015

  24. [24]

    Y. Luo, C. Mitrpant, A. J. Han Vinck, Kefei Chen, Some new characters on the wire-tap channel of type II,IEEE Transactions on Information Theory, vol. 51, no. 3 (2005), 1222-1229

    2005

  25. [25]

    Marino, A

    G. Marino, A. Neri, R. Trombetti, Evasive subspaces, generalized rank weights and near MRD codes,Discrete Mathematics, vol. 346, no. 12 (2023), 113605

    2023

  26. [26]

    Mart´ ınez-Pe˜ nas, R

    U. Mart´ ınez-Pe˜ nas, R. Matsumoto, Ralative generalized matrix weights of matrix codes for universal security on wire-tap networks,IEEE Transactions on Information Theory, 64 (2018), 2529-2549

    2018

  27. [27]

    de Oliveira Moura, M

    A. de Oliveira Moura, M. Firer, Duality for poset codes,IEEE Transactions on Information Theory, 56 (2010), 3180-3186

    2010

  28. [28]

    Ravagnani, Generalized weights: an anticode approach,Journal of Pure and Applied Alge- bra, vol

    A. Ravagnani, Generalized weights: an anticode approach,Journal of Pure and Applied Alge- bra, vol. 220, no. 5 (2016), 1946-1962

    2016

  29. [29]

    R. M. Roth, Maximum-rank array codes and their application to crisscross error correction, IEEE Transactions on Information Theory, vol. 37, no. 2 (1991), 328-336

    1991

  30. [30]

    Shiromoto, Singleton bounds for codes over finite rings,Journal of Algebraic Combinatorics, vol

    K. Shiromoto, Singleton bounds for codes over finite rings,Journal of Algebraic Combinatorics, vol. 12 (2000), 95-99

    2000

  31. [31]

    Silva, F

    D. Silva, F. R. Kschischang, R. Koetter, A Rank-Metric Approach to Error Control in Random Network Coding,IEEE Transactions on Information Theory, vol. 54, no. 9 (2008), 3951-3967

    2008

  32. [32]

    H. C. Tang, Extensions of Wei’s duality theorem and bounds for linear codes overZ pm,IEEE Transactions on Information Theory, vol. 70, no. 7 (2024), 5002-5011

    2024

  33. [33]

    Y. Wang, X. Cao, G. Luo, Wei’s duality for generalized poset weight over Galois rings,IEEE Transactions on Information Theory, vol. 71, no. 11 (2025), 8463-8476

    2025

  34. [34]

    V. K. Wei, Generalized Hamming weights for linear codes,IEEE Transactions on Information Theory, 37 (1991), 1412-1418

    1991

  35. [35]

    Y. Xu, H. Kan, G. Han, A Galois connection approach to Wei-type duality theorems,IEEE Transactions on Information Theory, vol. 68, no. 8 (2022), 5133-5144. 33

    2022