English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

In this paper, the girth distribution of the Tanner’s (3, 17)-regular quasi-cyclic LDPC (QC-LDPC) codes with code length <inline-formula> <tex-math notation="LaTeX">$17p$ </tex-math></inline-formula> is determined, where <inline-formula> <tex-math notation="LaTeX">$p$ </tex-math></inline-formula> is a prime and <inline-formula> <tex-math notation="LaTeX">$p \equiv 1~(\bmod ~51)$ </tex-math></inline-formula>. By analyzing their cycle structure, five equivalent types of cycles with length not more than 10 are obtained. The existence of these five types of cycles is transmitted into polynomial equations in a 51st unit root of the prime field <inline-formula> <tex-math notation="LaTeX">$\mathbb {F}_{p}$ </tex-math></inline-formula>. By using the Euclidean division algorithm to check the existence of solutions for such polynomial equations, the girth values of the Tanner’s (3, 17)-regular QC-LDPC codes are obtained.

Girth Analysis of Tanner’s (3, 17)-Regular QC-LDPC Codes Based on Euclidean Division Algorithm