Robot positioning using torus packing for multisets

DOI10.4230/LIPICS.ICALP.2024.43MaRDI QIDQ6875161zbMATH OpenFDO

Authors Chung Shue Chen, Peter Keevash, Sean Kennedy, Elie de Panafieu, Adrian Vetta

Publication date 14 January 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2024.43

zbMATH Keywords

de Bruijn sequencespositioning systemsuniversal cycles

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Cites work

• Binary robust positioning patterns with low redundancy and efficient locating algorithms
• scientific article; zbMATH DE number 3505007 (Why is no real title available?)
• Near-universal cycles for subsets exist
• New constructions for De Bruijn tori
• On the de Bruijn torus problem
• On the existence of de Bruijn tori with two by two windows
• On universal cycles for multisets
• On universal cycles for new classes of combinatorial structures
• Robust positioning patterns
• Simple and Robust Binary Self-Location Patterns
• The art of computer programming. Volume 4A. Combinatorial algorithms. Part 1.
• Universal cycle packings and coverings for \(k\)-subsets of an \(n\)-set
• Universal cycles for combinatorial structures

This page was built for publication: Robot positioning using torus packing for multisets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6875161)