The sequence reconstruction problem for permutations with the Hamming distance

DOI10.1007/S12095-024-00717-YMaRDI QIDQ6643245zbMATH OpenFDO

Authors Xiang Wang, Elena V. Konstantinova

Publication date 26 November 2024

Published in Cryptography and Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S12095-024-00717-Y

zbMATH Keywords

Cayley graphHamming distancepermutation codessequence reconstruction

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Information theory (general) (94A15)

Cites work

• Coding for Racetrack Memories
• Coding Over Sets for DNA Storage
• Efficient reconstruction of sequences
• Efficient reconstruction of sequences from their subsequences of supersequences
• Error graphs and the reconstruction of elements in groups
• scientific article; zbMATH DE number 50740 (Why is no real title available?)
• scientific article; zbMATH DE number 1024657 (Why is no real title available?)
• scientific article; zbMATH DE number 1052006 (Why is no real title available?)
• scientific article; zbMATH DE number 6900644 (Why is no real title available?)
• On reconstruction of signed permutations distorted by reversal errors
• On the Uncertainty of Information Retrieval in Associative Memories
• Reconstruction of permutations distorted by reversal errors
• Reconstruction of permutations distorted by single Kendall -errors
• Vertex reconstruction in Cayley graphs

Cited in

(1)

• The sequence reconstruction of permutations with Hamming metric

This page was built for publication: The sequence reconstruction problem for permutations with the Hamming distance

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