10 papers
Near-Optimal Covering Sequences
Hoang Ta, Van Khu Vu
An -covering sequence over a finite alphabet is a cyclic sequence whose consecutive length- windows form a covering code of radius . Equiva…
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…
Beyond Static Priors: Dynamic Neural Guidance for Large-Scale Ant Colony Optimization
Dat Thanh Tran, Van Khu Vu, Yining Ma
Neural-guided Ant Colony Optimization (ACO) suffers from a fundamental training-inference misalignment: policies are typically trained to generate static priors (e.g., heatmaps), y…
List Reconstruction Problem with List Size Two
Binh Vu, Shuche Wang, Van Khu Vu
The problem of computing the cardinality of the intersection of multiple balls in the Hamming space has attracted a lot of attention recently due to their applications in the list…
A Mixture of Experts Vision Transformer for High-Fidelity Surface Code Decoding
Hoang Viet Nguyen, Manh Hung Nguyen, Hoang Ta +2
Quantum error correction is a key ingredient for large scale quantum computation, protecting logical information from physical noise by encoding it into many physical qubits. Topol…
Sequence Reconstruction for Sticky Insertion/Deletion Channels
Van Long Phuoc Pham, Yeow Meng Chee, Kui Cai +1
The sequence reconstruction problem for insertion/deletion channels has attracted significant attention owing to their applications recently in some emerging data storage systems,…