Minimal linear codes over finite fields

DOI10.1016/J.FFA.2018.08.010zbMATH Open1401.94262arXiv1803.09988OpenAlexW2964302506WikidataQ129354939 ScholiaQ129354939MaRDI QIDQ1800699FDOQ1800699

Authors: Ziling Heng, Cunsheng Ding, Zhengchun Zhou 

Publication date: 24 October 2018

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Abstract: As a special class of linear codes, minimal linear codes have important applications in secret sharing and secure two-party computation. Constructing minimal linear codes with new and desirable parameters has been an interesting research topic in coding theory and cryptography. Ashikhmin and Barg showed that $w_{min}/w_{max}>(q-1)/q$ is a sufficient condition for a linear code over the finite field $gf(q)$ to be minimal, where $q$ is a prime power, $w_{min}$ and $w_{max}$ denote the minimum and maximum nonzero weights in the code, respectively. The first objective of this paper is to present a sufficient and necessary condition for linear codes over finite fields to be minimal. The second objective of this paper is to construct an infinite family of ternary minimal linear codes satisfying $w_{min}/w_{max}leq2/3$. To the best of our knowledge, this is the first infinite family of nonbinary minimal linear codes violating Ashikhmin and Barg's condition.

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

Recommendations

• Three-weight minimal linear codes
• Several families of \(q\)-ary minimal linear codes with \(w_{\min}/w_{\max} \leq (q-1)/q\)
• Minimal binary linear codes: a general framework based on bent concatenation
• Yet another variation on minimal linear codes
• The parameters of minimal linear codes

zbMATH Keywords

linear codeminimal vectorminimal code

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65)

Cites Work

• Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes
• On minimal and quasi-minimal linear codes
• Secret sharing schemes from three classes of linear codes
• Title not available (Why is that?)
• Fundamentals of Error-Correcting Codes
• Minimal vectors in linear codes
• Linear Codes From Some 2-Designs
• Further properties of several classes of Boolean functions with optimum algebraic immunity
• Three-weight cyclic codes and their weight distributions
• Krawtchouk polynomials and universal bounds for codes and designs in Hamming spaces
• On equidistant constant weight codes
• Title not available (Why is that?)
• Linear codes from simplicial complexes
• Minimal Binary Linear Codes

Cited In (64)

• Projective binary linear codes from special Boolean functions
• A construction of optimal locally recoverable codes
• Linear codes from weakly regular plateaued functions and their secret sharing schemes
• Some minimal cyclic codes over finite fields
• Constructions of near MDS codes which are optimal locally recoverable codes
• Yet another variation on minimal linear codes
• Weight distributions of generalized quasi-cyclic codes over \(\mathbb{F}_q + u \mathbb{F}_q\)
• Variations on minimal linear codes
• Shortened Linear Codes Over Finite Fields
• Three-weight linear codes from Weil sums
• Minimal linear codes from defining sets over \(\mathbb{F}_p + u \mathbb{F}_p\)
• A geometric characterization of minimal codes and their asymptotic performance
• A note on the minimal binary linear code
• Minimal linear codes from weakly regular bent functions
• Several classes of minimal binary linear codes violating the Ashikhmin-Barg bound
• A family of linear codes from constant dimension subspace codes
• Several families of \(q\)-ary minimal linear codes with \(w_{\min}/w_{\max} \leq (q-1)/q\)
• Minimal linear codes from Maiorana-McFarland functions
• Optimal minimal linear codes from posets
• Hamming weight enumerators of multi-twisted codes with at most two non-zero constituents
• Weight distributions for projective binary linear codes from Weil sums
• Minimal binary linear codes: a general framework based on bent concatenation
• Minimal linear codes constructed from functions
• Minimal linear codes in odd characteristic
• Characterization of some minimal codes for secret sharing
• Some classes of LCD codes and self-orthogonal codes over finite fields
• Minimal linear codes arising from blocking sets
• A construction of \(p\)-ary linear codes with two or three weights
• Construction of minimal linear codes from multi-variable functions
• On minimal and quasi-minimal linear codes
• Three-weight minimal linear codes
• Constructing few-weight linear codes and strongly regular graphs
• Wide minimal binary linear codes from the general Maiorana-Mcfarland class
• Four families of minimal binary linear codes with \(w_{\min }/w_{\max }\le 1/2\)
• A family of projective two-weight linear codes
• Hamming weight distributions of multi-twisted codes over finite fields
• Minimal codewords arising from the incidence of points and hyperplanes in projective spaces
• Four classes of minimal binary linear codes with \(w_{\mathrm{min}}/w_{\mathrm{max}}<1/2\) derived from Boolean functions
• Linear cutting blocking sets and minimal codes in the rank metric
• Constructions of projective linear codes by the intersection and difference of sets
• The parameters of minimal linear codes
• An inductive construction of minimal codes
• A family of distance-optimal minimal linear codes with flexible parameters
• Several classes of exponential sums and three-valued Walsh spectrums over finite fields
• Minimal linear codes from Hermitian varieties and quadrics
• The separation of binary relative three-weight codes and its applications
• Minimal trellises for block codes
• On the minimum length of linear codes over the field of 9 elements
• On the weight distribution of some minimal codes
• LCD codes and self-orthogonal codes in generalized dihedral group algebras
• Some constructions of (almost) optimally extendable linear codes
• Two-valued cross correlation distributions between binary \(m\) sequences and their decimation sequences
• Linear codes from defining sets over \(\mathbb{F}_p + u\mathbb{F}_p\) and their applications
• Minimal linear codes constructed from partial spreads
• Minimal linear codes derived from weakly regular bent and plateaued functions
• New infinite families of near MDS codes holding \(t\)-designs
• Several classes of new weakly regular bent functions outside \(\mathcal{RF}\), their duals and some related (minimal) codes with few weights
• Near MDS codes with dimension 4 and their application in locally recoverable codes
• Ternary self-orthogonal codes from weakly regular bent functions and their application in LCD codes
• Combinatorial \(t\)-designs and strongly regular graphs from projective codes over finite fields
• A class of three-weight linear codes over finite fields of odd characteristic
• Minimal linear codes constructed from hierarchical posets with two levels
• Infinite families of \(t\)-designs and strongly regular graphs from punctured codes
• Infinite families of minimal binary codes via Krawtchouk polynomials

This page was built for publication: Minimal linear codes over finite fields

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