Copertina

Capacity Bounds for the Poisson-Repeat Channel

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Kazemi, Mohammad, Duman, Tolga M.
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Information Theory
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Characterization of Deletion/Substitution Channel Capacity for Small Deletion and Substitution Probabilities
di: Kazemi, Mohammad, et al.
Pubblicazione: (2025)

Channels with Markov Synchronization Errors: Information Stability and Capacity Bounds
di: Morozov, Ruslan, et al.
Pubblicazione: (2024)

On the Capacity of Insertion Channels for Small Insertion Probabilities
di: Tegin, Busra, et al.
Pubblicazione: (2025)

Capacity Approximations for Insertion Channels with Small Insertion Probabilities
di: Tegin, Busra, et al.
Pubblicazione: (2024)

Communication via Sensing
di: Kazemi, Mohammad, et al.
Pubblicazione: (2025)

RIS-Aided Unsourced Multiple Access (RISUMA): Coding Strategy and Performance Limits
di: Ahmadi, Mohammad Javad, et al.
Pubblicazione: (2024)

An ODMA-Based Unsourced Random Access Scheme with a Multiple Antenna Receiver
di: Ozates, Mert, et al.
Pubblicazione: (2024)

Simple Finite-Length Achievability and Converse Bounds for the Deletion Channel and the Insertion Channel
di: Morozov, Ruslan, et al.
Pubblicazione: (2025)

Error Correcting Codes for Segmented Burst-Deletion Channels
di: Liu, Yajuan, et al.
Pubblicazione: (2025)

Half-Marker Codes for Deletion Channels with Applications in DNA Storage
di: Haghighat, Javad, et al.
Pubblicazione: (2025)

A Practical Concatenated Coding Scheme for Noisy Shuffling Channels with Coset-based Indexing
di: Haghighat, Javad, et al.
Pubblicazione: (2024)

Unsourced Random Access: A Comprehensive Survey
di: Ozates, Mert, et al.
Pubblicazione: (2024)

A Deep Learning Based Decoder for Concatenated Coding over Deletion Channels
di: Kargı, E. Uras, et al.
Pubblicazione: (2024)

Constrained Error-Correcting Codes for Efficient DNA Synthesis
di: Liu, Yajuan, et al.
Pubblicazione: (2025)

Robust Composite DNA Storage under Sampling Randomness, Substitution, and Insertion-Deletion Errors
di: Tegin, Busra, et al.
Pubblicazione: (2026)

Error-Correcting Codes for Two Bursts of t1-Deletion-t2-Insertion with Low Computational Complexity
di: Liu, Yajuan, et al.
Pubblicazione: (2026)

Upper Bounds on Multiple $b$-Burst Deletion-Correcting Codes
di: Wang, Chen, et al.
Pubblicazione: (2026)

Improved Bounds on the Number of Support Points of the Capacity-Achieving Input for Amplitude Constrained Poisson Channels
di: Barletta, Luca, et al.
Pubblicazione: (2024)

Identification Capacity of the Discrete-Time Poisson Channel
di: Labidi, Wafa, et al.
Pubblicazione: (2023)

Binomial Channel: On the Capacity-Achieving Distribution and Bounds on the Capacity
di: Zieder, Ian, et al.
Pubblicazione: (2024)

Capacity Bounds on Doppler OFDM Channels
di: Orellana, Pablo, et al.
Pubblicazione: (2026)

Capacity Bounds for Broadcast Channels with Bidirectional Conferencing Decoders
di: Farsani, Reza K., et al.
Pubblicazione: (2024)

Dependence Balance and Capacity Bounds for Multiterminal Communication and Wiretap Channels
di: Gohari, Amin, et al.
Pubblicazione: (2020)

Function Computation Over Multiple Access Channels via Hierarchical Constellations
di: Razavikia, Saeed, et al.
Pubblicazione: (2026)

Simple Bounds for the Symmetric Capacity of the Rayleigh Fading Multiple Access Channel
di: Domanovitz, Elad, et al.
Pubblicazione: (2019)

Over-the-Air Multi-Sensor Inference with Neural Networks Using Memristor-Based Analog Computing
di: Tegin, Busra, et al.
Pubblicazione: (2025)

Fully Asynchronous Unsourced Random Access over Fading Channels
di: Ozates, Mert, et al.
Pubblicazione: (2025)

Capacity Bounds under Imperfect Polarization Tracking
di: Farsi, Mohammad, et al.
Pubblicazione: (2021)

Identification over Affine Poisson Channels: Application to Molecular Mixture Communication Systems
di: Salariseddigh, Mohammad Javad, et al.
Pubblicazione: (2024)

On Strong Converse Bounds for the Private and Quantum Capacities of Anti-degradable Channels
di: Khanian, Zahra Baghali, et al.
Pubblicazione: (2025)

Volume-Based Lower Bounds to the Capacity of the Gaussian Channel Under Pointwise Additive Input Constraints
di: Merhav, Neri, et al.
Pubblicazione: (2025)

An Improved Lower Bound on Support Size of Capacity-Achieving Inputs for the Binomial Channel: Extended version
di: Baniasadi, Mohammadamin, et al.
Pubblicazione: (2026)

Improved Capacity Upper Bounds for the Deletion Channel using a Parallelized Blahut-Arimoto Algorithm
di: Pinto, Martim, et al.
Pubblicazione: (2026)

A Tight Channel-Capacity Lower Bound for the Simultaneous Wireless Information and Power Transfer Integrated Receiver
di: Ntontin, Konstantinos, et al.
Pubblicazione: (2026)

The Capacity of the Weighted Read Channel
di: Yerushalmi, Omer, et al.
Pubblicazione: (2024)

On the Capacity of Sequences of Coloring Channels
di: Yu, Wenjun, et al.
Pubblicazione: (2026)

Covert Capacity of Degraded Broadcast Channels
di: Steinberg, Yossef, et al.
Pubblicazione: (2026)

On the Capacity of Noisy Frequency-based Channels
di: Gerzon, Yuval, et al.
Pubblicazione: (2026)

Capacity of the Binary Energy Harvesting Channel
di: Shemuel, Eli, et al.
Pubblicazione: (2025)

List-Decoding Capacity Implies Capacity on the q-ary Symmetric Channel
di: Pernice, Francisco, et al.
Pubblicazione: (2024)