Pages that link to "Item:Q5048300"
From MaRDI portal
The following pages link to Revisiting and Improving Upper Bounds for Identifying Codes (Q5048300):
Displaying 8 items.
- New bounds on binary identifying codes (Q947104) (← links)
- Improved identification schemes based on error-correcting codes (Q1352426) (← links)
- A class of I.P.P. codes with efficient identification (Q1827562) (← links)
- Bounds on the identifying codes in trees (Q2000553) (← links)
- On robust and dynamic identifying codes (Q3547044) (← links)
- Huge Size Codes for Identification Via a Multiple Access Channel Under a Word-Length Constraint (Q5504188) (← links)
- The \textsc{Red-Blue Separation} problem on graphs (Q6168089) (← links)
- On three domination-based identification problems in block graphs (Q6614535) (← links)