On the number of distinct \(k\)-decks: enumeration and bounds

DOI10.3934/amc.2021032zbMath1524.68248OpenAlexW3197609398MaRDI QIDQ6112289

Hanwen Yao, Johan Chrisnata, Alexander Vardy, Han Mao Kiah, Unnamed Author, Eitan Yaakobi

Publication date: 7 July 2023

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/amc.2021032

zbMATH Keywords

trellis\(k\)-deck problemsubsequence reconstruction

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Another generalization of abelian equivalence: binomial complexity of infinite words
• Reconstruction of sequences
• On a reconstruction problem for sequences
• Reconstructing sequences
• Reconstruction from subsequences.
• Codes for DNA Sequence Profiles
• Rates of DNA Sequence Profiles for Practical Values of Read Lengths
• The binomial equivalence classes of finite words
• Reconstructing Words from Right-Bounded-Block Words
• Unique Reconstruction of Coded Strings From Multiset Substring Spectra
• String Reconstruction from Substring Compositions