5 papers
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…
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…
Implementation and Optimization of HQC Decoding on NPU-Integrated Devices
Vu Minh Chau, Nguyen Ngoc Kiet, Pham Quang Minh +3
Hamming Quasi-Cyclic (HQC) has been selected by NIST for standardization as an additional code-based key-encapsulation mechanism, providing algorithmic diversity alongside lattice-…
Efficient Approximation of Quantum Channel Fidelity Exploiting Symmetry
Yeow Meng Chee, Hoang Ta, Van Khu Vu
Determining the optimal fidelity for the transmission of quantum information over noisy quantum channels is one of the central problems in quantum information theory. Recently, [Be…
Constructing Decision Trees from Data Streams
Huy Pham, Hoang Ta, Hoa T. Vu
In this work, we present data stream algorithms to compute optimal splits for decision tree learning. In particular, given a data stream of observations \(x_i\) and their correspon…