“…Suppose that R has a basis consisting of a well-behaving sequence together with a surjective morphism ϕ : R → F n q of F q -algebras. In the following section a sketch will be given how this gives rise to a sequence of codes C(l) and a bound on the minimum distance of these codes following the ideas of [5,6,7,11,12,13,19,20,22,23]. This was generalized to a bound on the generalized Hamming weights by [10].…”