Reliable Recurrence Algorithm for High-Order Krawtchouk Polynomials

Krawtchouk polynomials (KPs) and their moments are promising techniques for applications of information theory, coding theory, and signal processing. This is due to the special capabilities of KPs in feature extraction and classification processes. The main challenge in existing KPs recurrence algor...

Descripción completa

Detalles Bibliográficos
Autores principales: AL-Utaibi, Khaled A., Abdulhussain, Sadiq H., Mahmmod, Basheera M., Naser, Marwah Abdulrazzaq, Alsabah, Muntadher, Sait, Sadiq M.
Formato: Online Artículo Texto
Lenguaje:English
Publicado: MDPI 2021
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8470097/
https://www.ncbi.nlm.nih.gov/pubmed/34573787
http://dx.doi.org/10.3390/e23091162

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8470097/
https://www.ncbi.nlm.nih.gov/pubmed/34573787
http://dx.doi.org/10.3390/e23091162

Ejemplares similares