On Decoding of Maximum-Distance Separable Linear Codes

Stephen S. Yau, Yu Cheng Liu

Research output: Contribution to journalArticlepeer-review

7 Scopus citations


In this paper, some properties of maximum-distance separable linear codes are presented. Based on these properties, a decoding algorithm for correcting random errors is established. A simpler decoding algorithm for correcting burst errors is also given. Applying these decoding algorithms to known classes of maximum-distance separable linear codes, the amount of hardware required for implementation is only a small fraction of those required by the existing decoding algorithms.

Original languageEnglish (US)
Pages (from-to)487-491
Number of pages5
JournalIEEE Transactions on Information Theory
Issue number4
StatePublished - Jul 1971
Externally publishedYes

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences


Dive into the research topics of 'On Decoding of Maximum-Distance Separable Linear Codes'. Together they form a unique fingerprint.

Cite this