Minimal Linear Codes From Characteristic Functions
From MaRDI portal
Publication:5124513
DOI10.1109/TIT.2020.2978387zbMath1448.94270arXiv1908.01650MaRDI QIDQ5124513
Sihem Mesnager, Hongming Ru, Yanfeng Qi, Chun-Ming Tang
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/1908.01650
Related Items (11)
Several classes of minimal binary linear codes violating the Ashikhmin-Barg bound ⋮ Minimal linear codes from weakly regular bent functions ⋮ Minimal binary linear codes: a general framework based on bent concatenation ⋮ Two-weight and three-weight linear codes constructed from Weil sums ⋮ Minimal linear codes constructed from functions ⋮ Several classes of linear codes with few weights over finite fields ⋮ On the lower bound for the length of minimal codes ⋮ Further projective binary linear codes derived from two-to-one functions and their duals ⋮ Weight distributions of generalized quasi-cyclic codes over \(\mathbb{F}_q + u \mathbb{F}_q\) ⋮ Several classes of linear codes with few weights from the closed butterfly structure ⋮ Wide minimal binary linear codes from the general Maiorana-Mcfarland class
This page was built for publication: Minimal Linear Codes From Characteristic Functions
