Reconstruction of permutations distorted by single Kendall \(\tau\)-errors

DOI10.1007/s12095-022-00595-2zbMath1518.94025OpenAlexW4283527878WikidataQ114849088 ScholiaQ114849088MaRDI QIDQ6159432

No author found.

Publication date: 20 June 2023

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

Full work available at URL: https://doi.org/10.1007/s12095-022-00595-2

zbMATH Keywords

sequence reconstructionpermutation codeserroneous patternsKendall \(\tau\)-distance

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Graph theory (including graph drawing) in computer science (68R10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Information theory (general) (94A15) Decoding (94B35)

Cites Work

• Unnamed Item
• Unnamed Item
• Reconstruction of a graph from 2-vicinities of its vertices
• Error graphs and the reconstruction of elements in groups
• New bounds of permutation codes under Hamming metric and Kendall's \(\tau \)-metric
• Nonexistence of perfect permutation codes under the Kendall \(\tau\)-metric
• Reconstruction of permutations distorted by reversal errors
• On reconstruction of signed permutations distorted by reversal errors
• Efficient reconstruction of sequences
• Exact Reconstruction From Insertions in Synchronization Codes
• Correcting Charge-Constrained Errors in the Rank-Modulation Scheme
• Efficient reconstruction of sequences from their subsequences of supersequences

This page was built for publication: Reconstruction of permutations distorted by single Kendall \(\tau\)-errors