Exportar Publicação
A publicação pode ser exportada nos seguintes formatos: referência da APA (American Psychological Association), referência do IEEE (Institute of Electrical and Electronics Engineers), BibTeX e RIS.
Allahkaram, S. & Monteiro, F. A. (2025). Uniquely Decodable Signature Sequences Over the Noisy Adder Channel. In 12th International Symposium on Networks, Computers and Communications (ISNCC'25). Paris
S. Allahkaram and F. A. Monteiro, "Uniquely Decodable Signature Sequences Over the Noisy Adder Channel", in 12th Int. Symp. on Networks, Computers and Communications (ISNCC'25), Paris, 2025
@inproceedings{allahkaram2025_1764921085176,
author = "Allahkaram, S. and Monteiro, F. A.",
title = "Uniquely Decodable Signature Sequences Over the Noisy Adder Channel",
booktitle = "12th International Symposium on Networks, Computers and Communications (ISNCC'25)",
year = "2025",
editor = "",
volume = "",
number = "",
series = "",
doi = "10.1109/ISNCC66965.2025.11250456",
publisher = "",
address = "Paris",
organization = "IEEE",
url = "https://www.isncc-conf.org"
}
TY - CPAPER TI - Uniquely Decodable Signature Sequences Over the Noisy Adder Channel T2 - 12th International Symposium on Networks, Computers and Communications (ISNCC'25) AU - Allahkaram, S. AU - Monteiro, F. A. PY - 2025 SN - 2472-4386 DO - 10.1109/ISNCC66965.2025.11250456 CY - Paris UR - https://www.isncc-conf.org AB - Signature sequences that are uniquely decodable (UD) can be used to identify active terminals by the observation of their sums. Such sequences provide a solution to the problem of finding which m-out-of-t users are active in grant-free access methods that use physical layer network coding (PLNC). Although the existence of such sequences has been assumed in previous works, their explicit construction is presented here for the first time, along with a performance assessment when the observed sums are disturbed by noise. UD sequences are defined as sets of integers that satisfy the unique-sum property. The construction of the sets is algebraically defined depending on two Galois fields with related dimensions. We use the BoseChowla-Lindström approach to computationally find such integer sets that are obtained with reasonable computational complexity. In comparison with orthogonal binary real sequences, these sequences use fewer bits in equivalent setups. The binary signature sequences are mapped to some binary antipodal modulation and assessed in the multiple access adder channel (MAAC) disturbed by noise. Both hard and soft maximum likelihood detectors are used to assess the probability of misidentifying an active user. ER -
English