Convexity properties in binary detection problems

DOI10.1109/18.508867MaRDI QIDQ4885746zbMATH OpenOpenAlexFDO

Authors Murat Azizoğlu

Publication date 28 July 1996

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

Full work available at URL https://semanticscholar.org/paper/c388aa18562952d3f64a23833403b46b37752655

zbMATH Keywords

convexityerror probabilitydetectiontime-sharingchannel switchingmaximum-likelihood receiver

Mathematics Subject Classification ID

Detection theory in information and communication theory (94A13) Error probability in coding theory (94B70)

Recommendations

• Convex Sets and Nondestructive Assay
• Matching binary convexities
• Applications of convexity in some identification problems
• On the complexity of detecting convexity over a box
• Convex optimisation-based methods for K-complex detection
• scientific article; zbMATH DE number 1140602
• A binary characterization method for shape convexity and applications
• scientific article; zbMATH DE number 848086
• Hypothesis testing by convex optimization
• Discrete convexity and its applications

Cited in

(5)

• On Binary Detection with Hysteresis
• Convex optimization of error probability of multi-antenna broadcast channel
• Convex optimisation-based methods for K-complex detection
• Comments on "Correlated Jamming on MIMO Gaussian Fading Channels
• Signal convexity and noise convexity of the Chernoff and divergence distances (Corresp.)

This page was built for publication: Convexity properties in binary detection problems

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