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)

zbMATH Keywords

idempotentminimum distanceBCH codesWeil sumMattson-Solomon polynomial

Mathematics Subject Classification ID

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

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)