TU Darmstadt / ULB / TUbiblio

Deterministic Identification for MC Binomial Channel

Salariseddigh, Mohammad Javad ; Jamali, Vahid ; Boche, Holger ; Deppe, Christian ; Schober, Robert (2023)
Deterministic Identification for MC Binomial Channel.
2023 IEEE International Symposium on Information Theory (ISIT). Taipei, Taiwan (25.06.2023 - 30.06.2023)
doi: 10.1109/ISIT54713.2023.10206627
Konferenzveröffentlichung, Bibliographie

Kurzbeschreibung (Abstract)

The Binomial channel serves as a fundamental model for molecular communication (MC) systems employing molecule-counting receivers. Here, deterministic identification (DI) is addressed for the discrete-time Binomial channels (DTBC), subject to an average and a peak constraint on the molecule release rate. We establish that the number of different messages that can be reliably identified for the DTBC scales as 2 (n log n)R , where n and R are the codeword length and coding rate, respectively. Lower and upper bounds on the DI capacity of the DTBC are developed.

Typ des Eintrags: Konferenzveröffentlichung
Erschienen: 2023
Autor(en): Salariseddigh, Mohammad Javad ; Jamali, Vahid ; Boche, Holger ; Deppe, Christian ; Schober, Robert
Art des Eintrags: Bibliographie
Titel: Deterministic Identification for MC Binomial Channel
Sprache: Englisch
Publikationsjahr: 22 August 2023
Verlag: IEEE
Buchtitel: 2023 IEEE International Symposium on Information Theory (ISIT 2023)
Veranstaltungstitel: 2023 IEEE International Symposium on Information Theory (ISIT)
Veranstaltungsort: Taipei, Taiwan
Veranstaltungsdatum: 25.06.2023 - 30.06.2023
DOI: 10.1109/ISIT54713.2023.10206627
Kurzbeschreibung (Abstract):

The Binomial channel serves as a fundamental model for molecular communication (MC) systems employing molecule-counting receivers. Here, deterministic identification (DI) is addressed for the discrete-time Binomial channels (DTBC), subject to an average and a peak constraint on the molecule release rate. We establish that the number of different messages that can be reliably identified for the DTBC scales as 2 (n log n)R , where n and R are the codeword length and coding rate, respectively. Lower and upper bounds on the DI capacity of the DTBC are developed.

Freie Schlagworte: emergenCITY, emergenCITY_KOM
Fachbereich(e)/-gebiet(e): 18 Fachbereich Elektrotechnik und Informationstechnik
18 Fachbereich Elektrotechnik und Informationstechnik > Resiliente Kommunikationssysteme (RCS)
LOEWE
LOEWE > LOEWE-Zentren
LOEWE > LOEWE-Zentren > emergenCITY
Hinterlegungsdatum: 17 Jun 2024 13:50
Letzte Änderung: 20 Nov 2024 12:32
PPN: 522222870
Export:
Suche nach Titel in: TUfind oder in Google
Frage zum Eintrag Frage zum Eintrag

Optionen (nur für Redakteure)
Redaktionelle Details anzeigen Redaktionelle Details anzeigen