Some constructions of (almost) optimally extendable linear codes

DOI10.3934/amc.2022027MaRDI QIDQ6556583

Xiaoshan Quan, Qin Yue, Liqin Hu

Publication date: 17 June 2024

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

zbMATH Keywords

MDS codesNMDS codesirreducible cyclic codes(almost) optimally extendable codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Cites Work

• Unnamed Item
• Unnamed Item
• Complete weight enumerators of some linear codes and their applications
• Weight distributions of cyclic codes with respect to pairwise coprime order elements
• Weight enumerators of reducible cyclic codes and their dual codes
• Construction of some codes suitable for both side channel and fault injection attacks
• Minimal linear codes over finite fields
• MDS or NMDS self-dual codes from twisted generalized Reed-Solomon codes
• At most three-weight binary linear codes from generalized Moisio's exponential sums
• Some (almost) optimally extendable linear codes
• A construction of \(q\)-ary linear codes with irreducible cyclic codes
• On subfield subcodes of modified Reed-Solomon codes (Corresp.)
• Fundamentals of Error-Correcting Codes
• Infinite Families of Near MDS Codes Holding t-Designs
• Constructions of Self-Orthogonal Codes From Hulls of BCH Codes and Their Parameters

Related Items (1)

LCD codes and almost optimally extendable codes from self-orthogonal codes

This page was built for publication: Some constructions of (almost) optimally extendable linear codes