A Subfield-Based Construction of Optimal Linear Codes Over Finite Fields

DOI10.1109/TIT.2022.3163651MaRDI QIDQ5088563zbMATH OpenOpenAlexFDO

Authors Zhao Hu, Nian Li, Xiangyong Zeng, Lisha Wang, Xiaohu Tang

Publication date 13 July 2022

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2108.09428

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05)

Abstract: In this paper, we construct four families of linear codes over finite fields from the complements of either the union of subfields or the union of cosets of a subfield, which can produce infinite families of optimal linear codes, including infinite families of (near) Griesmer codes. We also characterize the optimality of these four families of linear codes with an explicit computable criterion using the Griesmer bound and obtain many distance-optimal linear codes. In addition, we obtain several classes of distance-optimal linear codes with few weights and completely determine their weight distributions. It is shown that most of our linear codes are self-orthogonal or minimal which are useful in applications.

Cited in

(19)

• A class of subfield codes of linear codes and their duals
• New constructions of optimal subsystem codes
• The construction of LDPC codes based on the subspaces of singular linear space over finite field
• Three families of self-orthogonal codes and their application in optimal quantum codes
• Several classes of linear codes with few weights over finite fields
• Three new constructions of optimal linear codes with few weights
• Binary and ternary leading-systematic LCD codes from special functions
• Several classes of new projective three-weight or four-weight linear codes and their applications in s-sum sets
• Linear codes with few weights over finite fields
• Construction of several infinite families of linear codes with new parameters: Hamming weight enumerators and hull dimensions
• The weight distributions and weight hierarchies of two classes of few-weight linear codes
• Several classes of linear codes with few weights derived from Weil sums
• The dimensions of Galois hulls of linear codes derived from an improved propagation rule and related applications
• Complete weight enumerators and weight hierarchies of two classes of linear codes
• The weight hierarchies of three classes of linear codes
• Four families of q-ary self-orthogonal codes via the defining-set construction
• Several classes of optimal linear codes with few weights from simplicial complexes
• Constructions of several classes of linear codes from Weil sums and their secret sharing schemes
• Hamming weight enumerators and hulls of linear codes with new parameters associated with simplicial complexes

This page was built for publication: A Subfield-Based Construction of Optimal Linear Codes Over Finite Fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5088563)