Summary
The 2018 International Symposium on Information Theory and Its Applications (ISITA2018)
2018
Session Number:Mo-PM-2-3
Session:
Number:Mo-PM-2-3.2
Complete Multipartite Graph Codes
Yuta Kumano, Yoshiyuki Sakamaki, Hironori Uchikawa,
pp.237-241
Publication Date:2018/10/18
Online ISSN:2188-5079
DOI:10.34385/proc.55.Mo-PM-2-3.2
PDF download
Summary:
Graph codes are constructed from undirected graphs where the code symbols correspond to the edges and component codes are associated with the vertices. We investigate graph codes on multigraphs whereas previous work has mainly studied them on simple graphs. This paper proposes graph codes constructed from complete multipartite graphs as generalizations of block-wise product codes. The graph codes show better errorcorrecting performance in error-floor region compared with block-wise product codes. This paper also shows an efficient encoding method for the graph codes by employing Richardson and Urbanke’s encoding algorithm for LDPC codes.