Dirty-Paper Coding for the Gaussian Multiaccess Channel With Conferencing

DOI10.1109/TIT.2012.2202210zbMATH Open1364.94352MaRDI QIDQ2989762FDOQ2989762

Authors: Shraga I. Bross, Amos Lapidoth, Michèle Angela Wigger 

Publication date: 8 June 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 2065306
• scientific article; zbMATH DE number 2154513
• Near-Capacity Dirty-Paper Code Design: A Source-Channel Coding Approach
• The Arbitrarily Varying Multiple-Access Channel With Conferencing Encoders
• On the Dispersions of the Gel’fand–Pinsker Channel and Dirty Paper Coding
• Dirty-Paper Coding Versus TDMA for MIMO Broadcast Channels
• Multiuser Diversity for Successive Zero-Forcing Dirty Paper Coding: Greedy Scheduling Algorithms and Asymptotic Performance Analysis
• The Dirty MIMO Multiple-Access Channel
• The Gaussian Many-to-One Interference Channel With Confidential Messages
• Approximate Capacity of the Dirty Multiple-Access Channel With Partial State Information at the Encoders

Mathematics Subject Classification ID

Source coding (94A29) Channel models (including quantum) in information and communication theory (94A40)

Cited In (2)

• Title not available (Why is that?)
• On the Capacity of the Carbon Copy onto Dirty Paper Channel

This page was built for publication: Dirty-Paper Coding for the Gaussian Multiaccess Channel With Conferencing

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