Low-weight codewords in cyclic codes

DOI10.1007/S10623-024-01547-YMaRDI QIDQ6985757zbMATH OpenFDO

Authors José Gustavo Coelho, F. E. Brochero Martínez

Publication date 12 May 2025

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10623-024-01547-Y

zbMATH Keywords

binary codescyclic codesdiagonal equationsfinite fieldslow-weight codewordsweight distribution

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Cyclic codes (94B15) Theory of error-correcting codes and error-detecting codes (94B99)

Review text

In this paper, the authors discuss how to compute the number of low-weight codewords in cyclic codes. In the first part, they give a few results relating to counting the number of codewords with weights 2 and 3 in cyclic codes. In the section that consists of the main results, the authors establish a recursive relationship for binary cyclic codes that connects their weight distribution to the number of solutions of associated systems of polynomial equations. In the last section, they presents some applications of the obtained main result.

Cites work

• Fundamentals of Error-Correcting Codes
• Kloosterman sum identities and low-weight codewords in a cyclic code with two zeros
• On binary cyclic codes with minimum distance d=3.
• On the number of solutions of certain diagonal equations over finite fields
• Recent progress on weight distributions of cyclic codes over finite fields
• Three-weight cyclic codes and their weight distributions

This page was built for publication: Low-weight codewords in cyclic codes

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