EUVIMEDEUVIMED entdecken
Crossref

Optimal Constant-Weight and Mixed-Weight Conflict-Avoiding Codes

Yuan-Hsun Lo, Tsai-Lien Wong, Kangkang Xu, Yijin Zhang

IEEE Transactions on Information Theory · 2025-03 · 71 (3) · 2257-2270

DOI: 10.1109/tit.2025.3528132 ↗

Kurz gefasst

Fachartikel in der Zeitschrift IEEE Transactions on Information Theory, 2025-03. Verfasst von Yuan-Hsun Lo und 3 weiteren Autor:innen. Die Arbeit wurde bisher 3-mal zitiert (Crossref) und nennt 28 Literaturangaben. Gefördert von: National Natural Science Foundation of China, National Science and Technology Council, Taiwan.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

A conflict-avoiding code (CAC) is a deterministic transmission scheme for asynchronous multiple access without feedback. When the number of simultaneously active users is less than or equal to w, a CAC of length L with weight w can provide a hard guarantee that each active user has at least one successful transmission within every consecutive L slots. In this paper, we generalize some previously known constructions of constant-weight CACs, and then derive several classes of optimal CACs by the help of Kneser’s Theorem and some techniques in Additive Combinatorics. Another spotlight of this paper is to relax the identical-weight constraint in prior studies to study mixed-weight CACs for the first time, for the purpose of increasing the throughput and reducing the access delay of some potential users with higher priority. As applications of those obtained optimal CACs, we derive some classes of optimal mixed-weight CACs.

Förderung

  • National Natural Science Foundation of China
  • National Science and Technology Council, Taiwan

Zitieren

APA

Lo, Y., Wong, T., Xu, K., & Zhang, Y. (2025). Optimal Constant-Weight and Mixed-Weight Conflict-Avoiding Codes. IEEE Transactions on Information Theory, 71(3), 2257-2270. https://doi.org/10.1109/tit.2025.3528132

Vancouver

Lo Y, Wong T, Xu K, Zhang Y. Optimal Constant-Weight and Mixed-Weight Conflict-Avoiding Codes. IEEE Transactions on Information Theory. 2025;71(3):2257-2270. doi:10.1109/tit.2025.3528132

BibTeX
@article{Lo2025,
  author = {Lo, Yuan-Hsun and Wong, Tsai-Lien and Xu, Kangkang and Zhang, Yijin},
  title = {Optimal Constant-Weight and Mixed-Weight Conflict-Avoiding Codes},
  journal = {IEEE Transactions on Information Theory},
  year = {2025},
  volume = {71},
  number = {3},
  pages = {2257--2270},
  doi = {10.1109/tit.2025.3528132}
}
Kostenlos starten →