Minimal linear codes in odd characteristic
From MaRDI portal
Publication:5224062
DOI10.1109/TIT.2019.2891992zbMATH Open1432.94161arXiv1811.06829OpenAlexW2963208638WikidataQ128564706 ScholiaQ128564706MaRDI QIDQ5224062FDOQ5224062
Authors: Daniele Bartoli, Matteo Bonini 
Publication date: 19 July 2019
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Abstract: In this paper we generalize constructions in two recent works of Ding, Heng, Zhou to any field , odd, providing infinite families of minimal codes for which the Ashikhmin-Barg bound does not hold.
Full work available at URL: https://arxiv.org/abs/1811.06829
Recommendations
Cited In (29)
- Weight distributions of generalized quasi-cyclic codes over \(\mathbb{F}_q + u \mathbb{F}_q\)
- Three Combinatorial Perspectives on Minimal Codes
- Secret sharing schemes based on the dual of Golay codes
- Linear codes from defining sets over \(\mathbb{F}_p + u\mathbb{F}_p\) and their applications
- Strong blocking sets and minimal codes from expander graphs
- Minimal linear codes from defining sets over \(\mathbb{F}_p + u \mathbb{F}_p\)
- Minimal linear codes constructed from partial spreads
- 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
- Minimal linear codes derived from weakly regular bent and plateaued 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
- Minimal binary linear codes: a general framework based on bent concatenation
- Minimal linear codes constructed from functions
- Minimal linear codes arising from blocking sets
- Construction of minimal linear codes from multi-variable functions
- Wide minimal binary linear codes from the general Maiorana-Mcfarland class
- 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
- The parameters of minimal linear codes
- Minimal linear codes constructed from hierarchical posets with two levels
- An inductive construction of minimal codes
- Minimal linear codes from Hermitian varieties and quadrics
- Optimal binary linear codes from posets of the disjoint union of two chains
- On the weight distribution of some minimal codes
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)
