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

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

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

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences Communications and Computer Sciences, 2020/10/01, Vol.E103.A(10), pp.1227-1233
Hauptverfasser: TAKEDA, Masayuki, YAMASAKI, Nobuyuki
Format: Artikel
Sprache:eng
Schlagworte:
4b/10b
Codes
Enumeration
Error correction
maximum clique enumeration
NP-hard
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 1233
container_issue 10
container_start_page 1227
container_title IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
container_volume E103.A
creator TAKEDA, Masayuki
YAMASAKI, Nobuyuki
description 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.
doi_str_mv 10.1587/transfun.2019DMP0019
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2447964088</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2447964088</sourcerecordid><originalsourceid>FETCH-LOGICAL-c416t-ffa4dca15868284f436e99e91a930f8b3ccf68719ed7e40bc2286db747252b873</originalsourceid><addsrcrecordid>eNpNkF9PwjAUxRujiYh-Ax-a-Dxot7J2j2TinwSiCfpcu66FkbHiXRf029sFVB6a06Tnd-7tQeiWkhGdCD72oJrWds0oJjS7X7ySIGdoQDmbRDRJ-DkakIymkZgQcYmu2nYTHCKmbIA-cleavYMSL40PpzbaV67B1gH2a4NnAA6i3AH0D80Ks2JMSYHnVWNwz-J95dd4ob6qbbfFeV19doFquq0B1Sddowur6tbcHHWI3h9mb_lTNH95fM6n80gzmvrIWsVKrcJ3UhELZlmSmiwzGVVZQqwoEq1tKjjNTMkNI4WOY5GWBWc8nsSF4MkQ3R1yd-DCCq2XG9dBE0bKmDGepYwIEVzs4NLg2haMlTuotgq-JSWy71L-dilPugzY8oBtWq9W5g9S4Ctdm39oRkkip33Y8XaS8ufWawXSNMkPZ9yGrQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2447964088</pqid></control><display><type>article</type><title>Codeword Set Selection for the Error-Correcting 4b/10b Line Code with Maximum Clique Enumeration</title><source>J-STAGE (Japan Science &amp; Technology Information Aggregator, Electronic) Freely Available Titles - Japanese</source><creator>TAKEDA, Masayuki ; YAMASAKI, Nobuyuki</creator><creatorcontrib>TAKEDA, Masayuki ; YAMASAKI, Nobuyuki</creatorcontrib><description>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.</description><identifier>ISSN: 0916-8508</identifier><identifier>EISSN: 1745-1337</identifier><identifier>DOI: 10.1587/transfun.2019DMP0019</identifier><language>eng</language><publisher>Tokyo: The Institute of Electronics, Information and Communication Engineers</publisher><subject>4b/10b ; Codes ; Enumeration ; Error correction ; maximum clique enumeration ; NP-hard</subject><ispartof>IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2020/10/01, Vol.E103.A(10), pp.1227-1233</ispartof><rights>2020 The Institute of Electronics, Information and Communication Engineers</rights><rights>Copyright Japan Science and Technology Agency 2020</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c416t-ffa4dca15868284f436e99e91a930f8b3ccf68719ed7e40bc2286db747252b873</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,1883,27924,27925</link.rule.ids></links><search><creatorcontrib>TAKEDA, Masayuki</creatorcontrib><creatorcontrib>YAMASAKI, Nobuyuki</creatorcontrib><title>Codeword Set Selection for the Error-Correcting 4b/10b Line Code with Maximum Clique Enumeration</title><title>IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences</title><addtitle>IEICE Trans. Fundamentals</addtitle><description>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.</description><subject>4b/10b</subject><subject>Codes</subject><subject>Enumeration</subject><subject>Error correction</subject><subject>maximum clique enumeration</subject><subject>NP-hard</subject><issn>0916-8508</issn><issn>1745-1337</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2020</creationdate><recordtype>article</recordtype><recordid>eNpNkF9PwjAUxRujiYh-Ax-a-Dxot7J2j2TinwSiCfpcu66FkbHiXRf029sFVB6a06Tnd-7tQeiWkhGdCD72oJrWds0oJjS7X7ySIGdoQDmbRDRJ-DkakIymkZgQcYmu2nYTHCKmbIA-cleavYMSL40PpzbaV67B1gH2a4NnAA6i3AH0D80Ks2JMSYHnVWNwz-J95dd4ob6qbbfFeV19doFquq0B1Sddowur6tbcHHWI3h9mb_lTNH95fM6n80gzmvrIWsVKrcJ3UhELZlmSmiwzGVVZQqwoEq1tKjjNTMkNI4WOY5GWBWc8nsSF4MkQ3R1yd-DCCq2XG9dBE0bKmDGepYwIEVzs4NLg2haMlTuotgq-JSWy71L-dilPugzY8oBtWq9W5g9S4Ctdm39oRkkip33Y8XaS8ufWawXSNMkPZ9yGrQ</recordid><startdate>20201001</startdate><enddate>20201001</enddate><creator>TAKEDA, Masayuki</creator><creator>YAMASAKI, Nobuyuki</creator><general>The Institute of Electronics, Information and Communication Engineers</general><general>Japan Science and Technology Agency</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20201001</creationdate><title>Codeword Set Selection for the Error-Correcting 4b/10b Line Code with Maximum Clique Enumeration</title><author>TAKEDA, Masayuki ; YAMASAKI, Nobuyuki</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c416t-ffa4dca15868284f436e99e91a930f8b3ccf68719ed7e40bc2286db747252b873</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2020</creationdate><topic>4b/10b</topic><topic>Codes</topic><topic>Enumeration</topic><topic>Error correction</topic><topic>maximum clique enumeration</topic><topic>NP-hard</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>TAKEDA, Masayuki</creatorcontrib><creatorcontrib>YAMASAKI, Nobuyuki</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics &amp; Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>TAKEDA, Masayuki</au><au>YAMASAKI, Nobuyuki</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Codeword Set Selection for the Error-Correcting 4b/10b Line Code with Maximum Clique Enumeration</atitle><jtitle>IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences</jtitle><addtitle>IEICE Trans. Fundamentals</addtitle><date>2020-10-01</date><risdate>2020</risdate><volume>E103.A</volume><issue>10</issue><spage>1227</spage><epage>1233</epage><pages>1227-1233</pages><issn>0916-8508</issn><eissn>1745-1337</eissn><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.</abstract><cop>Tokyo</cop><pub>The Institute of Electronics, Information and Communication Engineers</pub><doi>10.1587/transfun.2019DMP0019</doi><tpages>7</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 0916-8508
ispartof IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2020/10/01, Vol.E103.A(10), pp.1227-1233
issn 0916-8508
1745-1337
language eng
recordid cdi_proquest_journals_2447964088
source J-STAGE (Japan Science & Technology Information Aggregator, Electronic) Freely Available Titles - Japanese
subjects 4b/10b
Codes
Enumeration
Error correction
maximum clique enumeration
NP-hard
title Codeword Set Selection for the Error-Correcting 4b/10b Line Code with Maximum Clique Enumeration
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-06T12%3A46%3A15IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Codeword%20Set%20Selection%20for%20the%20Error-Correcting%204b/10b%20Line%20Code%20with%20Maximum%20Clique%20Enumeration&rft.jtitle=IEICE%20Transactions%20on%20Fundamentals%20of%20Electronics,%20Communications%20and%20Computer%20Sciences&rft.au=TAKEDA,%20Masayuki&rft.date=2020-10-01&rft.volume=E103.A&rft.issue=10&rft.spage=1227&rft.epage=1233&rft.pages=1227-1233&rft.issn=0916-8508&rft.eissn=1745-1337&rft_id=info:doi/10.1587/transfun.2019DMP0019&rft_dat=%3Cproquest_cross%3E2447964088%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2447964088&rft_id=info:pmid/&rfr_iscdi=true