Abstract
Let nq(M, d) be the minimum length of a q-ary code of size M and minimum distance d. Bounding nq(M, d) is a fundamental problem that lies at the heart of coding theory. This work considers a generalization nq•(M, d) of nq(M, d) corresponding to codes in which codewords have protected and unprotected entries; where (analogs of) distance and of length are measured with respect to protected entries only. Such codes, here referred to as box codes, have seen prior studies in the context of bipartite graph covering. Upper and lower bounds on nq• •(M, d) are presented.
| 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 |
| Externally published | Yes |
| 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.