DocumentCode
3278325
Title
Determination of the shortest balanced cycles
Author
Tang, Yuansheng ; Huang, Xinmei ; Wang, Jinli ; Chen, Ming
Author_Institution
Coll. of Math. Sci., Yangzhou Univ., Yangzhou
fYear
2008
fDate
7-10 Dec. 2008
Firstpage
1
Lastpage
6
Abstract
For the construction of some quasi-cyclic low-density parity-check codes, it is desired to find all the shortest balanced cycles in a base matrix. In this paper, we give some necessary and sufficient conditions for the existence of balanced cycles. Furthermore, we show that any of the shortest balanced cycles in a base matrix consists of the points of a sub-matrix of some patterns which are completely determined.
Keywords
cyclic codes; matrix algebra; parity check codes; base matrix; quasi cyclic low-density parity-check code; shortest balanced cycle; Educational institutions; Encoding; Information theory; Parity check codes; Sufficient conditions;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory and Its Applications, 2008. ISITA 2008. International Symposium on
Conference_Location
Auckland
Print_ISBN
978-1-4244-2068-1
Electronic_ISBN
978-1-4244-2069-8
Type
conf
DOI
10.1109/ISITA.2008.4895416
Filename
4895416
Link To Document