Literature Database Entry

salariseddigh2024identification-preprint

Mohammad J. Salariseddigh, Heinz Koeppl, Holger Boche and Vahid Jamali, "Identification over Affine Poisson Channels: Applications to Molecular Mixture Communication Systems," arXiv, cs.IT, 2410.11569, October 2024.

Abstract

Identification capacity has been established as a relevant performance metric for various goal-/task-oriented applications, where the receiver may be interested in only a particular message that represents an event or a task. For example, in olfactory molecular communications (MCs), odors or pheromones, which are often a mixture of various molecule types, may signal nearby danger, food, or a mate. In this paper, we examine the identification capacity with deterministic encoder for the discrete affine Poisson channel which can be used to model MC systems with molecule counting receivers. We establish lower and upper bounds on the identification capacity in terms of features of affinity matrix between the released molecules and receptors at the receiver. As a key finding, we show that even when the number of receptor types scales sub-linearly in the number of molecule types N, the number of reliably identifiable mixtures can grow super-exponentially with the rank of the affinity matrix, T, i.e., ∼2^(TlogT)R, where R denotes the coding rate. We further drive lower and upper bounds on R, and show that the proposed capacity theorem includes several known results in the literature as its special cases.

Quick access

Original Version DOI (at publishers web site)
BibTeX BibTeX

Contact

Mohammad J. Salariseddigh
Heinz Koeppl
Holger Boche
Vahid Jamali

BibTeX reference

@techreport{salariseddigh2024identification-preprint,
    author = {Salariseddigh, Mohammad J. and Koeppl, Heinz and Boche, Holger and Jamali, Vahid},
    doi = {10.48550/arXiv.2410.11569},
    title = {{Identification over Affine Poisson Channels: Applications to Molecular Mixture Communication Systems}},
    institution = {arXiv},
    month = {10},
    number = {2410.11569},
    type = {cs.IT},
    year = {2024},
   }
   
   

Copyright notice

Links to final or draft versions of papers are presented here to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted or distributed for commercial purposes without the explicit permission of the copyright holder.

The following applies to all papers listed above that have IEEE copyrights: Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

The following applies to all papers listed above that are in submission to IEEE conference/workshop proceedings or journals: This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible.

The following applies to all papers listed above that have ACM copyrights: ACM COPYRIGHT NOTICE. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM, Inc., fax +1 (212) 869-0481, or permissions@acm.org.

The following applies to all SpringerLink papers listed above that have Springer Science+Business Media copyrights: The original publication is available at www.springerlink.com.

This page was automatically generated using BibDB and bib2web.

Last modified: 2026-04-14