Universal detection of messages via finite-state channels

DOI10.1109/18.868498zbMATH Open0997.94005OpenAlexW2151534286MaRDI QIDQ2705954

Neri Merhav

Publication date: 19 March 2001

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

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

zbMATH Keywords

watermarkingLempel-Ziv algorithmNeyman-Pearson criterionfinite-state channeloptimum decision ruleuniversal decoding

Mathematics Subject Classification ID

Detection theory in information and communication theory (94A13) Decoding (94B35) Channel models (including quantum) in information and communication theory (94A40)

Related Items (1)

Universal decoding for finite-state channels

This page was built for publication: Universal detection of messages via finite-state channels

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