Trellis Code Error Exponent From Results for Asynchronous Multiple Access Channels
L\'or\'ant Farkas
TL;DR
This paper explores the error exponents of asynchronous multiple access channels and derives new results for time-invariant trellis codes of memory 1, enhancing understanding of their performance in such environments.
Contribution
It introduces a novel connection between asynchronous channel error exponents and trellis codes of memory 1, providing new theoretical insights.
Findings
Derived a new error exponent result for asynchronous multiple access channels.
Established a link between channel error performance and trellis code properties.
Enhanced theoretical understanding of trellis code effectiveness in asynchronous settings.
Abstract
An asynchronous multiple access error exponent result implicates a new result for time invariant trellis codes of memory 1.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsError Correcting Code Techniques · Cellular Automata and Applications · Coding theory and cryptography