Trace reconstruction of matrices and hypermatrices

DOI10.1017/S0963548326100364MaRDI QIDQ7303695zbMATH OpenFDO

Authors Wen Jie Zhong, Xian De Zhang

Publication date 24 July 2026

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0963548326100364

Mathematics Subject Classification ID

Combinatorial probability (60C05) Sufficiency and information (62Bxx) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Cites work

• Almost every graph has reconstruction number three
• An improvement of a Borwein-Erdélyi-Kós result
• Average-case reconstruction for the deletion channel: subpolynomially many traces suffice
• Beyond trace reconstruction: population recovery from the deletion channel
• Circular trace reconstruction
• Coded Trace Reconstruction
• Coded trace reconstruction in a constant number of traces
• Efficient reconstruction of sequences
• Efficient reconstruction of sequences from their subsequences of supersequences
• Graph reconstruction—a survey
• scientific article; zbMATH DE number 5764889 (Why is no real title available?)
• scientific article; zbMATH DE number 6900644 (Why is no real title available?)
• Littlewood-Type Problems on [0,1]
• Littlewood-type problems on subarcs of the unit circle
• Lower bounds for trace reconstruction
• New lower bounds for trace reconstruction
• On a reconstruction problem for sequences
• On Reconstruction of Graphs From the Multiset of Subgraphs Obtained by Deleting ℓ Vertices
• Optimal mean-based algorithms for trace reconstruction
• Probability Inequalities for Sums of Bounded Random Variables
• Reconstructing strings from random traces
• Reconstructing trees from traces
• Reconstruction from subsequences.
• Reconstruction of hypermatrices from subhypermatrices
• Reconstruction of matrices from submatrices
• Reconstruction of objects from a minimum number of distorted patterns
• Reconstruction of sequences distorted by two insertions
• Separating strings with small automata
• Separating words and trace reconstruction
• Size reconstructibility of graphs
• Subpolynomial trace reconstruction for random strings and arbitrary deletion probability
• Topics in graph automorphisms and reconstruction
• Trace reconstruction revisited
• Trace reconstruction with \(\exp(O(n^{1/3}))\) samples
• Trace Reconstruction: Generalized and Parameterized
• Ulam's Conjecture and Graph Reconstructions

This page was built for publication: Trace reconstruction of matrices and hypermatrices

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