This is the authors' abstract. We don't add key points for this paper.
An algorithm is presented which finds a GMI-maximizing binary labeling for a given constellation. For 16-ary constellations, the algorithm is five orders of magnitude faster than a brute force search and, therefore, computationally tractable.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Lavery et al. (2025) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: