Problem
Research questions and friction points this paper is trying to address.
Griesmer defect
optimal codes
locally recoverable codes
Cadambe-Mazumdar bound
linear codes
Optimal Codes with Positive Griesmer Defects, Related Optimal and Almost Optimal LRC Codes
career value
239K/year
🤖 AI Summary
This work investigates the construction of optimal linear codes with positive Griesmer defect and their application to locally recoverable codes (LRCs). By employing algebraic methods over finite fields, the authors systematically construct several infinite families of optimal linear codes that are provably non-equivalent to classical Solomon–Stiffler or Belov codes. The weight distributions and support structures of subcodes are precisely characterized. All constructed codes possess locality two, with some attaining the Cadambe–Mazumdar bound and others coming remarkably close, thereby substantially expanding the design space for high-performance LRCs.
📝 Abstract
Solomon and Stiffler constructed infinitely many families of linear codes meeting the Griesmer bound in 1965. It is well-known in 1990's that certain Griesmer codes (codes with the zero Griesmer defect) are equivalent to Solomon-Stiffler codes or Belov codes. Griesmer codes constructed in some recent papers published in IEEE Trans. Inf. Theory are actually Solomon-Stiffler codes or affine Solomon-Stiffler codes proposed in our previous paper. Therefore it is more challenging to construct optimal codes with positive Griesmer defects.
In this paper, we construct several infinite families of optimal codes with positive Griesmer defects. Then these codes are certainly not equivalent to Solomon-Stiffler codes or Belov codes. Weight distributions and subcode support weight distributions of these optimal codes are determined. On the other hand, some of constructed optimal linear codes are optimal locally recoverable codes (LRCs) meeting the Cadambe-Mazumdar (CM) bound. Some of our constructed optimal codes are very close to the CM bound. Localities of these optimal or almost optimal LRC codes are two.
Innovation
Methods, ideas, or system contributions that make the work stand out.
Griesmer defect
optimal linear codes
locally recoverable codes
Cadambe-Mazumdar bound
weight distribution
🔎 Similar Papers
No similar papers found.
💼 Related Jobs
