A. [. Brouwer, A. Cohen, and . Neumaier, Distance-Regular Graphs, 1989.

C. [. Brouwer, J. H. Godsil, W. J. Koolen, and . Martin, Width and dual width of subsets in polynomial association schemes, Journal of Combinatorial Theory, Series A, vol.102, issue.2, pp.255-271, 2003.
DOI : 10.1016/S0097-3165(03)00006-2

T. [. Bannai and . Ito, Algebraic Combinatorics I: Association Schemes, 1984.

]. T. Bie87 and . Bier, A family of nonbinary linear codes, Discrete Math, vol.65, issue.1, pp.41-51, 1987.

]. A. Bro90 and . Brouwer, A note on completely regular codes, Discrete Math, vol.83, issue.1, pp.115-117, 1990.

J. Borges, J. Rifà, and V. A. Zinoviev, On $q$-ary linear completely regular codes with $\rho=2$ and antipodal dual, Advances in Mathematics of Communications, vol.4, issue.4, pp.567-578, 2010.
DOI : 10.3934/amc.2010.4.567

]. P. Del73 and . Delsarte, An algebraic approach to the association schemes of coding theory, Philips Res. Rep, issue.10, p.97, 1973.

G. A. Dickie, Q-polynomial structures for association schemes and distance-regular graphs. thesis, 1995.

E. R. Van-dam, J. H. Koolen, and H. Tanaka, Distance-regular graphs. preprint, 2014. arXiv:1410.6294. [Ega81] Y. Egawa. Characterization of H(n, q) by the parameters, J. Combin. Theory Ser. A, issue.2, pp.31108-125, 1981.

]. C. God93, Algebraic Combinatorics, 1993.

J. H. Koolen, W. S. Lee, and W. J. Martin, Characterizing completely regular codes from an algebraic viewpoint, Contemp. Math, vol.531, pp.223-242, 2010.
DOI : 10.1090/conm/531/10470

J. H. Koolen and A. Munemasa, Tight 2-designs and perfect 1-codes in Doob graphs, Journal of Statistical Planning and Inference, vol.86, issue.2, pp.505-513, 2000.
DOI : 10.1016/S0378-3758(99)00126-3

]. D. Leo82 and . Leonard, Orthogonal polynomials, duality, and association schemes, SIAM J. Math. Anal, vol.13, issue.4, pp.656-663, 1982.

W. J. Martinmar00-]-w and . Martin, Completely regular designs of strength one Minimum distance bounds for s-regular codes, J. Algebraic Combin. Des. Codes Cryptogr, vol.3, issue.21, pp.177-1851, 1994.

]. A. Neu92 and . Neumaier, Completely regular codes. Discrete Math, pp.353-360, 1992.

V. [. Rifà and . Zinoviev, Completely regular codes with different parameters and the same distanceregular coset graphs. preprint, 2015.

H. Tanaka, Vertex subsets with minimal width and dual width in Q-polynomial distance-regular graphs, Electron. J. Combin, vol.18, issue.1, p.167, 2011.

]. P. Ter88 and . Terwilliger, The classification of distance-regular graphs of type IIB, Combinatorica, vol.8, issue.1, pp.125-132, 1988.

]. P. Ter92 and . Terwilliger, The subconstituent algebra of an association scheme I, J. Algebraic Combin, vol.1, issue.4, pp.363-388, 1992.