Three Classes of Minimal Linear Codes Over the Finite Fields of Odd Characteristic

DOI10.1109/TIT.2019.2918537zbMath1433.94134OpenAlexW2945755178MaRDI QIDQ5211491

Longjiang Qu, Guangkui Xu

Publication date: 28 January 2020

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

Full work available at URL: https://doi.org/10.1109/tit.2019.2918537

zbMATH Keywords

construction of minimal linear codes

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Authentication, digital signatures and secret sharing (94A62)

Related Items (12)

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 ⋮ Minimal linear codes constructed from functions ⋮ The parameters of minimal linear codes ⋮ Minimal linear codes from Maiorana-McFarland functions ⋮ Linear codes from defining sets over \(\mathbb{F}_p + u\mathbb{F}_p\) and their applications ⋮ 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\) ⋮ More constructions of 3-weight linear codes ⋮ Regular dessins uniquely determined by a nilpotent automorphism group ⋮ Wide minimal binary linear codes from the general Maiorana-Mcfarland class

This page was built for publication: Three Classes of Minimal Linear Codes Over the Finite Fields of Odd Characteristic