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

Masayuki Takeda; Nobuyuki Yamasaki

doi:10.1587/transfun.2019DMP0019

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

Masayuki Takeda, Nobuyuki Yamasaki

Department of Information and Computer Science

Research output: Contribution to journal › Article › peer-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 language	English
Pages (from-to)	1227-1233
Number of pages	7
Journal	IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Volume	E103A
Issue number	10
DOIs	https://doi.org/10.1587/transfun.2019DMP0019
Publication status	Published - 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

Access to Document

10.1587/transfun.2019DMP0019

Cite this

@article{d0d7e15939e34e35ba87e528aa8fa7ce,

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

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.",

keywords = "4b/10b, Maximum clique enumeration, NP-hard",

author = "Masayuki Takeda and Nobuyuki Yamasaki",

year = "2020",

month = oct,

day = "1",

doi = "10.1587/transfun.2019DMP0019",

language = "English",

volume = "E103A",

pages = "1227--1233",

journal = "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences",

issn = "0916-8508",

publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",

number = "10",

}

TY - JOUR

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

AU - Takeda, Masayuki

AU - Yamasaki, Nobuyuki

PY - 2020/10/1

Y1 - 2020/10/1

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

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

KW - 4b/10b

KW - Maximum clique enumeration

KW - NP-hard

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

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

U2 - 10.1587/transfun.2019DMP0019

DO - 10.1587/transfun.2019DMP0019

M3 - Article

AN - SCOPUS:85094118782

SN - 0916-8508

VL - E103A

SP - 1227

EP - 1233

JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

IS - 10

ER -

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

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this