Improved upper bounds on the number of non-zero weights of cyclic codes

DOI10.1109/TIT.2024.3356601MaRDI QIDQ6576591zbMATH OpenFDO

Authors Bocong Chen, Yuqing Fu, Hongwei Liu

Publication date 23 July 2024

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

Full work available at URL https://doi.org/10.1109/TIT.2024.3356601

Mathematics Subject Classification ID

Information and communication theory, circuits (94-XX)

Cited in

(5)

• New upper bounds on the number of non-zero weights of constacyclic codes
• A tight upper bound on the number of nonzero weights of a quasi-cyclic code
• Irreducible factorizations of polynomials \(x^{p^k + 1} - bx + b\) over a finite field
• Some bounds on the cardinality of the b-symbol weight spectrum of codes
• A tight upper bound on the number of nonzero weights of a quasi-twisted code

This page was built for publication: Improved upper bounds on the number of non-zero weights of cyclic codes

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