Several Classes of Minimal Linear Codes With Few Weights From Weakly Regular Plateaued Functions
From MaRDI portal
Publication:5123857
DOI10.1109/TIT.2019.2956130zbMath1448.94271arXiv1808.03877MaRDI QIDQ5123857
Publication date: 29 September 2020
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1808.03877
Related Items (30)
Several classes of minimal binary linear codes violating the Ashikhmin-Barg bound ⋮ Secret sharing schemes based on the dual of Golay codes ⋮ Small Strong Blocking Sets by Concatenation ⋮ Minimal binary linear codes: a general framework based on bent concatenation ⋮ Constructions of projective linear codes by the intersection and difference of sets ⋮ Several families of \(q\)-ary minimal linear codes with \(w_{\min}/w_{\max} \leq (q-1)/q\) ⋮ Constructions of linear codes with two or three weights from vectorial dual-bent functions ⋮ Two families of few-weight codes over a finite chain ring ⋮ Several classes of new weakly regular bent functions outside \(\mathcal{RF}\), their duals and some related (minimal) codes with few weights ⋮ Construction of minimal linear codes with few weights from weakly regular plateaued functions ⋮ Several classes of linear codes with few weights over finite fields ⋮ On the lower bound for the length of minimal codes ⋮ Vectorial bent functions and linear codes from quadratic forms ⋮ The punctured codes of two classes of cyclic codes with few weights ⋮ Some shortened codes from linear codes constructed by defining sets ⋮ Character sums over a non-chain ring and their applications ⋮ A unified construction of optimal and distance optimal two or three-weight codes ⋮ Codes and pseudo-geometric designs from the ternary \(m\)-sequences with Welch-type decimation \(d = 2 \cdot 3^{(n -1)/2} + 1\) ⋮ Some 3-designs and shortened codes from binary cyclic codes with three zeros ⋮ Some subfield codes from MDS codes ⋮ Further projective binary linear codes derived from two-to-one functions and their duals ⋮ Minimal linear codes from weakly regular plateaued balanced functions ⋮ Linear codes with few weights from weakly regular plateaued functions ⋮ Hamming weight enumerators of multi-twisted codes with at most two non-zero constituents ⋮ Several classes of linear codes with few weights from the closed butterfly structure ⋮ Two families of subfield codes with a few weights ⋮ Hamming weight distributions of multi-twisted codes over finite fields ⋮ A family of projective two-weight linear codes ⋮ New linear codes with few weights derived from Kloosterman sums ⋮ A geometric characterization of minimal codes and their asymptotic performance
This page was built for publication: Several Classes of Minimal Linear Codes With Few Weights From Weakly Regular Plateaued Functions
