Maximum Likelihood Decoding for Multilevel Channels With Gain and Offset Mismatch

DOI10.1109/TIT.2016.2521658zbMATH Open1359.94836arXiv1509.02748MaRDI QIDQ2976949

Simon R. Blackburn

Publication date: 28 April 2017

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

Abstract: K.A.S. Immink and J.H. Weber recently defined and studied a channel with both gain and offset mismatch, modelling the behaviour of charge-leakage in flash memory. They proposed a decoding measure for this channel based on minimising Pearson distance (a notion from cluster analysis). The paper derives a formula for maximum likelihood decoding for this channel, and also defines and justifies a notion of minimum distance of a code in this context.

Full work available at URL: https://arxiv.org/abs/1509.02748

Mathematics Subject Classification ID

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

Related Items (1)

Mismatched Multi-Letter Successive Decoding for the Multiple-Access Channel

This page was built for publication: Maximum Likelihood Decoding for Multilevel Channels With Gain and Offset Mismatch

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