Janoš Vidali

1. On few-class Q-polynomial association schemes: feasible parameters and\n nonexistence results
   2019/08/27 by Alexander L. Gavrilyuk, Gavrilyuk, Alexander L., Janoš Vidali +3 · 2 citations
   Computer Science · Engineering · Mathematics · #05E30 #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Mathematics #Finite Group Theory Research #graph theory and CDMA systems