I am a little confused with the relationship between various bounds for error correcting codes. Does the Plotkin bound mean that one can not achieve the Singleton bound assymptotically? That is, is there any class of error correcting $q$-ary codes with fixed $q$ for which $r+\delta$ goes to 1 as the length goes to infinity?

I am a little confused with the relationship between various bounds for error correcting codes. Does the Plotkin bound mean that one can not achieve the Singleton bound asymptotically? That is, is there any class of error correcting $q$-ary codes with fixed $q$ for which $r+\delta$ goes to 1 as the length goes to infinity?

I am a little confused with the relationship between various bounds for error correcting codes. Does the Plotkin bound mean that one can not achieve the Singleton bound assymptotically?

I am a little confused with the relationship between various bounds for error correcting codes. Does the Plotkin bound mean that one can not achieve the Singleton bound assymptotically? That is, is there any class of error correcting $q$-ary codes with fixed $q$ for which $r+\delta$ goes to 1 as the length goes to infinity?