Exact lengths of shortest t-dimensional hull embeddings for linear codes are derived via quadratic form theory and group theory, with algorithms that classify codes by Gram matrix types and yield new optimal codes.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.IT 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
Proves exact minimum distance d(C(q,m,r,ℓ)) equals the stated piecewise formula for admissible parameters and determines minimum affine supports of non-terminal scalar-residue Reed-Muller layers.
citing papers explorer
-
Shortest Embeddings of Linear Codes with Arbitrary Hull Dimension
Exact lengths of shortest t-dimensional hull embeddings for linear codes are derived via quadratic form theory and group theory, with algorithms that classify codes by Gram matrix types and yield new optimal codes.
-
Intermediate Constacyclic Codes and Scalar-Residue Reed--Muller Layers
Proves exact minimum distance d(C(q,m,r,ℓ)) equals the stated piecewise formula for admissible parameters and determines minimum affine supports of non-terminal scalar-residue Reed-Muller layers.