標題: Computing the Ball Size of Frequency Permutations under Chebyshev Distance
作者: Shieh, Min-Zheng
Tsai, Shi-Chun
資訊工程學系
Department of Computer Science
公開日期: 2011
摘要: Let S-n(lambda) be the set of all permutations over the multiset [GRAPHICS] where n = m lambda. A frequency permutation array (FPA) of minimum distance d is a subset of S-n(lambda) in which every two elements have distance at least d. FPAs have many applications related to error correcting codes. In coding theory, the Gilbert- Varshamov bound and the spherepacking bound are derived from the size of balls of certain radii. We propose two efficient algorithms that compute the ball size of frequency permutations under Chebyshev distance. Both methods extend previous known results. The first one runs in O((()(2d lambda)2.376)(d lambda) log n) time and O((()(2d lambda)2)(d lambda)) space. The second one runs in O ((()(2d lambda)()(d lambda) (d lambda+lambda))(lambda)n/lambda) time and O((2d lambda)(d lambda)) space. For small constants lambda and d, both are efficient in time and use constant storage space.
URI: http://hdl.handle.net/11536/15174
ISBN: 978-1-4577-0595-3
期刊: 2011 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT)
Appears in Collections:Conferences Paper