The sequence reconstruction of permutations under Hamming metric with small errors

DOI10.1007/S12095-026-00900-3MaRDI QIDQ7363961zbMATH OpenFDO

Authors Alireza Abdollahi, Javad Bagherian, Hamideh Eskandari, Fatemeh Jafari, M. Khatami, F. Parvaresh, Reza Sobhani

Publication date 1 October 2026

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

Full work available at URL https://doi.org/10.1007/S12095-026-00900-3

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Information theory (general) (94A15) Combinatorial codes (94B25)

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
• scientific article; zbMATH DE number 862502 (Why is no real title available?)
• Improved Rank-Modulation Codes for DNA Storage With Shotgun Sequencing
• Rank Modulation for Flash Memories
• Rank-Modulation Codes for DNA Storage With Shotgun Sequencing
• The sequence reconstruction of permutations with Hamming metric
• The sequence reconstruction problem for permutations with the Hamming distance

This page was built for publication: The sequence reconstruction of permutations under Hamming metric with small errors

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