On graph-based codes over Ramanujan graphs: existence and design of infinite families
Journal of Algebraic Combinatorics · 2026-05 · 63 (3)
DOI: 10.1007/s10801-025-01488-2 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Algebraic Combinatorics, online erschienen am 27.03.2026. Verfasst von Annayat Ali und 2 weiteren Autor:innen. Die Arbeit nennt 24 Literaturangaben. Gefördert von: UGC-DAE Consortium for Scientific Research, University Grants Commission, Department of Atomic Energy, Government of India.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- UGC-DAE Consortium for Scientific Research, University Grants Commission
- Department of Atomic Energy, Government of India
Zitieren
APA
Ali, A., Mesnager, S., & Raja, R. (2026). On graph-based codes over Ramanujan graphs: existence and design of infinite families. Journal of Algebraic Combinatorics, 63(3). https://doi.org/10.1007/s10801-025-01488-2
Vancouver
Ali A, Mesnager S, Raja R. On graph-based codes over Ramanujan graphs: existence and design of infinite families. Journal of Algebraic Combinatorics. 2026;63(3). doi:10.1007/s10801-025-01488-2
BibTeX
@article{Ali2026,
author = {Ali, Annayat and Mesnager, Sihem and Raja, Rameez},
title = {On graph-based codes over Ramanujan graphs: existence and design of infinite families},
journal = {Journal of Algebraic Combinatorics},
year = {2026},
volume = {63},
number = {3},
doi = {10.1007/s10801-025-01488-2}
}
EUVIMED