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
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
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.