.png){kind=icon}
返回
On the Equivalence Between Maximum Likelihood and Minimum Distance Decoding for Binary Contagion and Queue-Based Channels With Memory
.png){kind=icon}
OA
AI
DOI：10.1109/TCOMM.2014.2378257.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We study the optimal maximum likelihood (ML) block decoding of general binary codes sent over two classes of binary additive noise channels with memory. Specifically, we consider the infinite and finite memory Polya contagion and queue-based channel models, which were recently shown to approximate well binary modulated correlated fading channels used with hard-decision demodulation. We establish conditions on the codes and channels parameters under which ML and minimum Hamming distance decoding are equivalent. We also present results on the optimality of classical perfect and quasi-perfect codes when used over the channels under ML decoding. Finally, we briefly apply these results to the dual problem of syndrome source coding with and without side information.
Keyword:
Binary channels with finite and infinite memory
Markov noise
ML and minimum distance decoding
block codes
source-channel coding duality
syndrome source coding
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.3
论文数:
1.2W
被引数:
3.6W
机构
引用论文
分享收藏The Relationship Between Static and Dynamic Risk Factors and Reconviction in a Sample of U.K. Child Abusers.png)
Sexual Abuse
Sexual AbuseIF0
PREAI
分享收藏Bathymetry and Microtopography of Black Sea<xref ref-type="fn" rid="ch01fn1"><sup>1</sup></xref>
PREAI
分享收藏
查看更多内容