New Lower Bounds for Binary Codes of Asymmetric Distance Two

Zhen Zhang, Xiang Gen Xia

Research output: Contribution to journalArticlepeer-review

12 Citations (Scopus)

Abstract

New lower bounds for asymmetric single-error-correcting codes are derived. The codes are constructed by puncturing constant weight codes and by using a random coding argument.

Original languageEnglish
Pages (from-to)1592-1597
Number of pages6
JournalIEEE Transactions on Information Theory
Volume38
Issue number5
DOIs
Publication statusPublished - Sept 1992
Externally publishedYes

Keywords

  • Unidirectional errors
  • asymmetric distance
  • constant weight codes
  • error correcting codes
  • random coding and chains

Fingerprint

Dive into the research topics of 'New Lower Bounds for Binary Codes of Asymmetric Distance Two'. Together they form a unique fingerprint.

Cite this