Note on a construction of short \(k\)-radius sequences

DOI10.1016/j.disc.2016.09.010zbMath1351.05223OpenAlexW2550510000MaRDI QIDQ729784

Zbigniew Lonc

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

zbMATH Keywords

difference family\(k\)-radius sequence

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Extremal combinatorics (05D99)

Related Items (1)

Short k‐radius sequences, k‐difference sequences and universal cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Packing analogue of \(k\)-radius sequences
• The existence of \(k\)-radius sequences
• Constructions of asymptotically shortest \(k\)-radius sequences
• Sequences of large radius
• Further progress on difference families with block size 4 or 5
• Combinatorial designs and the theorem of Weil on multiplicative character sums
• Existence of \((q,6,1)\) difference families with \(q\) a prime power
• Cyclotomy and difference families in elementary Abelian groups
• Constructing Optimal $k$-Radius Sequences
• Constructing 𝑘-radius sequences
• Universal cycles for minimum coverings of pairs by triples, with application to 2-radius sequences
• Consecutive storage of relevant records with redundancy
• Existence of (q,k, 1) difference families withq a prime power andk = 4, 5
• Sequences of Radius k: How to Fetch Many Huge Objects into Small Memory for Pairwise Computations

This page was built for publication: Note on a construction of short \(k\)-radius sequences