Properties of estimation algorithms for binary sequences

MaRDI QIDQ1066861zbMATH OpenFDO

Authors S. T. Grinchenko, N. D. Tarankova

Publication date 1985

Published in Problems of Information Transmission (Search for Journal in Brave)

zbMATH Keywords

average error probability per symbolbinary symmetric memoryless channelMarkov sourcestatistical communication theorysymbol-by-symbol reception

Mathematics Subject Classification ID

Communication theory (94A05)

Recommendations

• Investigation of the properties of an optimal reception algorithm for binary signals
• scientific article; zbMATH DE number 4009475
• Monotonicity-Based Fast Algorithms for MAP Estimation of Markov Sequences Over Noisy Channels
• Blind sequence estimation
• On estimation for a binary-symmetric channel

Cited in

(4)

• Estimation of 1-bit quantized time-series with Markov regime
• Investigation of the properties of an optimal reception algorithm for binary signals
• Monotonicity-Based Fast Algorithms for MAP Estimation of Markov Sequences Over Noisy Channels
• Sequence acquisition using bit estimation techniques

This page was built for publication: Properties of estimation algorithms for binary sequences

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