Construction criteria and existence results for approximately universal linear space-time codes with reduced decoding complexity