9 citations · 12 across the 17 of their papers we have counts for
6 papers · 1 filter
Non-Adaptive Learning of Sparse Erdős--Rényi Graphs via Affine Splitting
Hoang Ta
Graph learning from edge-detecting queries concerns the reconstruction of an unknown edge set on a known vertex set. Each query reports whether a specified vertex subset contains a…
Block Tensor Rank of Sum-Rank Metric Codes
Huimin Lao, Huy Pham, Hoang Ta +1
Sum-rank codes provide a generalized framework for Hamming and rank-metric codes, with codewords represented as tuples of matrices and weight given by the sum of the block ranks. I…
A Fast Hierarchical Splitting Approach for Non-Adaptive Learning of Random Hypergraphs
Huy Pham, Hoang Ta
This work focuses on the problem of learning an unknown -uniform hypergraph using edge-detecting queries. Our goal is to design a querying strategy that recovers the hyperedge s…
A Fast Binary Splitting Approach for Non-Adaptive Learning of Erdős--Rényi Graphs
Hoang Ta, Jonathan Scarlett
We study the problem of learning an unknown graph via group queries on node subsets, where each query reports whether at least one edge is present among the queried nodes. In gener…
On de Bruijn Covering Sequences and Arrays
Yeow Meng Chee, Tuvi Etzion, Hoang Ta +1
An -de Bruijn covering array (dBCA) is a doubly periodic array over an alphabet of size such that the set of all its windows form a covering…
On the Asymptotic Nonnegative Rank of Matrices and its Applications in Information Theory
Yeow Meng Chee, Quoc Tung Le, Hoang Ta
In this paper, we study the asymptotic nonnegative rank of matrices, which characterizes the asymptotic growth of the nonnegative rank of fixed nonnegative matrices under the Krone…