Reconstruction of permutations distorted by single Kendall -errors
From MaRDI portal
Publication:6159432
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)
Recommendations
Cites work
- scientific article; zbMATH DE number 5764889 (Why is no real title available?)
- Correcting Charge-Constrained Errors in the Rank-Modulation Scheme
- Efficient reconstruction of sequences
- Efficient reconstruction of sequences from their subsequences of supersequences
- Error graphs and the reconstruction of elements in groups
- Exact Reconstruction From Insertions in Synchronization Codes
- Metrics on permutations, a survey
- New bounds of permutation codes under Hamming metric and Kendall's \(\tau \)-metric
- Nonexistence of perfect permutation codes under the Kendall \(\tau\)-metric
- On reconstruction of signed permutations distorted by reversal errors
- Reconstruction of a graph from 2-vicinities of its vertices
- Reconstruction of permutations distorted by reversal errors
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)