The Gilbert type bound for codes in the title is reviewed, both for small and large alphabets. Constructive lower bounds better than these existential bounds are derived from geometric codes, either over Fp or Fp2 , or over even degree extensions of Fp. In the latter case the approach is concatenation with a good code for the Hamming metric as outer code and a short code for the Lee metric as a...

In the literature on parameterized graph problems, there has been an increased effort in recent years aimed at exploring novel notions of edit-distance that are more powerful than size a modulator to specific class. this line research, Bulian and Dawar [Algorithmica, 75 (2016), pp. 363--382] introduced notion elimination distance showed deciding whether given most $k$ any minor-closed class gra...