The following pages link to (Q6483300):
Displaying 8 items.
- A [45,13] code with minimal distance 16 (Q917526) (← links)
- On the minimum size of binary codes with length \(2R+4\) and covering radius \(R\) (Q1009034) (← links)
- New results on codes with covering radius 1 and minimum distance \(2\) (Q1781002) (← links)
- On codes with covering radius 1 and minimum distance 2 (Q1866450) (← links)
- On the minimum distance of Castle codes (Q1943464) (← links)
- On a Sufficient Condition to Attain Minimum Square Distance in Euclidean Codes (Q3088412) (← links)
- The minimum distance of codes in an array coming from telescopic semigroups (Q4880297) (← links)
- On codes with distances \(d\) and \(n\) (Q6173474) (← links)
