Optimal minimum distance under arbitrary support constraints on parity-check matrices is derived and achievable over large fields, but not always via generalized Reed-Solomon subcodes, as shown by a K_{6,6} incidence counterexample.
Quantum locally recoverable codes
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.IT 1years
2026 1verdicts
ACCEPT 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
On Codes with Support-Constrained Parity Checks
Optimal minimum distance under arbitrary support constraints on parity-check matrices is derived and achievable over large fields, but not always via generalized Reed-Solomon subcodes, as shown by a K_{6,6} incidence counterexample.