scientific article
From MaRDI portal
Publication:3020034
zbMath1217.05038MaRDI QIDQ3020034
Tayuan Huang, Michel Marie Deza
Publication date: 29 July 2011
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (27)
Generalized ordinal patterns allowing for ties and their applications in hydrology ⋮ A generalized Mallows model based on \(\phi\)-divergence measures ⋮ Group algebra of characteristic 1 and invariant distances over a finite group ⋮ On a weighted generalization of Kendall's tau distance ⋮ Consolidation for compact constraints and Kendall tau LP decodable permutation codes ⋮ Sorting with forbidden intermediates ⋮ New nonexistence results on perfect permutation codes under the Hamming metric ⋮ Coding for locality in reconstructing permutations ⋮ Reconstruction of permutations distorted by single Kendall \(\tau\)-errors ⋮ Sampling and learning Mallows and generalized Mallows models under the Cayley distance ⋮ Nonexistence of perfect permutation codes under the Kendall \(\tau\)-metric ⋮ Mallows and generalized Mallows model for matchings ⋮ Proof of a conjecture of Kløve on permutation codes under the Chebychev distance ⋮ On the snake-in-the-box codes for rank modulation under Kendall's \(\tau \)-metric ⋮ Sofic groups and profinite topology on free groups. ⋮ The complexity of the weight problem for permutation and matrix groups. ⋮ Optimal permutation anticodes with the infinity norm via permanents of \((0,1)\)-matrices ⋮ On the hardness of maximum rank aggregation problems ⋮ Algorithmic Problems for Metrics on Permutation Groups ⋮ Efficiently computing the permanent and Hafnian of some banded Toeplitz matrices ⋮ Computational geometric aspects of rhythm, melody, and voice-leading ⋮ Covering radius of permutation groups with infinity-norm ⋮ Snake-in-the-box codes under the \(\ell_{\infty}\)-metric for rank modulation ⋮ On Computing the Total Displacement Number via Weighted Motzkin Paths ⋮ Asymptotic properties of Lee distance ⋮ Parameterized complexity of small weight automorphisms and isomorphisms ⋮ The complexity of the Weight Problem for permutation groups
This page was built for publication:
