Abstract
This work provides a framework for the design of codes for zero-error information theory problems via superposition coding and suitable expurgation processes. For the Hamming metric, the proposed code construction meets the Gilbert-Varshamov bound via a different construction/analysis than the folklore uniformly random ensemble usually considered in the literature.
| Original language | English |
|---|---|
| Title of host publication | ISIT 2025 - 2025 IEEE International Symposium on Information Theory, Proceedings |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| Pages | 1-6 |
| ISBN (Electronic) | 9798331543990 |
| DOIs | |
| State | Published - 2025 |
| Event | 2025 IEEE International Symposium on Information Theory, ISIT 2025 - Ann Arbor, United States Duration: 22 Jun 2025 → 27 Jun 2025 |
Publication series
| Name | 2025 IEEE International Symposium on Information Theory (ISIT) |
|---|
Conference
| Conference | 2025 IEEE International Symposium on Information Theory, ISIT 2025 |
|---|---|
| Country/Territory | United States |
| City | Ann Arbor |
| Period | 22/06/25 → 27/06/25 |
Bibliographical note
Publisher Copyright:© 2025 IEEE.
Fingerprint
Dive into the research topics of 'Zero-Error Superposition Codes'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver