—There is the long-standing question whether the class of cyclic codes is asymptotically good. By an old result of Lin and Weldon, long Bose–Chaudhuri–Hocquenhem (BCH) codes are asymptotically bad. Berman proved that cyclic codes are asymptotically bad if only finitely many primes are involved in the lengths of the codes. We investigate further classes of… (More)
General arguments of Baumslag and Bieri guarantee that any torsion-free finitely generated metabelian group of finite Prüfer rank can be embedded in a metabelian constructible group. Here, we consider the metric behavior of a rich class of examples and analyze the distortions of specific embeddings.