کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
395836 666025 2008 10 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
A new approach to constructing CSS codes based on factor graphs
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر هوش مصنوعی
پیش نمایش صفحه اول مقاله
A new approach to constructing CSS codes based on factor graphs
چکیده انگلیسی

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 TR→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.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Information Sciences - Volume 178, Issue 7, 1 April 2008, Pages 1893–1902
نویسندگان
, , , ,