Polar Codes for the m-User Multiple Access Channel

DOI10.1109/TIT.2012.2201374MaRDI QIDQ2989852zbMATH OpenOpenAlexFDO

Authors Emmanuel Abbe, İ. Emre Telatar

Publication date 8 June 2017

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

Full work available at URL https://doi.org/10.1109/tit.2012.2201374

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Channel models (including quantum) in information and communication theory (94A40) Other types of codes (94B60)

Cited in

(13)

• Polar codes for distributed hierarchical source coding
• Successive cancellation decoding of Reed-Solomon codes
• Polar sampler: a novel Bernoulli sampler using polar codes with application to integer Gaussian sampling
• A Simple Proof of Polarization and Polarization for Non-Stationary Memoryless Channels
• Polar Coding for the Broadcast Channel With Confidential Messages: A Random Binning Analogy
• A class of codes for a T active users out of N multiple-access communication system
• scientific article; zbMATH DE number 6961201 (Why is no real title available?)
• Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels
• Interleaved Polar (I-Polar) Codes
• Polar Coding for Non-Stationary Channels
• Arikan meets Shannon: polar codes with near-optimal convergence to channel capacity
• Polar Coding Without Alphabet Extension for Asymmetric Models
• Unsourced random access

This page was built for publication: Polar Codes for the $m$-User Multiple Access Channel

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