Proves that the minimum distance of intermediate constacyclic codes C(q,m,r,ℓ) equals a specific piecewise formula and determines the minimum affine support for non-terminal scalar-residue layers of generalized Reed-Muller 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
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.
citing papers explorer
-
Intermediate Constacyclic Codes and Scalar-Residue Reed--Muller Layers
Proves that the minimum distance of intermediate constacyclic codes C(q,m,r,ℓ) equals a specific piecewise formula and determines the minimum affine support for non-terminal scalar-residue layers of generalized Reed-Muller codes.
-
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.