Reconstruction of objects from a minimum number of distorted patterns
From MaRDI portal
Publication:1595609
zbMath1008.94522MaRDI QIDQ1595609
Publication date: 13 February 2001
Published in: Doklady Mathematics (Search for Journal in Brave)
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Pattern recognition, speech recognition (68T10) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Related Items (12)
Metric intersection problems in Cayley graphs and the Stirling recursion ⋮ Reconstruction of a word from a finite set of its subwords under the unit shift hypothesis. I. Reconstruction without forbidden words ⋮ Reconstruction of permutations distorted by reversal errors ⋮ Reconstruction of a graph from 2-vicinities of its vertices ⋮ On reconstruction of signed permutations distorted by reversal errors ⋮ Some problems on Cayley graphs ⋮ Efficient reconstruction of sequences from their subsequences of supersequences ⋮ Vertex reconstruction in Cayley graphs ⋮ Error graphs and the reconstruction of elements in groups ⋮ The trace reconstruction problem for spider graphs ⋮ Information-Theoretic Foundations of DNA Data Storage ⋮ Reconstruction of a graph from 2–vicinities of its vertices
This page was built for publication: Reconstruction of objects from a minimum number of distorted patterns
