On a reconstruction problem for sequences

DOI10.1006/JCTA.1997.2732zbMath0871.05002OpenAlexW2058068142MaRDI QIDQ1352885

Yehuda Roditty, Ilia Krasikov

Publication date: 14 September 1997

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/8f98290fe80549588a55a6d927217f5b96717413

zbMATH Keywords

reconstruction of wordssystems of linear diophantine equations

Mathematics Subject Classification ID

Combinatorics on words (68R15) Permutations, words, matrices (05A05) Other combinatorial number theory (11B75) Diophantine equations in many variables (11D72) Linear Diophantine equations (11D04)

Related Items (20)

Reconstructing Words from Right-Bounded-Block Words ⋮ Reconstructing under group actions. ⋮ On the word fragment length for unambiguous reconstruction of a periodic word from a complete multiset of fragments of fixed length ⋮ On Prouhet's solution to the equal powers problem ⋮ On the number of distinct \(k\)-decks: enumeration and bounds ⋮ Reconstruction from subsequences. ⋮ A linear algorithm for string reconstruction in the reverse complement equivalence model ⋮ Reconstruction of a word from a finite set of its subwords under the unit shift hypothesis. I. Reconstruction without forbidden words ⋮ Efficient Reconstruction of RC-Equivalent Strings ⋮ Optimal mean-based algorithms for trace reconstruction ⋮ Relations on words ⋮ POLYNOMIALS WITH MULTIPLE ROOTS AT 1 ⋮ Solutions to the multi-dimensional Prouhet-Tarry-Escott problem resulting from composition of balanced morphisms ⋮ Efficient reconstruction of sequences from their subsequences of supersequences ⋮ Unnamed Item ⋮ Reconstruction of matrices from submatrices ⋮ Reconstructing subsets of \(\mathbb{Z}_n\) ⋮ On highly palindromic words ⋮ Reconstructing trees from traces ⋮ Reconstructing Words from Right-Bounded-Block Words

This page was built for publication: On a reconstruction problem for sequences