Codeword set selection for the error-correcting 4b/10b line code with maximum clique enumeration

Masayuki Takeda, Nobuyuki Yamasaki

Research output: Contribution to journalArticlepeer-review

Abstract

This paper addresses the problem of finding, evaluating, and selecting the best set of codewords for the 4b/10b line code, a dependable line code with forward error correction (FEC) designed for real-time communication. Based on the results of our scheme [1], we formulate codeword search as an instance of the maximum clique problem, and enumerate all candidate codeword sets via maximum clique enumeration as proposed by Eblen et al. [2]. We then measure each set in terms of resistance to bit errors caused by noise and present a canonical set of codewords for the 4b/10b line code. Additionally, we show that maximum clique enumeration is #P-hard.

Original languageEnglish
Pages (from-to)1227-1233
Number of pages7
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
VolumeE103A
Issue number10
DOIs
Publication statusPublished - 2020 Oct 1

Keywords

  • 4b/10b
  • Maximum clique enumeration
  • NP-hard

ASJC Scopus subject areas

  • Signal Processing
  • Computer Graphics and Computer-Aided Design
  • Electrical and Electronic Engineering
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Codeword set selection for the error-correcting 4b/10b line code with maximum clique enumeration'. Together they form a unique fingerprint.

Cite this