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

DOI10.1002/jcd.21711OpenAlexW3012298220MaRDI QIDQ6187437

Publication date: 31 January 2024

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jcd.21711

zbMATH Keywords

universal cycles $k$-radius sequences cyclic packings $k$-additive sequences $k$-difference sequences

Mathematics Subject Classification ID

Combinatorics on words (68R15) Graph theory (including graph drawing) in computer science (68R10) Extremal set theory (05D05) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Coloring of graphs and hypergraphs (05C15)

Cites Work

Unnamed Item
Ordering block designs. Gray codes, universal cycles and configuration orderings
Universal cycle packings and coverings for $k$-subsets of an $n$-set
Powers of cycles, powers of paths, and distance graphs
The existence of $k$-radius sequences
Constructions of asymptotically shortest $k$-radius sequences
Powers of Hamilton cycles in pseudorandom graphs
Universal cycles of $k$-subsets and $k$-permutations
Note on a construction of short $k$-radius sequences
Sequences of large radius
Universal cycles for combinatorial structures
Starters and related codes
A general construction for optimal cyclic packing designs
Sequentially additive graphs
Cycle decompositions of $K_n$ and $K_n-I$
Existence of cyclic $k$-cycle systems of the complete graph
Covering and packing for pairs
On the non-existence of lattice tilings by quasi-crosses
Constructing Optimal $k$-Radius Sequences
Constructing 𝑘-radius sequences
Circular designs balanced for neighbours at distances one and two
New Results on Codes Correcting Single Error of Limited Magnitude for Flash Memory
Tilings With $n$-Dimensional Chairs and Their Applications to Asymmetric Codes
Universal cycles for minimum coverings of pairs by triples, with application to 2-radius sequences
Near-Universal Cycles for Subsets Exist
Consecutive storage of relevant records with redundancy
On Universal Cycles for k-Subsets of an n-Set
Splitter Sets and $k$ -Radius Sequences
Achromatic and Harmonious Colorings of Circulant Graphs
Powers of Hamilton cycles in random graphs and tight Hamilton cycles in random hypergraphs
Constructions of optimal optical orthogonal codes with weight five
On the Nonexistence of Perfect Splitter Sets
Codes Correcting Single Errors of Limited Magnitude
Quasi-Cross Lattice Tilings With Applications to Flash Memory
Some Codes Correcting Asymmetric Errors of Limited Magnitude
Systematic, Single Limited Magnitude Error Correcting Codes for Flash Memories
Some Codes Correcting Unbalanced Errors of Limited Magnitude for Flash Memories
Sequences of Radius k: How to Fetch Many Huge Objects into Small Memory for Pairwise Computations

This page was built for publication: Short k‐radius sequences, k‐difference sequences and universal cycles