Pages that link to "Item:Q2534837"

The following pages link to On covering sets and error-correcting codes (Q2534837):

Displaying 11 items.

• Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
• Bounds on packings and coverings by spheres in \(q\)-ary and mixed Hamming spaces (Q1176382) (← links)
• New upper bounds for binary covering codes (Q1377844) (← links)
• The complexity of total edge domination and some related results on trees (Q2023114) (← links)
• Improved lower bounds on sizes of single-error correcting codes (Q2383982) (← links)
• Domination Parameters in Hypertrees (Q2795956) (← links)
• Two algorithms for determining a minimum independent dominating set (Q3319782) (← links)
• Detecting arrays for effects of single factors (Q6086392) (← links)
• Porous exponential domination number of some graphs (Q6087722) (← links)
• Extended formulations for perfect domination problems and their algorithmic implications (Q6113358) (← links)
• A variation of distance domination in composite networks (Q6494489) (← links)