Show simple item record

dc.contributor.authorAzar, Ghady
dc.contributor.authorAlajaji, Fady
dc.date.accessioned2016-02-17T18:53:27Z
dc.date.available2016-02-17T18:53:27Z
dc.date.issued2016-02-17
dc.identifier.urihttp://hdl.handle.net/1974/14027
dc.description.abstractWe 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 quasiperfect 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.en_US
dc.language.isoenen_US
dc.subjectBinary Channels with Finite and Infinite Memoryen_US
dc.subjectMarkov Noiseen_US
dc.subjectML and Minimum Distance Decodingen_US
dc.subjectBlock Codesen_US
dc.subjectSource-Channel Coding Dualityen_US
dc.subjectSyndrome Source Codingen_US
dc.titleOn the Equivalence Between Maximum Likelihood and Minimum Distance Decoding for Binary Contagion and Queue-Based Channels with Memoryen_US
dc.typejournal articleen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record