Minimal linear codes in odd characteristic

DOI10.1109/TIT.2019.2891992MaRDI QIDQ5224062zbMATHOpenAlexWikidataFDO

Authors Daniele Bartoli, Matteo Bonini

Publication date 19 July 2019

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

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

Mathematics Subject Classification ID

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

Abstract: In this paper we generalize constructions in two recent works of Ding, Heng, Zhou to any field $mathbb{F}_q$, $q$ odd, providing infinite families of minimal codes for which the Ashikhmin-Barg bound does not hold.

Recommendations

• Minimal linear codes over finite fields
• Several classes of minimal binary linear codes violating the Ashikhmin-Barg bound
• Three-weight minimal linear codes
• Minimal binary linear codes: a general framework based on bent concatenation
• Variations on minimal linear codes

Cited in

(30)

• Several classes of minimal binary linear codes violating the Ashikhmin-Barg bound
• On the weight distribution of some minimal codes
• Minimal codewords arising from the incidence of points and hyperplanes in projective spaces
• Minimal linear codes from defining sets over \(\mathbb{F}_p + u \mathbb{F}_p\)
• Weight distributions of generalized quasi-cyclic codes over \(\mathbb{F}_q + u \mathbb{F}_q\)
• Wide minimal binary linear codes from the general Maiorana-Mcfarland class
• An inductive construction of minimal codes
• Secret sharing schemes based on the dual of Golay codes
• Optimal binary linear codes from posets of the disjoint union of two chains
• Minimal linear codes from Hermitian varieties and quadrics
• Minimal linear codes derived from weakly regular bent and plateaued functions
• The parameters of minimal linear codes
• Minimal linear codes constructed from hierarchical posets with two levels
• Linear codes from defining sets over \(\mathbb{F}_p + u\mathbb{F}_p\) and their applications
• A family of linear codes from constant dimension subspace codes
• Three combinatorial perspectives on minimal codes
• Four classes of minimal binary linear codes with \(w_{\mathrm{min}}/w_{\mathrm{max}}<1/2\) derived from Boolean functions
• Minimal linear codes constructed from partial spreads
• Minimal linear codes arising from blocking sets
• Construction of minimal linear codes from multi-variable functions
• A geometric characterization of minimal codes and their asymptotic performance
• Several families of \(q\)-ary minimal linear codes with \(w_{\min}/w_{\max} \leq (q-1)/q\)
• A note on the minimal binary linear code
• Minimal linear codes from Maiorana-McFarland functions
• Minimal binary linear codes: a general framework based on bent concatenation
• Optimal minimal linear codes from posets
• Minimal linear codes from weakly regular bent functions
• Strong blocking sets and minimal codes from expander graphs
• Three-weight minimal linear codes
• Minimal linear codes constructed from functions

This page was built for publication: Minimal linear codes in odd characteristic

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