Codeword Set Selection for the Error-Correcting 4b/10b Line Code with Maximum Clique Enumeration

Masayuki TAKEDA
Nobuyuki YAMASAKI

Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E103-A    No.10    pp.1227-1233
Publication Date: 2020/10/01
Online ISSN: 1745-1337
DOI: 10.1587/transfun.2019DMP0019
Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category: communication
Keyword: 
4b/10b,  NP-hard,  maximum clique enumeration,  

Full Text: FreePDF(664.9KB)

Summary: 
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.