Pages that link to "Item:Q5298169"

The following pages link to Separating Hash Families: A Johnson-type bound and New Constructions (Q5298169):

Displaying 9 items.

• Constructions and bounds for separating hash families (Q724890) (← links)
• New upper bounds for parent-identifying codes and traceability codes (Q1650430) (← links)
• Bounds and constructions for \(\overline {3}\)-strongly separable codes with length 3 (Q1699269) (← links)
• Some intriguing upper bounds for separating hash families (Q1729948) (← links)
• Sparse hypergraphs: new bounds and constructions (Q2222044) (← links)
• Degenerate Turán densities of sparse hypergraphs (Q2306000) (← links)
• Distributing hash families with few rows (Q2333821) (← links)
• Sparse Hypergraphs with Applications to Coding Theory (Q5130902) (← links)
• Improved List-Decodability and List-Recoverability of Reed–Solomon Codes via Tree Packings (Q6131199) (← links)