Ladder Codes: A Class of Error-Correcting Codes with Multi-Level Shared Redundancy

Pengfei Huang, Eitan Yaakobi, Paul H. Siegel

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Error-correcting codes play an important role in storage systems to maintain data integrity. In this work, we propose a new class of linear error- correcting codes, called ladder codes, whose codeword structure consists of multiple codewords of certain component codes and also their shared redundancy. First, we give a general construction for an μ-level ladder code, determine the code length and dimension, and also derive a lower bound d-Lon the minimum distance. Some examples of ladder codes are presented. Then, we study correctable error-erasure patterns of ladder codes and give a corresponding decoding algorithm. Finally, we compare a two-level ladder code with a concatenated code, and show that the former can outperform the latter in many cases. Ladder codes have potential to be used for data protection in flash memories where only a few pages may suffer from severe errors in a block.

Original languageEnglish
Title of host publication2018 IEEE International Conference on Communications, ICC 2018 - Proceedings
DOIs
StatePublished - 27 Jul 2018
Event2018 IEEE International Conference on Communications, ICC 2018 - Kansas City, United States
Duration: 20 May 201824 May 2018

Publication series

NameIEEE International Conference on Communications
Volume2018-May

Conference

Conference2018 IEEE International Conference on Communications, ICC 2018
Country/TerritoryUnited States
CityKansas City
Period20/05/1824/05/18

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Ladder Codes: A Class of Error-Correcting Codes with Multi-Level Shared Redundancy'. Together they form a unique fingerprint.

Cite this