Completely regular codes with different parameters giving the same distance-regular coset graphs

We construct several classes of completely regular codes with different parameters, but identical intersection array. Given a prime power q and any two natural numbers a,b, we construct completely transitive codes over different fields with covering radius =min{a,b} and identical intersection array, specifically, one code over Fqr for each divisor r of a or b. As a corollary, for any prime power q, we show that distance regular bilinear forms graphs can be obtained as coset graphs from several completely regular codes with different parameters.