Hamming codes, read as constacyclic codes, yield covering sequences whose length is within a factor q/(q−1) of optimal for every prime power q.
Title resolution pending
1 Pith paper cite this work, alongside 1 external citations. Polarity classification is still indexing.
1
Pith paper citing it
1
external citations · OpenAlex
fields
cs.IT 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Covering Sequences and Covering-Sequences Codes
Hamming codes, read as constacyclic codes, yield covering sequences whose length is within a factor q/(q−1) of optimal for every prime power q.