Coding in an asynchronous multiple-access channel

zbMATH Open0549.94017MaRDI QIDQ800291FDOQ800291

Authors: G. Sh. Poltyrev 

Publication date: 1983

Published in: Problems of Information Transmission (Search for Journal in Brave)

Recommendations

• Decoding of the trellis codes in a linear asynchronous multiple access channel
• On capacity regions of discrete asynchronous multiple access channels
• Rate-splitting multiple access for discrete memoryless channels
• Coding for a multiple-access channel
• Multiple-access channels with memory with and without frame synchronism

zbMATH Keywords

capacity regiondiscrete memoryless channelasynchronous multiple- accesstrellis codesViterbi's decoding algorithm

Mathematics Subject Classification ID

Statistical aspects of information-theoretic topics (62B10) Communication theory (94A05) Coding theorems (Shannon theory) (94A24) Decoding (94B35)

Cited In (14)

• On capacity regions of discrete asynchronous multiple access channels
• Title not available (Why is that?)
• Multiple-access channels with memory with and without frame synchronism
• Asynchronous multiple source network coding for wireless broadcasting
• Decoding of the trellis codes in a linear asynchronous multiple access channel
• Robust coding for multiple-access channels
• Title not available (Why is that?)
• Title not available (Why is that?)
• Nonhomogeneous Trellis codes for the Quasi-Synchronous Multiple-Access Binary adder channel with Two Users
• Title not available (Why is that?)
• A Note on Parallel Asynchronous Channels With Arbitrary Skews
• Title not available (Why is that?)
• Coding for a multiple access OR channel: A survey
• Rate-splitting multiple access for discrete memoryless channels

This page was built for publication: Coding in an asynchronous multiple-access channel

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q800291)