On the minimum distance of a class of binary BCH codes

DOI10.3934/AMC.2024047MaRDI QIDQ7006756zbMATH OpenFDO

Authors Jianying Fang, Zhandong Dai, Lei Hu

Publication date 27 March 2025

Published in Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3934/AMC.2024047

zbMATH Keywords

BCH codesidempotentMattson-Solomon polynomialminimum distanceWeil sum

Mathematics Subject Classification ID

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

Cites work

• Bounds on the minimum distance of the duals of BCH codes
• Fundamentals of Error-Correcting Codes
• scientific article; zbMATH DE number 5296403 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 1209696 (Why is no real title available?)
• scientific article; zbMATH DE number 1284424 (Why is no real title available?)
• scientific article; zbMATH DE number 1553591 (Why is no real title available?)
• Idempotents and the BCH bound
• On Bose distance of a class of BCH codes with two types of designed distances
• On two classes of primitive BCH codes and some related codes
• Parameters of Several Classes of BCH Codes
• Some new results on dimension and Bose distance for various classes of BCH codes
• Studying the locator polynomials of minimum weight codewords of BCH codes
• The Bose and Minimum Distance of a Class of BCH Codes
• The dimension and minimum distance of two classes of primitive BCH codes
• The minimum distance of some narrow-sense primitive BCH codes
• The Weight Distribution of Some Irreducible Cyclic Codes

This page was built for publication: On the minimum distance of a class of binary BCH codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7006756)