Pages that link to "Item:Q5347250"

The following pages link to On covering radius of codes over R = ℤ2 + uℤ2, where u2 = 0 using chinese euclidean distance (Q5347250):

Displaying 1 item.

• Bounds on covering radius of linear codes with Chinese Euclidean distance over the finite non chain ring \(\mathbb F_2+v\mathbb F_2\) (Q1653025) (← links)