Coding for a multiple access OR channel: A survey
From MaRDI portal
(Redirected from Publication:947083)
Recommendations
- Coding for a multiple-access channel
- Publication:4886144
- Coding for the fading channel: A survey.
- Coding in an asynchronous multiple-access channel
- Homologous Codes for Multiple Access Channels
- Robust coding for multiple-access channels
- scientific article; zbMATH DE number 2063204
- scientific article; zbMATH DE number 3885786
- Multiple-Access Network Information-Flow and Correction Codes
- Multicoding Schemes for Interference Channels
Cites work
- scientific article; zbMATH DE number 3831842 (Why is no real title available?)
- scientific article; zbMATH DE number 3841775 (Why is no real title available?)
- scientific article; zbMATH DE number 4043100 (Why is no real title available?)
- scientific article; zbMATH DE number 4064918 (Why is no real title available?)
- scientific article; zbMATH DE number 3801449 (Why is no real title available?)
- scientific article; zbMATH DE number 823957 (Why is no real title available?)
- scientific article; zbMATH DE number 3316587 (Why is no real title available?)
- A Method for Detecting All Defective Members in a Population by Group Testing
- An improvement of the Gilbert bound for constant weight codes (Corresp.)
- Born again group testing: Multiaccess communications
- Constructions of binary constant-weight cyclic codes and cyclically permutable codes
- Constructions of protocol sequences for multiple access collision channel without feedback
- Families of finite sets in which no set is covered by the union of \(r\) others
- Generalized Reed - Solomon codes from algebraic geometry
- Locality based graph coloring
- Locality in Distributed Graph Algorithms
- Maximum distance separable multilevel codes (Corresp.)
- New constructions of superimposed codes
- Non-adaptive group testing in the presence of errors
- Nonrandom binary superimposed codes
- On Sperner families satisfying an additional condition
- On r-cover-free families
- On a packing and covering problem
- On the Detection of Defective Members of Large Populations
- On the upper bound of the size of the \(r\)-cover-free families
- Some long cyclic linear binary codes are not so bad
- Transform Techniques for Error Control Codes
Cited in
(17)- A perspective on multiaccess channels
- scientific article; zbMATH DE number 3865145 (Why is no real title available?)
- A low-complexity source encoding assisted multiple access protocol for voice/data integrated networks
- Structured Mappings and Conferencing Common Information for Multiple-Access Channels
- Channel Coding Techniques for Wireless Communications
- Coding for the Multiple-Access Adder Channel
- Literature reviews in operations research: a new taxonomy and a meta review
- scientific article; zbMATH DE number 3693146 (Why is no real title available?)
- Multiple-Access Channel With Partial and Controlled Cribbing Encoders
- An orthogonal multiple access coding scheme
- A class of codes for a T active users out of N multiple-access communication system
- scientific article; zbMATH DE number 2063204 (Why is no real title available?)
- scientific article; zbMATH DE number 4002030 (Why is no real title available?)
- Multiple-Access Network Information-Flow and Correction Codes
- Basic concepts and mathematical aspects in channel coding: multialternative rules
- A new kind of selectors and their applications to conflict resolution in wireless multichannels networks
- On the Compound Broadcast Channel: Multiple Description Coding and Interference Decoding
This page was built for publication: Coding for a multiple access OR channel: A survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q947083)
