Indecomposable error sequences in multiuser detection

DOI10.1109/18.904527MaRDI QIDQ4544469zbMATH OpenOpenAlexFDO

Authors Wei Luo, Anthony Ephremides

Publication date 4 August 2002

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

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

zbMATH Keywords

code-division multiple-accesserror probabilityerror sequencesmaximum-likelihood detection

Mathematics Subject Classification ID

Applications of graph theory (05C90) Detection theory in information and communication theory (94A13)

Recommendations

• On the probability of error in linear multiuser detection
• On computing Verdu's upper bound for a class of maximum-likelihood multiuser detection and sequence detection problems
• Probability of error in MMSE multiuser detection
• On the relative error probabilities of linear multiuser detectors
• On a geometric view of multiuser detection for synchronous DS/CDMA channels

Cited in

(2)

• On the Subexponential Decay of Detection Error Probabilities in Long Tandems
• On computing Verdu's upper bound for a class of maximum-likelihood multiuser detection and sequence detection problems

This page was built for publication: Indecomposable error sequences in multiuser detection

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