Reconstruction of permutations distorted by single Kendall -errors
DOI10.1007/S12095-022-00595-2zbMATH Open1518.94025OpenAlexW4283527878WikidataQ114849088 ScholiaQ114849088MaRDI QIDQ6159432FDOQ6159432
Authors:
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
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Information theory (general) (94A15) Exact enumeration problems, generating functions (05A15) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Decoding (94B35)
Cites Work
- Title not available (Why is that?)
- Reconstruction of a graph from 2-vicinities of its vertices
- Efficient reconstruction of sequences from their subsequences of supersequences
- Efficient reconstruction of sequences
- Metrics on permutations, a survey
- Correcting Charge-Constrained Errors in the Rank-Modulation Scheme
- Error graphs and the reconstruction of elements in groups
- Reconstruction of permutations distorted by reversal errors
- On reconstruction of signed permutations distorted by reversal errors
- New bounds of permutation codes under Hamming metric and Kendall's \(\tau \)-metric
- Nonexistence of perfect permutation codes under the Kendall \(\tau\)-metric
- Exact Reconstruction From Insertions in Synchronization Codes
Cited In (4)
This page was built for publication: Reconstruction of permutations distorted by single Kendall \(\tau\)-errors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6159432)