5 citations · 11 across the 9 of their papers we have counts for
9 papers
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…
Neural Network Decoders for Permutation Codes Correcting Different Errors
Yeow Meng Chee, Hui Zhang
Permutation codes were extensively studied in order to correct different types of errors for the applications on power line communication and rank modulation for flash memory. In t…
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,…
Grassmannian Codes with New Distance Measures for Network Coding
Tuvi Etzion, Hui Zhang
Grassmannian codes are known to be useful in error-correction for random network coding. Recently, they were used to prove that vector network codes outperform scalar linear networ…
Multiset Combinatorial Batch Codes
Hui Zhang, Eitan Yaakobi, Natalia Silberstein
Batch codes, first introduced by Ishai, Kushilevitz, Ostrovsky, and Sahai, mimic a distributed storage of a set of data items on servers, in such a way that any batch of $k…
Bounds for Batch Codes with Restricted Query Size
Hui Zhang, Vitaly Skachek
We present new upper bounds on the parameters of batch codes with restricted query size. These bounds are an improvement on the Singleton bound. The techniques for derivations of t…
Constructions of Optimal and Near-Optimal Multiply Constant-Weight Codes
Yeow Meng Chee, Han Mao Kiah, Hui Zhang +1
Multiply constant-weight codes (MCWCs) have been recently studied to improve the reliability of certain physically unclonable function response. In this paper, we give combinatoria…
Decompositions of Edge-Colored Digraphs: A New Technique in the Construction of Constant-Weight Codes and Related Families
Yeow Meng Chee, Fei Gao, Han Mao Kiah +3
We demonstrate that certain Johnson-type bounds are asymptotically exact for a variety of classes of codes, namely, constant-composition codes, nonbinary constant-weight codes and…
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…