Constructing 𝑘-radius sequences
From MaRDI portal
Publication:2840025
DOI10.1090/S0025-5718-2011-02510-XzbMath1290.05151arXiv1006.5812MaRDI QIDQ2840025
Simon R. Blackburn, James McKee
Publication date: 17 July 2013
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1006.5812
94A55: Shift register sequences and sequences over finite alphabets in information and communication theory
05D99: Extremal combinatorics
Related Items
Achromatic and Harmonious Colorings of Circulant Graphs, Short k‐radius sequences, k‐difference sequences and universal cycles, Packing analogue of \(k\)-radius sequences, Sequences of radius \(k\) for complete bipartite graphs, The existence of \(k\)-radius sequences, Constructions of asymptotically shortest \(k\)-radius sequences, Note on a construction of short \(k\)-radius sequences, Sequences of large radius, Nonsingular splittings of cyclic groups, Coloring the \(n\)-smooth numbers with \(n\) colors, Constructing Optimal $k$-Radius Sequences, Universal cycles for minimum coverings of pairs by triples, with application to 2-radius sequences, Sequences of Radius k for Complete Bipartite Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On a problem of Oppenheim concerning Factorisatio Numerorum
- Equidistant arithmetic codes and character sums
- Universal cycles for minimum coverings of pairs by triples, with application to 2-radius sequences
- Consecutive storage of relevant records with redundancy
- Characters With Preassigned Values
- The distribution of power residues and certain related results
- Sequences of Radius k: How to Fetch Many Huge Objects into Small Memory for Pairwise Computations
- Splittings of Abelian groups by integers