Yan-Ping Wang, Zhengbang Zha, Dengguo Feng. New results of binary cyclic codes from sparse polynomials over $$\mathbb {F}_{2^n}$$. // Designs, Codes and Cryptography. – 2026. – DOI: 10.1007/s10623-026-01833-x. – URL: https://doi.org/10.1007/s10623-026-01833-x
Yan-Ping Wang, Zhengbang Zha, & Dengguo Feng (2026). New results of binary cyclic codes from sparse polynomials over $$\mathbb {F}_{2^n}$$. Designs, Codes and Cryptography. https://doi.org/10.1007/s10623-026-01833-x
Yan-Ping Wang, et al. “New results of binary cyclic codes from sparse polynomials over $$\mathbb {F}_{2^n}$$.” Designs, Codes and Cryptography, 2026. doi:10.1007/s10623-026-01833-x.
@article{Wang2026,
title = {New results of binary cyclic codes from sparse polynomials over \$\$\mathbb \{F\}\_\{2^n\}\$\$},
author = {Wang, Yan-Ping and Zha, Zhengbang and Feng, Dengguo},
journal = {Designs, Codes and Cryptography},
year = {2026},
doi = {10.1007/s10623-026-01833-x},
url = {https://doi.org/10.1007/s10623-026-01833-x}
}