Boran Kim. Minimal codewords over finite fields derived from certain graphs. // Cryptography and Communications. – 2025. – DOI: 10.1007/s12095-025-00793-8. – URL: https://doi.org/10.1007/s12095-025-00793-8
Boran Kim (2025). Minimal codewords over finite fields derived from certain graphs. Cryptography and Communications. https://doi.org/10.1007/s12095-025-00793-8
Boran Kim. “Minimal codewords over finite fields derived from certain graphs.” Cryptography and Communications, 2025. doi:10.1007/s12095-025-00793-8.
@article{Kim2025,
title = {Minimal codewords over finite fields derived from certain graphs},
author = {Kim, Boran},
journal = {Cryptography and Communications},
year = {2025},
doi = {10.1007/s12095-025-00793-8},
url = {https://doi.org/10.1007/s12095-025-00793-8}
}