Generalized extended codes are shown to be monomially equivalent to certain Hermitian duals, with explicit criteria for controlling Hermitian hull dimension and dual distance, yielding 267 new EA qubit codes and 14 new EA qutrit codes with improved parameters.
Title resolution pending
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
fields
cs.IT 4years
2026 4verdicts
UNVERDICTED 4representative 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.
Extends Chen-Ding construction to even ord_n(q), proves square-root min-distance bounds for self-dual cyclic codes, determines exact parameters for select cases, and refines parameters for improved distances.
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
-
Generalized Extended Codes with Applications in Entanglement-Assisted Qubit and Qutrit Codes
Generalized extended codes are shown to be monomially equivalent to certain Hermitian duals, with explicit criteria for controlling Hermitian hull dimension and dual distance, yielding 267 new EA qubit codes and 14 new EA qutrit codes with improved parameters.
-
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.
-
Self-Dual Cyclic Codes with Improved Minimum Distance Estimates via Extending the Chen-Ding Construction
Extends Chen-Ding construction to even ord_n(q), proves square-root min-distance bounds for self-dual cyclic codes, determines exact parameters for select cases, and refines parameters for improved distances.
-
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.