Pages that link to "Item:Q4975887"

The following pages link to Rank Modulation for Flash Memories (Q4975887):

Displaying 16 items.

• Computing the ball size of frequency permutations under Chebyshev distance (Q417597) (← links)
• On the snake-in-the-box codes for rank modulation under Kendall's \(\tau \)-metric (Q522220) (← links)
• Consolidation for compact constraints and Kendall tau LP decodable permutation codes (Q1675286) (← links)
• New bounds of permutation codes under Hamming metric and Kendall's \(\tau \)-metric (Q1675288) (← links)
• Coding for locality in reconstructing permutations (Q1696052) (← links)
• Perfect codes from \(\operatorname{PGL}(2,5)\) in star graphs (Q2182232) (← links)
• Nonexistence of perfect permutation codes under the Kendall \(\tau\)-metric (Q2234465) (← links)
• Covering radius of permutation groups with infinity-norm (Q2297719) (← links)
• Snake-in-the-box codes under the \(\ell_{\infty}\)-metric for rank modulation (Q2302152) (← links)
• New lower bounds for permutation arrays using contraction (Q2324789) (← links)
• Strongly restricted permutations and tiling with fences (Q2348057) (← links)
• Lower bounds on the size of spheres of permutations under the Chebychev distance (Q2430688) (← links)
• Codes of length two correcting single errors of limited size (Q2632845) (← links)
• Constructions of multi-permutation codes correcting a single burst of deletions (Q2701501) (← links)
• Codes of Length 2 Correcting Single Errors of Limited Size (Q3460107) (← links)
• Space-Optimal Quasi-Gray Codes with Logarithmic Read Complexity (Q5009569) (← links)