Channel decomposition for multilevel codes over multilevel and partial erasure channels

Carolyn Mayer, Kathryn Haymaker, Christine A. Kelley

Research output: Contribution to journalArticlepeer-review


We introduce the Multilevel Erasure Channel (MEC) for binary extension field alphabets. The channel model is motivated by applications such as non-volatile multilevel read storage channels. Like the recently proposed q-ary partial erasure channel (QPEC), the MEC is designed to capture partial erasures. The partial erasures addressed by the MEC are determined by erasures at the bit level of the q-ary symbol representation. In this paper we derive the channel capacity of the MEC and give a multistage decoding scheme on the MEC using binary codes. We also present a low complexity multistage p-ary decoding strategy for codes on the QPEC when q = pk. We show that for appropriately chosen component codes, capacity on the MEC and QPEC may be achieved.

Original languageEnglish (US)
Pages (from-to)151-168
Number of pages18
JournalAdvances in Mathematics of Communications
Issue number1
StatePublished - Feb 2018


  • Multilevel codes
  • Multistage decoding
  • Partial erasure channels
  • Storage channels

ASJC Scopus subject areas

  • Algebra and Number Theory
  • Computer Networks and Communications
  • Discrete Mathematics and Combinatorics
  • Applied Mathematics


Dive into the research topics of 'Channel decomposition for multilevel codes over multilevel and partial erasure channels'. Together they form a unique fingerprint.

Cite this