Coding for a multiple-access channel

DOI10.1109/TIT.1976.1055529MaRDI QIDQ4082678zbMATH OpenFDO

Authors Tadao Kasami, Shu Lin

Publication date 1976

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

Full work available at URL https://doi.org/10.1109/TIT.1976.1055529

zbMATH Keywords

block codes

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40) Linear codes (general theory) (94B05)

Recommendations

• Further results on coding for T-user multiple-access channels (Corresp.)
• Code construction for the noiseless binary switching multiple-access channel
• Concatenated codes for multiple access channels (Corresp.)
• scientific article; zbMATH DE number 910967
• Linear codes for the sum mod-2 multiple-access channel with restricted access

Cited in

(42)

• Transmission over a multiple-access channel with a special source hierarchy
• Multiple-user communication
• An access algorithm for a communication channel
• Multiple access system for a vector disjunctive channel
• Multiple-access hyperchannel
• Compositional restricted multiple access channel
• Multiple-Access Channel With Partial and Controlled Cribbing Encoders
• scientific article; zbMATH DE number 3865145 (Why is no real title available?)
• Further results on coding for T-user multiple-access channels (Corresp.)
• scientific article; zbMATH DE number 3877071 (Why is no real title available?)
• A class of codes for a T active users out of N multiple-access communication system
• Codes with the identifiable parent property and the multiple–access channel
• An orthogonal multiple access coding scheme
• Offset Encoding for Multiple-Access Relay Channels
• Random coding bound and codes produced by permutations for the multiple-access channel
• Robust coding for multiple-access channels
• Code construction for the noiseless binary switching multiple-access channel
• Concatenated codes for multiple access channels (Corresp.)
• Existence of Good δ-Decodable Codes for the Two-User Multiple-Access Adder Channel
• scientific article; zbMATH DE number 3675781 (Why is no real title available?)
• scientific article; zbMATH DE number 3693145 (Why is no real title available?)
• scientific article; zbMATH DE number 3693146 (Why is no real title available?)
• Disjoint uniquely decodable codebooks for noiseless synchronized multiple-access adder channels generated by integer sets
• Bounds on the achievable rates of block coding for a memoryless multiple-access channel
• scientific article; zbMATH DE number 2063204 (Why is no real title available?)
• Lossless and near-lossless source coding for multiple access networks
• Error control coding for the N-user mod-2 multiple-access channel
• scientific article; zbMATH DE number 3997698 (Why is no real title available?)
• Linear codes for the sum mod-2 multiple-access channel with restricted access
• scientific article; zbMATH DE number 820500 (Why is no real title available?)
• scientific article; zbMATH DE number 910967 (Why is no real title available?)
• scientific article; zbMATH DE number 1456808 (Why is no real title available?)
• Coding and Decoding for the Dynamic Decode and Forward Relay Protocol
• Basic concepts and mathematical aspects in channel coding: multialternative rules
• Coupling Data Transmission for Multiple-Access Communications
• Channel Coding Techniques for Wireless Communications
• Codes for Symbol-Pair Read Channels
• Multiple-Access Network Information-Flow and Correction Codes
• Coding and capacity calculation for the \(\mathcal{T}\)-user \(F\)-adder channel
• Coding in an asynchronous multiple-access channel
• Generalized correlation metric for decoding in a multiple access channel
• Coding for a multiple access OR channel: A survey

This page was built for publication: Coding for a multiple-access channel

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