Yan-Ping Wang, Dengguo Feng. Infinite families of $$\textrm{t}$$-error-correcting binary cyclic codes from sparse polynomials over $$\mathbb {F}_{2^n}$$. // Designs, Codes and Cryptography. – 2026. – DOI: 10.1007/s10623-026-01949-0. – URL: https://doi.org/10.1007/s10623-026-01949-0
Yan-Ping Wang & Dengguo Feng (2026). Infinite families of $$\textrm{t}$$-error-correcting binary cyclic codes from sparse polynomials over $$\mathbb {F}_{2^n}$$. Designs, Codes and Cryptography. https://doi.org/10.1007/s10623-026-01949-0
Yan-Ping Wang and Dengguo Feng. “Infinite families of $$\textrm{t}$$-error-correcting binary cyclic codes from sparse polynomials over $$\mathbb {F}_{2^n}$$.” Designs, Codes and Cryptography, 2026. doi:10.1007/s10623-026-01949-0.
@article{Wang2026,
title = {Infinite families of \$\$\textrm\{t\}\$\$-error-correcting binary cyclic codes from sparse polynomials over \$\$\mathbb \{F\}\_\{2^n\}\$\$},
author = {Wang, Yan-Ping and Feng, Dengguo},
journal = {Designs, Codes and Cryptography},
year = {2026},
doi = {10.1007/s10623-026-01949-0},
url = {https://doi.org/10.1007/s10623-026-01949-0}
}