Binary Codes Correcting Multiple Edits via Polynomial Hashing and Entropy Recycling AF465QFRGQ

URI	`m2://res/AF465QFRGQ`
Kind	preprint
Creators	Quan D. Bui, Shuche Wang, Van Khu Vu
Date	2026-10-11
MSC	05-XX
Subjects	arxiv cs.IT, arxiv cs.DM, arxiv math.IT
Scope	in

Expressions

The mentions of the inventory that name this resource. Each name links to the card of its inventory row.

Item	Kind	Where	Source
13BTN4TFWZ	statement	lemma V.1	arxiv
2HA7GPNN6D	statement	theorem III.4	arxiv
Tag code	definition	definition II.10	arxiv
37PCCASEME	statement	lemma III.2	arxiv
Few collisions	statement	lemma II.9	arxiv
7DTT63G44T	statement	lemma II.6	arxiv
82K7A3B01H	statement	lemma II.2	arxiv
Suffix projection	statement	lemma II.4	arxiv
Greedy tag codes	statement	lemma II.11	arxiv
Separating seed	definition	definition III.1	arxiv
Bad-hash bound	statement	lemma IV.2	arxiv
Most hashes are good	statement	lemma IV.3	arxiv
DE3VZ9TM9M	definition	definition II.1	arxiv
Complexity	statement	theorem V.4	arxiv
Single-hash code	definition	definition III.3	arxiv
Good and bad hashes	definition	definition IV.1	arxiv
Size of edit balls	statement	lemma II.3	arxiv
Many-hash code	definition	definition IV.4	arxiv
NDNR7ARTJX	statement	lemma V.2	arxiv
Tag separation	statement	lemma IV.5	arxiv
S70SABKVDJ	statement	theorem I.1	arxiv
Projected confusion set	definition	definition II.5	arxiv
WK6ZT212P1	statement	theorem IV.6	arxiv
Correctness of decoding	statement	lemma V.3	arxiv
Size of the projected confusion set	statement	lemma II.7	arxiv