Robust Positioning Patterns with Low Redundancy

DOI10.1137/19M1253472zbMath1432.68137arXiv1912.13301OpenAlexW3013772831MaRDI QIDQ5221262

Yeow Meng Chee, Duc Tu Dao, Han Mao Kiah, Hengjia Wei, San Ling

Publication date: 25 March 2020

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1912.13301

zbMATH Keywords

Reed-Solomon codesGray codesmaximum rank distance codesrobust positioning patterns

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Cites Work

• Packing analogue of \(k\)-radius sequences
• Error correcting sequence and projective de Bruijn graph
• Theory of codes with maximum rank distance
• The Difference Between Consecutive Primes, II
• Minimum distance of logarithmic and fractional partial m-sequences
• Robust positioning patterns
• Mutually Uncorrelated Primers for DNA-Based Data Storage
• Constructions for perfect maps and pseudorandom arrays
• Perfect maps
• A method for constructing decodable de Bruijn sequences
• Mutually Uncorrelated Codes for DNA Storage
• Simple and Robust Binary Self-Location Patterns
• Maximum-rank array codes and their application to crisscross error correction

This page was built for publication: Robust Positioning Patterns with Low Redundancy