Computing the ball size of frequency permutations under Chebyshev distance
From MaRDI portal
Publication:417597
DOI10.1016/j.laa.2012.02.016zbMath1244.65064arXiv1102.2799OpenAlexW2001694017MaRDI QIDQ417597
Shi-Chun Tsai, Min-Zheng Shieh
Publication date: 14 May 2012
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1102.2799
algorithmpermutationpermanentcoding theoryerror correcting codesGilbert-Varshamov boundfrequency permutation arraysphere-packing bound
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- Efficiently computing the permanent and Hafnian of some banded Toeplitz matrices
- Lower bounds on the size of spheres of permutations under the Chebychev distance
- Frequency permutation arrays
- Distance-preserving mappings from binary vectors to permutations
- Rank Modulation for Flash Memories
- Decoding Frequency Permutation Arrays Under Chebyshev Distance
- Correcting Limited-Magnitude Errors in the Rank-Modulation Scheme
- Permutation Arrays Under the Chebyshev Distance
This page was built for publication: Computing the ball size of frequency permutations under Chebyshev distance
