Some constructions of (almost) optimally extendable linear codes
From MaRDI portal
Publication:6556583
DOI10.3934/AMC.2022027MaRDI QIDQ6556583FDOQ6556583
Authors: Xiaoshan Quan, Qin Yue, Liqin Hu 
Publication date: 17 June 2024
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Recommendations
Cites Work
- Construction of some codes suitable for both side channel and fault injection attacks
- Title not available (Why is that?)
- Fundamentals of Error-Correcting Codes
- Title not available (Why is that?)
- Weight distributions of cyclic codes with respect to pairwise coprime order elements
- On subfield subcodes of modified Reed-Solomon codes (Corresp.)
- Weight enumerators of reducible cyclic codes and their dual codes
- Complete weight enumerators of some linear codes and their applications
- Minimal linear codes over finite fields
- Some (almost) optimally extendable linear codes
- 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
- Infinite Families of Near MDS Codes Holding t-Designs
- Constructions of Self-Orthogonal Codes From Hulls of BCH Codes and Their Parameters
- A construction of \(q\)-ary linear codes with irreducible cyclic codes
Cited In (2)
This page was built for publication: Some constructions of (almost) optimally extendable linear codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6556583)
