The minimum distance of codes in an array coming from telescopic semigroups
Christoph Kirfel, Ruud Pellikaan · IEEE Transactions on Information Theory · 1995
The concept of an error-correcting array gives a new bound on the minimum distance of linear codes and a decoding algorithm which decodes up to half this bound. This gives a unified point of view which explains several improvements on the minimum distance of algebraic-geometric codes. Moreover, it is explained in terms of linear algebra and the theory of semigroups only.