Too long for a comment, so here goes what came to my mind.
A first (bad) try:
That's a 10x10 matrix of letters and spaces. Cantor is famous (among other things) for his diagonal argument for the existence of uncountable sets. In his proof he constructs a sequence of elements from an (infinitely large) "square" which feels like the same thing we are supposed to do here. The way he does it is he takes the diagonal and (in the case of 1s and 0s) inverts it, for decimals he adds 1 (modulo 10). A very naive approach would be to take the diagonal
SGD EDZQ N and change it in some way it. However, I couldn't find a way that produces something that makes sense to me: A Caesar Cipher shift by any number doesn't yield anything. Switching letters like a<->z, b<->y, etc. is just as bad.
Cantor's pairing function can also be used to produce a sequence of elements from a matrix. Starting at the top left corner, read diagonal lines:
GG, etc. This does not produce anything I would call a message. Starting at another corner doesn't help either.
I'm not giving up just yet, but so far my best guess for his message to me is that I should have payed more attention in math classes.