Relation Between Parity-Check Matrixes and Cycles of Associated Tanner Graphs

descriptionPublicationkeyboard_double_arrow_right Article 01 Aug 2007Publisher:Institute of Electrical and Electronics Engineers (IEEE)Journal:IEEE Communications Letters, volume 11, pages 674-676 (issn: 1089-7798,

Copyright policy )

Authors: Ruwei Chen; Huawei Huang; Guozhen Xiao;

doi: 10.1109/lcomm.2007.07613

Relation Between Parity-Check Matrixes and Cycles of Associated Tanner Graphs

- Summary
- Metrics

Abstract

This correspondence presents an approach to the representation of cycles of Tanner graphs on associated parity-check matrices. Several equivalent conditions for the girth of a Tanner graph to be 2k are proposed. An algorithm to determine girth of associated Tanner graphs of parity-check matrices is proposed, also with an algorithm to count shortest cycles.

Related Organizations

Xidian University
China (People's Republic of)

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	6
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average