on decoding of maximum- distance separable linear codes

Sik-Sang Yau, YC LIU YC

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

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
VolumeIT-17
Issue number4
StatePublished - Jul 1971
Externally publishedYes

Fingerprint

Decoding
Random errors
hardware
Hardware

ASJC Scopus subject areas

  • Information Systems
  • Electrical and Electronic Engineering

Cite this

on decoding of maximum- distance separable linear codes. / Yau, Sik-Sang; LIU YC, YC.

In: IEEE Transactions on Information Theory, Vol. IT-17, No. 4, 07.1971, p. 487-491.

Research output: Contribution to journalArticle

@article{94d92b7f19bd4aa1bcfa9789b0cccb25,
title = "on decoding of maximum- distance separable linear codes",
abstract = "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.",
author = "Sik-Sang Yau and {LIU YC}, YC",
year = "1971",
month = "7",
language = "English (US)",
volume = "IT-17",
pages = "487--491",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "4",

}

TY - JOUR

T1 - on decoding of maximum- distance separable linear codes

AU - Yau, Sik-Sang

AU - LIU YC, YC

PY - 1971/7

Y1 - 1971/7

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0015096128&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0015096128&partnerID=8YFLogxK

M3 - Article

VL - IT-17

SP - 487

EP - 491

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 4

ER -