Infinite families of optimal linear codes with positive Griesmer defects are constructed, some yielding optimal LRCs meeting the Cadambe-Mazumdar bound with locality two.
Heng, Projective linear codes from some almost difference sets, IEEE Transactions on Information Theory, vol
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
UNVERDICTED 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Optimal Codes with Positive Griesmer Defects, Related Optimal and Almost Optimal LRC Codes
Infinite families of optimal linear codes with positive Griesmer defects are constructed, some yielding optimal LRCs meeting the Cadambe-Mazumdar bound with locality two.