The following pages link to New upper bounds on Lee codes (Q2492226):
Displayed 6 items.
- The \(k\)-distance independence number and 2-distance chromatic number of Cartesian products of cycles (Q723608) (← links)
- The 2-distance coloring of the Cartesian product of cycles using optimal Lee codes (Q765320) (← links)
- Tilings in Lee metric (Q1003602) (← links)
- On perfect Lee codes (Q1045037) (← links)
- Semidefinite programming bounds for Lee codes (Q2312798) (← links)
- Fundamentals of coding type problems (Q3637813) (← links)