On computing Verdu's upper bound for a class of maximum-likelihood multiuser detection and sequence detection problems

DOI10.1109/18.959286zbMATH Open1018.94517OpenAlexW2132750713MaRDI QIDQ4544752FDOQ4544752

K. M. Wong, P. C. Ching, Wing-Kin Ma

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.959286

zbMATH Keywords

maximum-likelihood detectionmultiuser detectorbit error performanceindecomposable error vectors

Mathematics Subject Classification ID

Detection theory in information and communication theory (94A13) General topics in the theory of algorithms (68W01)

Cited In (1)

• Indecomposable error sequences in multiuser detection

   Recommendations

• Maximum likelihood sequence detection for intersymbol interference channels: A new upper bound on error probability 👍 👎
• Indecomposable error sequences in multiuser detection 👍 👎
• On the probability of error in linear multiuser detection 👍 👎
• A Geometric Derivation of Forney's Upper Bound 👍 👎
• An improved bound on the performance of maximum-likelihood multiuser detection receivers in Rayleigh fading 👍 👎

This page was built for publication: On computing Verdu's upper bound for a class of maximum-likelihood multiuser detection and sequence detection problems

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