Binary decoding / Binary · half distance

From Subset-Sum to Decoding: Improved Classical and Quantum Algorithms via Ternary Representation Technique

Yang Li

Information 2025

PublishedSource checked

Time bound: 2^{0.0453 n + o(n)}
Space bound: —

Source / version date: 12 Oct 2025
Comparison variant: Binary · half distance
Cost scale: 2^{c n + o(n)}

Assumptions and source notes

Published heuristic claim; not independently proof-audited.

Source location

Abstract; Table 1; Section 5
Version: Published 2025-10-12

Primary source ↗

BibTeXDownload .bib

@misc{li2025-ternary,
  author = {Yang Li},
  title = {{From Subset-Sum to Decoding: Improved Classical and Quantum Algorithms via Ternary Representation Technique}},
  year = {2025},
  url = {https://doi.org/10.3390/info16100887},
  cr_date = {2025-10-12},
  cr_status = {published},
  cr_venue = {Information 16(10), 887},
  cr_author_ids = {yang-li}
}