The following pages link to Sanna Ranto (Q211464):
Displaying 15 items.
- On binary linear \(r\)-identifying codes (Q540477) (← links)
- New bounds on binary identifying codes (Q947104) (← links)
- Improved bounds on identifying codes in binary Hamming spaces (Q966138) (← links)
- Upper bounds for binary identifying codes (Q1012154) (← links)
- Families of optimal codes for strong identification (Q1613402) (← links)
- On strongly identifying codes (Q1613540) (← links)
- (Q2741420) (← links)
- Improved Upper Bounds on Binary Identifying Codes (Q3549076) (← links)
- (Q3615964) (← links)
- (Q4474243) (← links)
- (Q4667607) (← links)
- Two families of optimal identifying codes in binary Hamming spaces (Q4674500) (← links)
- Optimal linear identifying codes (Q4680118) (← links)
- Graphs where every k-subset of vertices is an identifying set (Q5413903) (← links)
- On codes identifying sets of vertices in Hamming spaces (Q5947251) (← links)
