Computing the ball size of frequency permutations under Chebyshev distance
檔案
- 000303636000023.pdf (420.6 KB, Adobe PDF)
日期
2012-07-01
類型
系所
期刊名稱
LINEAR ALGEBRA AND ITS APPLICATIONS
卷期與頁次
第 437 卷第 1 期
ISSN
0024-3795
語言
英文
摘要
Let S-n(lambda) be the set of all permutations over the multiset { [GRAPHICS] , .... , [GRAPHICS] } where n = m lambda. A frequency permutation array (FPA) of minimum distance d is a subset of S-n(lambda) 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 sphere-packing 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. Here it is equivalent to computing the permanent of a special type of matrix, which generalizes the Toepliz matrix in some sense. Both methods extend previous known results. The first one runs in O (((2d lambda)(d lambda))(2.376) log n) time and O(((2d lambda)(d lambda))(2)) 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. (C) 2012 Elsevier Inc. All rights reserved.
所屬典藏
期刊論文引用此條目
Shieh, M.-Z., & Tsai, S.-C. (2012). Computing the ball size of frequency permutations under Chebyshev distance. LINEAR ALGEBRA AND ITS APPLICATIONS, 437(1). https://ir.lib.nycu.edu.tw/handle/11536/15941
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/15941