1 citations · 1 across the 3 of their papers we have counts for
3 papers
cs.IT2024
Recovery Sets of Subspaces from a Simplex Code
Yeow Meng Chee, Tuvi Etzion, Han Mao Kiah +1
Recovery sets for vectors and subspaces are important in the construction of distributed storage system codes. These concepts are also interesting in their own right. In this paper…
math.CO2019
Complexity of Dependencies in Bounded Domains, Armstrong Codes, and Generalizations
Yeow Meng Chee, Hui Zhang, Xiande Zhang
The study of Armstrong codes is motivated by the problem of understanding complexities of dependencies in relational database systems, where attributes have bounded domains. A $(q,…
cs.CR2010★ 1 cited
Infinite Families of Optimal Splitting Authentication Codes Secure Against Spoofing Attacks of Higher Order
Yeow Meng Chee, Xiande Zhang, Hui Zhang
We consider the problem of constructing optimal authentication codes with splitting. New infinite families of such codes are obtained. In particular, we establish the first known i…