10 search results - page 2 / 2 » Maximal sets of mutually orthogonal Latin squares |
COMBINATORICS
1999
13 years 5 months ago
1999
Let k 0 and n 2 be integers. A SOMA, or more specifically a SOMA(k, n), is an n
TIP
2010
13 years 4 months ago
2010
—We address the problem of face recognition by matching image sets. Each set of face images is represented by a subspace (or linear manifold) and recognition is carried out by su...
DM
2000
13 years 6 months ago
2000
A graph is said to be representable modulo n if its vertices can be labelled with distinct integers between 0 and n - 1 inclusive such that two vertices are adjacent if and only i...
ICASSP
2011
IEEE
12 years 10 months ago
2011
IEEE
Considering a two-way amplify-and-forward (AF) relay network and aiming to simultaneously maximize the two users’ mutual information lower bounds in the presence of channel esti...
FSE
2007
Springer
14 years 9 days ago
2007
Springer
Abstract. Given (deterministic) ciphers E and E that can encipher messages of l and n bits, respectively, we construct a cipher E∗ = XLS[E, E] that can encipher messages of l + s...