Robust positioning patterns

DOI10.1137/1.9781611974331.CH136MaRDI QIDQ4575720zbMATH OpenOpenAlexFDO

Authors Ross Berkowitz, Swastik Kopparty

Publication date 16 July 2018

Published in Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611974331.ch136

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Algorithms on strings (68W32)

Recommendations

• Robust positioning patterns with low redundancy
• Binary robust positioning patterns with low redundancy and efficient locating algorithms
• A method for constructing decodable de Bruijn sequences
• Publication:4886137
• De Bruijn Sequences and Perfect Factors

Cited in

(10)

• scientific article; zbMATH DE number 721894 (Why is no real title available?)
• Robust Positioning of Service Units
• scientific article; zbMATH DE number 910960 (Why is no real title available?)
• On a construction of easily decodable sub-de Bruijn arrays
• Robust positioning patterns with low redundancy
• Binary robust positioning patterns with low redundancy and efficient locating algorithms
• Positioning systems. A unified approach
• Robot positioning using torus packing for multisets
• Constructions of covering sequences and 2D-sequences
• Orientable sequences over non-binary alphabets

This page was built for publication: Robust positioning patterns

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