Note on a construction of short k-radius sequences
From MaRDI portal
Publication:729784
DOI10.1016/J.DISC.2016.09.010zbMATH Open1351.05223OpenAlexW2550510000MaRDI QIDQ729784FDOQ729784
Publication date: 22 December 2016
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2016.09.010
Recommendations
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Extremal combinatorics (05D99)
Cites Work
- Existence of \((q,6,1)\) difference families with \(q\) a prime power
- Existence of (q,k, 1) difference families withq a prime power andk = 4, 5
- Title not available (Why is that?)
- Constructing \(k\)-radius sequences
- Packing analogue of \(k\)-radius sequences
- Universal cycles for minimum coverings of pairs by triples, with application to 2-radius sequences
- Sequences of Radius k: How to Fetch Many Huge Objects into Small Memory for Pairwise Computations
- The existence of \(k\)-radius sequences
- Constructions of asymptotically shortest \(k\)-radius sequences
- Sequences of large radius
- Cyclotomy and difference families in elementary Abelian groups
- Further progress on difference families with block size 4 or 5
- Combinatorial designs and the theorem of Weil on multiplicative character sums
- Constructing optimal \(k\)-radius sequences
- Title not available (Why is that?)
- Consecutive storage of relevant records with redundancy
Cited In (3)
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)
