47 citations · 49 across the 8 of their papers we have counts for
9 papers
ASM-6D: Fast Certified Pose-Shape Inference with Complete Correspondence Flow Maps
Ho Jin Choi, Minku Kim, Nadia Figueroa
Category-level 6D pose and shape estimation requires recovering an object's pose and geometry from partial observations without an exact instance model. We present ASM-6D, which co…
Divisibility of Trace Codes
Hexiang Huang, Haihua Deng, Sihuang Hu
A linear code is said to be -divisible if the Hamming weights of all its codewords are divisible by . The -adic valuation of a code is defined as the greatest integer …
On the quantum chromatic number of Hamming and generalized Hadamard graphs
Xiwang Cao, Keqin Feng, Hexiang Huang +2
As a fundamental metric for quantifying quantum advantage in non-local games, the quantum chromatic number reveals the power of entanglement in distributed tasks. In this paper, we…
Divisibility of Griesmer Codes
Haihua Deng, Hexiang Huang, Qing Xiang
In this paper, we consider Griesmer codes, namely those linear codes meeting the Griesmer bound. Let be an Griesmer code with , where is a prime and $f\g…
Hegedus' Conjecture and Tighter Upper Bounds for Equidistant Codes in Hamming Spaces
Sihuang Hu, Hexiang Huang, Wei-Hsuan Yu
An equidistant code is a code in the Hamming space such that two distinct codewords have the same Hamming distance. This paper investigates the bounds for equidistant codes in Hamm…
The BCH Family of Storage Codes on Triangle-Free Graphs is of Unit Rate
Haihua Deng, Hexiang Huang, Guobiao Weng +1
Let be a simple connected graph on vertices, and let be a code of length whose coordinates are indexed by the vertices of . We say that is a \textit{storage…
Construction of storage codes of rates approaching one on triangle-free graphs
Hexiang Huang, Qing Xiang
Consider an assignment of bits to the vertices of a connected graph with the property that the value of each vertex is a function of the values of its neighbors. A collec…
Perfect codes in circulant graphs
Rongquan Feng, He Huang, Sanming Zhou
A perfect code in a graph is a subset of that is an independent set such that every vertex in is adjacent to exactly one vertex in . A total…
Perfect codes in Cayley graphs
He Huang, Binzhou Xia, Sanming Zhou
Given a graph , a subset of is called a perfect code in if every vertex of is at distance no more than one to exactly one vertex in , and a subset of $…