The trade-off between [[efficiency]] (large informationrate) and correction capabilities can also be seen from the attempt to, given a fixed codeword length and a fixed correction capability (represented by the [[Hamming distance]] d) maximise the total amount of codewords. A[n,d] is the maximum number of codewords for a given codeword length n and Hamming distance d.