For any linear code, either the code or its Euclidean dual is an irredundant orthogonal array; the paper also derives new families from known code classes.
Bounds for the min- imum distance and covering radius of orthogonal arrays via their distance distributions
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
method 1
citation-polarity summary
fields
cs.IT 1years
2025 1verdicts
CONDITIONAL 1roles
method 1polarities
use method 1representative citing papers
citing papers explorer
-
On irredundant orthogonal arrays
For any linear code, either the code or its Euclidean dual is an irredundant orthogonal array; the paper also derives new families from known code classes.