New invariants for rank metric codes, with applications to the classification of rank two semifields of order 256
Pith reviewed 2026-05-25 03:54 UTC · model grok-4.3
The pith
New invariants allow complete classification of semifields of order 256 containing a nucleus of order 16.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
The authors prove that by introducing new invariants for the rank metric codes coming from semifields and by accelerating the calculation of previously known invariants, it is possible to distinguish all isomorphism classes of semifields of order 256 with a nucleus of order 16, resulting in their complete classification.
What carries the argument
New invariants for rank metric codes that capture properties distinguishing semifield isomorphism classes.
If this is right
- The complete list of such semifields is now known.
- The new invariants separate classes that older methods could not.
- Computational classification becomes feasible for this order due to the combined techniques.
Where Pith is reading between the lines
- These invariants might extend to classify semifields of larger orders or different nucleus sizes.
- The techniques could inform classifications in related areas like finite geometry.
- Applications in coding theory may benefit from the explicit list of these semifields.
Load-bearing premise
The new invariants combined with accelerated prior invariants are enough to separate every pair of non-isomorphic semifields without error or omission.
What would settle it
Discovering either an additional semifield of order 256 with a 16-element nucleus not appearing in the classification or two distinct classes that the invariants fail to differentiate.
read the original abstract
In this paper we completely classify semifields of order $2^8=256$ containing a nucleus of order $2^4=16$. We introduce new invariants for semifields, and apply new computational techniques for calculating old invariants. Together these make the computational classification significantly quicker.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper introduces new invariants for rank metric codes and applies accelerated computational techniques for existing invariants to completely classify all rank-two semifields of order 256 containing a nucleus of order 16.
Significance. If the classification is exhaustive and the invariants separate isomorphism classes correctly, the result provides a definitive enumeration of these objects, advancing the study of semifields, their associated projective planes, and connections to coding theory. The new invariants for rank metric codes are presented as reusable tools beyond this specific enumeration, and the work is parameter-free with a falsifiable computational claim.
minor comments (2)
- [§1] The manuscript would benefit from an explicit statement in the introduction or §1 of the total number of isomorphism classes obtained and a brief comparison to prior partial classifications of semifields of order 256.
- [§3] Notation for the new invariants (e.g., how they are computed from the rank-metric code associated to the semifield) should include a short worked example for one known semifield to aid readability.
Simulated Author's Rebuttal
We thank the referee for their positive assessment of the manuscript and for recommending acceptance. There are no major comments requiring a point-by-point response.
Circularity Check
No significant circularity identified
full rationale
The paper performs a computational classification of a finite set of algebraic objects (semifields of order 256 with given nucleus) by introducing new invariants and accelerating computation of prior ones. No derivation chain, equations, or fitting procedures are present that reduce any claimed prediction or result to its own inputs by construction. The central claim rests on the empirical separating power of the invariants and exhaustiveness of enumeration, both of which are externally falsifiable by independent recomputation rather than self-referential. No self-citations, ansatzes, or uniqueness theorems are invoked in a load-bearing manner that collapses the argument to prior author work. The work is parameter-free and self-contained against external benchmarks.
Axiom & Free-Parameter Ledger
Reference graph
Works this paper leans on
-
[1]
A. A. Albert. Finite division algebras and finite planes. In Proc. Sympos. Appl. Math., Vol. 10, pages 53–70. Amer. Math. Soc., Providence, RI, 1960
work page 1960
-
[2]
G. N. Alfarano, M. Borello, A. Neri, and A. Ravagnani. Linear cutting blocking sets and minimal codes in the rank metric. Journal of Combinatorial Theory, Series A, 192:105658, 2022
work page 2022
-
[3]
A. Blokhuis, M. Lavrauw, and S. Ball. On the classification of semifield flocks. Adv. Math., 180(1):104– 111, 2003
work page 2003
-
[4]
I. Cardinali, O. Polverino, and R. Trombetti. Semifield planes of orderq 4 with kernelF q2 and center Fq. European J. Combin., 27(6):940–961, 2006
work page 2006
-
[5]
E. F. Combarro, I. F. R´ ua, and J. Ranilla. New advances in the computational exploration of semifields. Int. J. Comput. Math., 88(9):1990–2000, 2011
work page 1990
-
[6]
E. F. Combarro, I. F. R´ ua, and J. Ranilla. Finite semifields with 7 4 elements. Int. J. Comput. Math., 89(13-14):1865–1878, 2012
work page 2012
-
[7]
A. Couvreur, T. Debris-Alazard, and P. Gaborit. On the hardness of code equivalence problems in rank metric. arXiv preprint arXiv:2011.04611, 2020
-
[8]
J. de la Cruz, M. Kiermaier, A. Wassermann, and W. Willems. Algebraic structures of MRD codes. Adv. Math. Commun., 10(3):499–510, 2016
work page 2016
-
[9]
L. E. Dickson. On commutative linear algebras in which division is always uniquely possible. Trans. Amer. Math. Soc., 7(4):514–522, 1906
work page 1906
-
[10]
N. L. Johnson, G. Marino, O. Polverino, and R. Trombetti. Semifields of orderq 6 with left nucleusF q3 and centerF q. Finite Fields Appl., 14(2):456–469, 2008
work page 2008
-
[11]
D. E. Knuth. Finite semifields and projective planes. J. Algebra, 2:182–217, 1965
work page 1965
-
[12]
M. Lavrauw and O. Polverino. Finite semifields. In L. Storme and J. De Beule, editor, Current research topics in Galois geometry, Mathematics Research Developments, pages 127–155. Nova Science, 2011
work page 2011
-
[13]
M. Lavrauw and J. Sheekey. Symplectic 4-dimensional semifields of order 8 4 and 9 4. Des. Codes Cryptogr., 91(5):1935–1949, 2023
work page 1935
- [14]
-
[15]
G. Marino and V. Pepe. On symplectic semifield spreads of PG(5, q 2),qodd. Forum Math., 30(2):497– 512, 2018
work page 2018
-
[16]
G. Marino and O. Polverino. On the nuclei of a finite semifield. In Theory and applications of finite fields, volume 579 of Contemp. Math., pages 123–141. Amer. Math. Soc., Providence, RI, 2012
work page 2012
- [17]
-
[18]
T. H. Randrianarisoa. A geometric approach to rank metric codes and a classification of constant weight codes. Designs, Codes and Cryptography, 88:1331–1348, 2020
work page 2020
-
[19]
I. F. R´ ua, E. F. Combarro, and J. Ranilla. Classification of semifields of order 64. J. Algebra, 322(11):4011–4029, 2009. 7
work page 2009
-
[20]
I. F. R´ ua, E. F. Combarro, and J. Ranilla. Determination of division algebras with 243 elements.Finite Fields Appl., 18(6):1148–1155, 2012
work page 2012
-
[21]
J. Sheekey. MRD codes: constructions and connections. In Combinatorics and finite fields—difference sets, polynomials, pseudorandomness and applications, volume 23 of Radon Ser. Comput. Appl. Math., pages 255–285. De Gruyter, Berlin, [2019]©2019. 8
work page 2019
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.