Optimal few-weight codes and their subfield codes
From MaRDI portal
Publication:6655509
DOI10.1142/s0219498824502487MaRDI QIDQ6655509
Publication date: 23 December 2024
Published in: Journal of Algebra and its Applications (Search for Journal in Brave)
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Algebraic aspects of posets (06A11)
Cites Work
- Unnamed Item
- Optimal non-projective linear codes constructed from down-sets
- The subfield codes of hyperoval and conic codes
- The subfield codes of several classes of linear codes
- Two families of subfield codes with a few weights
- A class of subfield codes of linear codes and their duals
- Optimal minimal linear codes from posets
- Constructions of near MDS codes which are optimal locally recoverable codes
- Fundamentals of Error-Correcting Codes
- Minimal vectors in linear codes
- Quaternary Linear Codes and Related Binary Subfield Codes
- Optimal Binary Linear Codes From Maximal Arcs
- Infinite Families of Optimal Linear Codes Constructed From Simplicial Complexes
- Two Families of Optimal Linear Codes and Their Subfield Codes
- The Subfield Codes of Ovoid Codes
- A Bound for Error-Correcting Codes
- Constructions of cyclic codes and extended primitive cyclic codes with their applications
This page was built for publication: Optimal few-weight codes and their subfield codes
