Note on a construction of short k-radius sequences
From MaRDI portal
Publication:729784
Recommendations
Cites work
- scientific article; zbMATH DE number 2206373 (Why is no real title available?)
- scientific article; zbMATH DE number 3031875 (Why is no real title available?)
- Combinatorial designs and the theorem of Weil on multiplicative character sums
- Consecutive storage of relevant records with redundancy
- Constructing \(k\)-radius sequences
- Constructing optimal \(k\)-radius sequences
- Constructions of asymptotically shortest \(k\)-radius sequences
- Cyclotomy and difference families in elementary Abelian groups
- Existence of (q,k, 1) difference families withq a prime power andk = 4, 5
- Existence of \((q,6,1)\) difference families with \(q\) a prime power
- Further progress on difference families with block size 4 or 5
- Packing analogue of k-radius sequences
- Sequences of Radius k: How to Fetch Many Huge Objects into Small Memory for Pairwise Computations
- Sequences of large radius
- The existence of \(k\)-radius sequences
- Universal cycles for minimum coverings of pairs by triples, with application to 2-radius sequences
Cited in
(8)- The existence of \(k\)-radius sequences
- Constructions of asymptotically shortest \(k\)-radius sequences
- Sequences of large radius
- Sequences of Radius k: How to Fetch Many Huge Objects into Small Memory for Pairwise Computations
- Constructing optimal \(k\)-radius sequences
- Short k‐radius sequences, k‐difference sequences and universal cycles
- Erratum: Constructing Optimal $k$-Radius Sequences
- Constructing \(k\)-radius sequences
This page was built for publication: Note on a construction of short \(k\)-radius sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q729784)