Trellis Code Error Exponent From Results for Asynchronous Multiple Access Channels
Information Theory
2020-12-18 v1 math.IT
Authors:
Lóránt Farkas
Abstract
An asynchronous multiple access error exponent result implicates a new result for time invariant trellis codes of memory 1.
Cite
@article{arxiv.2012.09705,
title = {Trellis Code Error Exponent From Results for Asynchronous Multiple Access Channels},
author = {Lóránt Farkas},
journal= {arXiv preprint arXiv:2012.09705},
year = {2020}
}
Related papers
View all related →
Information Theory · Computer Science
Error Exponents of Typical Random Trellis Codes
Neri Merhav
2019-03-05
Information Theory · Computer Science
Multiple-Access Channel with Independent Sources: Error Exponent Analysis
Arezou Rezazadeh, Josep Font-Segura, Alfonso Martinez, Albert Guillén i Fàbregas
2018-09-06
Information Theory · Computer Science
Error Exponents for Asynchronous Multiple Access Channels. Controlled Asynchronism may Outperform Synchronism
Lóránt Farkas, Tamás Kói
2020-02-04
Information Theory · Computer Science
Random Access and Source-Channel Coding Error Exponents for Multiple Access Channels
Lóránt Farkas, Tamás Kói
2013-09-19
Information Theory · Computer Science
Gallager's Exponent for MIMO Channels: A Reliability-Rate Tradeoff
Hyundong Shin, Moe Z. Win
2007-07-13
Information Theory · Computer Science
Achievable Error Exponents of One-Way and Two-Way AWGN Channels
Kenneth Palacio-Baus, Natasha Devroye
2019-01-23
Quantum Physics · Physics
Exponent for classical-quantum multiple access channel
Masahito Hayashi, Ning Cai
2017-02-08
Information Theory · Computer Science
Joint Source-Channel Coding for the Multiple-Access Channel with Correlated Sources
Arezou Rezazadeh, Josep Font-Segura, Alfonso Martinez, Albert Guillén i Fàbregas
2019-04-19
Information Theory · Computer Science
Dual-Domain Exponent of Maximum Mutual Information Decoding
AmirPouya Moeini, Albert Guillén i Fàbregas
2025-07-25
Information Theory · Computer Science
On Capacity Regions of Discrete Asynchronous Multiple Access Channels
Lóránt Farkas, Tamás Kói
2015-01-06
Information Theory · Computer Science
Trapping Set Enumerators for Repeat Multiple Accumulate Code Ensembles
Christian Koller, Alexandre Graell i Amat, Joerg Kliewer, Daniel J. Costello
2016-11-15
Information Theory · Computer Science
Distributed Structure: Joint Expurgation for the Multiple-Access Channel
Eli Haim, Yuval Kochman, Uri Erez
2016-11-18
Information Theory · Computer Science
Error-Trellis Construction for Tailbiting Convolutional Codes
Masato Tajima, Koji Okino
2012-01-24
Information Theory · Computer Science
Universal Random Access Error Exponents for Codebooks of Different Word-Lengths
Lóránt Farkas, Tamás Kói
2017-01-24
Information Theory · Computer Science
Simultaneous Code/Error-Trellis Reduction for Convolutional Codes Using Shifted Code/Error-Subsequences
Masato Tajima, Koji Okino, Takashi Miyagoshi
2015-05-27
Information Theory · Computer Science
Trellis-Coded Non-Orthogonal Multiple Access
Xun Zou, Mehdi Ganji, Hamid Jafarkhani
2019-12-24
Information Theory · Computer Science
Error Exponents of Typical Random Codes for the Colored Gaussian Channel
Neri Merhav
2018-12-18
Information Theory · Computer Science
Mismatched Multi-Letter Successive Decoding for the Multiple-Access Channel
Jonathan Scarlett, Alfonso Martinez, Albert Guillén i Fàbregas
2017-12-08
Information Theory · Computer Science
Error Exponent for Multiple-Access Channels:Lower Bounds
Ali Nazari, Achilleas Anastasopoulos, S. Sandeep Pradhan
2010-10-08
Information Theory · Computer Science
Variable Length Coding over the Two-User Multiple-Access Channel
Stephane Musy
2011-02-28
Information Theory · Computer Science
Error Performance of Channel Coding in Random Access Communication
Zheng Wang, Jie Luo
2016-11-15
Information Theory · Computer Science
Sequential Decoding of Multiple Traces Over the Syndrome Trellis for Synchronization Errors
Anisha Banerjee, Lorenz Welter, Alexandre Graell i Amat, Antonia Wachter-Zeh +1
2024-10-10
Information Theory · Computer Science
Typical Error Exponents: A Dual Domain Derivation
Giuseppe Cocco, Albert Guillén i Fàbregas, Josep Font-Segura
2022-04-04
Information Theory · Computer Science
Efficient Computation of Marton's Error Exponent via Constraint Decoupling
Jiachuan Ye, Shitong Wu, Lingyi Chen, Wenyi Zhang +2
2025-07-29
Information Theory · Computer Science
First- and Second-Order Hypothesis Testing for Mixed Memoryless Sources with General Mixture
Te Sun Han, Ryo Nomura
2018-04-04