A new approach to constructing CSS codes based on factor graphs

  • Authors:

  • Wang Huisong;Wang Jun;Du Qun;Zeng Guihua

  • Affiliations:

  • The State Key Laboratory on Fiber-Optic Local Area Networks and Advanced Optical Communication Systems, Department of Electronic Engineering, Shanghai Jiaotong University, Shanghai 200030, China;Central-South Architectural Design Institute, Wuhan 430071, People's Republic of China;Central-South Architectural Design Institute, Wuhan 430071, People's Republic of China;The State Key Laboratory on Fiber-Optic Local Area Networks and Advanced Optical Communication Systems, Department of Electronic Engineering, Shanghai Jiaotong University, Shanghai 200030, China

  • Venue:
  • Information Sciences: an International Journal
  • Year:
  • 2008

Quantified Score

Hi-index 0.07

Visualization

Abstract

A novel, practical and convenient approach to constructing Calderbank-Shor-Steane (CSS) codes based on factor graphs is presented in this paper. Our proposed method is applied to solve two problems associated with constructing CCS codes. One is judging whether a code is a weakly self-dual code or not, the other is finding the generator matrix and parity-check matrix of a weakly self-dual code. The novelty, practicality and convenience of the approach are shown as follows. First, the approach is a hitherto unexplored one to constructing CSS codes. Second, the judgment of a weakly self-dual code is entirely based on factor graphs. Namely, we consider a code a weakly self-dual one when the Tanner graph or convolutional factor graph of its dual code can be obtained by that of its own via our proposed transform T"R"-"L. Finally, we can obtain the generator matrix and parity-check matrix of a weakly self-dual code via factor graphs other than conventional algebra methods, which allow us avoid matrix computation to get them. An example is given to show how to construct quantum CSS code based on factor graphs. The method can be extended to other CSS codes.