Remarks on computing irreducible characters

0.1. Let G be a connected reductive algebraic group defined over a finite field Fq and let G(Fq) be the finite group of all Fq -rational points of G. We would like to present here a strategy for computing the character table of G(Fq), under the assumption that p, the characteristic of Fq, is sufficiently large. We can assume that G has a simply connected derived group. Indeed, in the general case, we can find a connected reductive group G with simply connected derived group, and a surjective homomorphism f: G -* G whose kernel is a central torus such that G and f are defined over Fq; then the character table