Presentation 2010-03-04
On the Size of Circulant Matrices for which Reversible Codes Exist
Tomoharu Shibuya, Keita Nakade,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Recently, Haley and Grant introduced the concept of reversible codes - a class of linear codes encodable by the iterative message-passing algorithm based on the Jacobi method over F_2. They also developed a concrete procedure to construct parity check matrices of reversible codes by utilizing some properties of circulant matrices which is described in terms of polynomials over F_2. In this paper, we investigate the size of circulant matrices considered in the Haley's procedure and clarify the necessary and sufficient condition on the size for which reversible codes based on circulant matrices exist. This condition tells us that no reversible codes based on circulant matrices exist other than those constructed by the Haley's procedure.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) encoding of linear codes / Jacobi method / reversible codes / circulant matrices / message-passing algorithm / LDPC codes
Paper # IT2009-94,ISEC2009-102,WBS2009-73
Date of Issue

Conference Information
Committee IT
Conference Date 2010/2/25(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Information Theory (IT)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) On the Size of Circulant Matrices for which Reversible Codes Exist
Sub Title (in English)
Keyword(1) encoding of linear codes
Keyword(2) Jacobi method
Keyword(3) reversible codes
Keyword(4) circulant matrices
Keyword(5) message-passing algorithm
Keyword(6) LDPC codes
1st Author's Name Tomoharu Shibuya
1st Author's Affiliation Department of Information and Communication Sciences, Sophia University()
2nd Author's Name Keita Nakade
2nd Author's Affiliation Department of Information and Communication Sciences, Sophia University
Date 2010-03-04
Paper # IT2009-94,ISEC2009-102,WBS2009-73
Volume (vol) vol.109
Number (no) 444
Page pp.pp.-
#Pages 5
Date of Issue