Pages that link to "Item:Q3129491"
From MaRDI portal
The following pages link to On greedy algorithms in coding theory (Q3129491):
Displaying 6 items.
- Upper bounds on the smallest size of a complete arc in a finite Desarguesian projective plane based on computer search (Q265614) (← links)
- Merging covering arrays and compressing multiple sequence alignments (Q1026121) (← links)
- Strengthening hash families and compressive sensing (Q1932362) (← links)
- An extension of Stein-Lovász theorem and some of its applications (Q1945692) (← links)
- New types of estimates for the smallest size of complete arcs in a finite Desarguesian projective plane (Q2352466) (← links)
- Locating and detecting arrays for interaction faults (Q2426663) (← links)