Definition of the Main Problem of Coding Theory

Given a $q$-ary alphabet, a length $n$, and a desired minimal distance $d$, design an $(n,M,d{)}_q$-code for which its total number of codewords $M$ is as large as possible, denoted by $M_q(n,d)$.