The following pages link to Strongly separable codes (Q285247):
Displaying 9 items.
- Asymptotically optimal \(\overline {2}\)-separable codes with length 4 (Q507954) (← links)
- Bounds and constructions for \(\overline {3}\)-strongly separable codes with length 3 (Q1699269) (← links)
- Signature codes for weighted noisy adder channel, multimedia fingerprinting and compressed sensing (Q1727360) (← links)
- Multimedia IPP codes with efficient tracing (Q2182061) (← links)
- Strongly separable matrices for nonadaptive combinatorial group testing (Q2659071) (← links)
- Strongly Conflict-Avoiding Codes (Q3225103) (← links)
- Upper Bounds on Separating Codes (Q3546728) (← links)
- \(\overline{2}\)-separable codes with length 5 (Q6041568) (← links)
- Constructions of \(t\)-strongly multimedia IPP codes with length \(t+1\) (Q6618621) (← links)