Three classes of binary linear codes with good parameters

DOI10.1007/s00200-016-0292-9zbMath1402.94088OpenAlexW2315354138MaRDI QIDQ505659

Man Hua, Yan-Ling Li

Publication date: 26 January 2017

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00200-016-0292-9

zbMATH Keywords

linear codeKloosterman sumoptimal codeminimum distance

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Exponential sums (11T23)

Uses Software

• Code Tables

Cites Work

• Unnamed Item
• Unnamed Item
• Linear codes with two or three weights from quadratic bent functions
• An explicit class of codes with good parameters and their duals
• A class of linear codes with good parameters
• Linear Codes With Two or Three Weights From Weakly Regular Bent Functions
• A Class of Two-Weight and Three-Weight Codes and Their Applications in Secret Sharing
• Linear Codes From Some 2-Designs
• The weights of the orthogonals of the extended quadratic binary Goppa codes
• Searching for linear codes with large minimum distance
• Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes
• Monomial bent functions
• Cyclotomic Linear Codes of Order $3$
• Explicit evaluation of certain exponential sums.
• A class of linear codes with good parameters from algebraic curves
• Almost Asymptotic Regulation of Markovian Jumping Linear Systems in Discrete Time
• Semibent Functions From Dillon and Niho Exponents, Kloosterman Sums, and Dickson Polynomials