• Publications
• Influence
The Theory of Quaternion Orthogonal Designs
• Mathematics, Computer Science
• IEEE Transactions on Signal Processing
• 2008
This paper builds a theory of these novel quaternion orthogonal designs, offers examples, and provides several construction techniques. Expand
• 75
• 6
• PDF
The Olin curriculum: thinking toward the future
This paper has presented the initial vision of the Franklin W. Olin College of Engineering’s ECE curriculum. Expand
• 59
• 6
• PDF
The Minimum Decoding Delay of Maximum Rate Complex Orthogonal Space–Time Block Codes
• Mathematics, Computer Science
• IEEE Transactions on Information Theory
• 1 August 2007
The growing demand for efficient wireless transmissions over fading channels motivated the development of space-time block codes. Expand
• 32
• 2
On island sequences of labelings with a condition at distance two
• Computer Science, Mathematics
• Discret. Appl. Math.
• 2010
An L(2,1)-labeling of a graph G, first studied by Griggs and Yeh in 1992 [10], is a function f from the vertex set of G to the set of nonnegative integers such that |f (x) − f (y)|>=2 if d(x,y)=1, and |f(x)-f(y) denotes the distance between the pair of vertices x,y. Expand
• 4
• 2
Modeling the spread of fault in majority-based network systems: Dynamic monopolies in triangular grids
• Computer Science, Mathematics
• Discret. Appl. Math.
• 1 July 2012
A graph theoretical model of the spread of fault in distributed computing and communication networks, each element in the network is represented by a vertex of a graph where edges connect pairs of communicating elements, and each colored vertex corresponds to a faulty element at discrete time periods. Expand
• 16
• 1
• PDF
Dynamic monopolies and feedback vertex sets in hexagonal grids
• Computer Science, Mathematics
• Comput. Math. Appl.
• 1 December 2011
This paper establishes a connection between dynamic monopolies and feedback vertex sets which are sets of vertices whose removal results in an acyclic graph. Expand
• 16
• 1
The Final Case of the Decoding Delay Problem for Maximum Rate Complex Orthogonal Designs
• Mathematics, Computer Science
• IEEE Transactions on Information Theory
• 2010
In this paper, the final case is addressed, and it is shown that when the number of columns is congruent to 2 modulo 4, the lower bound on decoding delay cannot be achieved. Expand
• 15
• 1
• PDF
Generalized Williamson and Wallis-Whiteman constructions for improved square order-8 CO STBCs
• Mathematics, Computer Science
• IEEE 16th International Symposium on Personal…
• 11 September 2005
Constructions of square, maximum rate complex orthogonal space-time block codes (CO STBCs) with no zeros . Expand
• 10
• 1
• PDF