Ashwin Ganesan
Ashwin Ganesan
International School of Engineering (INSOFE), Mumbai, Maharashtra, India
insofe.edu.in üzerinde doğrulanmış e-posta adresine sahip - Ana Sayfa
Başlık
Alıntı yapanlar
Alıntı yapanlar
Yıl
Automorphism group of the complete transposition graph
A Ganesan
Journal of Algebraic Combinatorics 42 (3), 793-801, 2015
252015
On the existence of universally decodable matrices
A Ganesan, PO Vontobel
IEEE transactions on information theory 53 (7), 2572-2575, 2007
232007
Automorphism groups of Cayley graphs generated by connected transposition sets
A Ganesan
Discrete Mathematics 313 (21), 2482-2485, 2013
182013
A virtual input-output framework for transceiver analysis and design for multipath fading channels
A Ganesan, AM Sayeed
IEEE transactions on communications 51 (7), 1149-1161, 2003
142003
An efficient algorithm for the diameter of Cayley graphs generated by transposition trees
A Ganesan
arXiv preprint arXiv:1202.5888, 2012
112012
The performance of an upper bound on the fractional chromatic number of weighted graphs
A Ganesan
Applied Mathematics Letters 23 (5), 597-599, 2010
92010
On some sufficient conditions for distributed Quality-of-Service support in wireless networks
A Ganesan
Networks and Communications, 2009. NETCOM'09. First International Conference …, 2009
92009
On universally decodable matrices for space–time coding
PO Vontobel, A Ganesan
Designs, Codes and Cryptography 41 (3), 325-342, 2006
92006
Bandwidth-efficient exploitation of the degrees of freedom in a multipath fading channel
A Ganesan, AM Sayeed
2000 IEEE International Symposium on Information Theory (Cat. No. 00CH37060 …, 2000
92000
On some sufficient conditions for distributed QoS support in wireless networks
A Ganesan
Technical Report, available from author, 19, 2008
82008
An extreme point result for convexity, concavity and monotonicity of parameterized linear equation solutions
A Ganesan, SR Ross, BR Barmish
Linear algebra and its applications 390, 61-73, 2004
82004
Cayley graphs and symmetric interconnection networks
A Ganesan
arXiv preprint arXiv:1703.08109, 2017
62017
Performance of sufficient conditions for distributed quality-of-service support in wireless networks
A Ganesan
Wireless networks 20 (6), 1321-1334, 2014
62014
Detour distance pattern of a graph
K Abhishek, A Ganesan
International Journal of Pure and Applied Mathematics 87 (5), 719-728, 2013
62013
A virtual MIMO framework for multipath fading channels
A Ganesan, AM Sayeed
Conference Record of the Thirty-Fourth Asilomar Conference on Signals …, 2000
62000
Edge-transitivity of Cayley graphs generated by transpositions
A Ganesan
Discussiones Mathematicae Graph Theory 36 (4), 1035-1042, 2016
42016
Automorphism groups of graphs
A Ganesan
arXiv preprint arXiv:1206.6279, 2012
42012
Diameter of Cayley graphs of permutation groups generated by transposition trees
A Ganesan
arXiv preprint arXiv:1111.3114, 2011
42011
Universally decodable matrices
A Ganesan, PO Vontobel
in Proc. 43rd Allerton Conf. on Communications, Control, and Computing,(Allerton, 2005
42005
An explicit construction of universally decodable matrices
PO Vontobel, A Ganesan
arXiv preprint cs/0508098, 2005
42005
Sistem, işlemi şu anda gerçekleştiremiyor. Daha sonra yeniden deneyin.
Makaleler 1–20