activity
20072021
most citedPermutation Arrays Under the Chebyshev Distance

5 citations · 7 across the 7 of their papers we have counts for

collaborators

7 papers

cs.SE2021★ 1 cited

REST API Fuzzing by Coverage Level Guided Blackbox Testing

Chung-Hsuan Tsai, Shi-Chun Tsai, Shih-Kun Huang

With the growth of web applications, REST APIs have become the primary communication method between services. In order to ensure system reliability and security, software quality c…

cs.CC2015

On Restricting No-Junta Boolean Function and Degree Lower Bounds by Polynomial Method

Chia-Jung Lee, Satya V. Lokam, Shi-Chun Tsai +1

Let be the set of Boolean functions depending on all variables. We prove that for any , or depends on the…

cs.IT2011

Computing the Ball Size of Frequency Permutations under Chebyshev Distance

Min-Zheng Shieh, Shi-Chun Tsai

Let be the set of all permutations over the multiset where . A frequency permutation array (FPA) of minimum dist…

cs.IT2010

On the minimum weight problem of permutation codes under Chebyshev distance

Min-Zheng Shieh, Shi-Chun Tsai

Permutation codes of length and distance is a set of permutations on symbols, where the distance between any two elements in the set is at least . Subgroup permutati…

cs.IT2009★ 5 cited

Permutation Arrays Under the Chebyshev Distance

Torleiv Kløve, Te-Tsung Lin, Shi-Chun Tsai +1

An (n,d) permutation array (PA) is a set of permutations of length n with the property that the distance (under some metric) between any two permutations in the array is at least d…

cs.IT2009

Decoding Frequency Permutation Arrays under Infinite norm

Min-Zheng Shieh, Shi-Chun Tsai

A frequency permutation array (FPA) of length and distance is a set of permutations on a multiset over symbols, where each symbol appears exactly times and the d…