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 Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Families of "asymptotically regular" LDPC block code ensembles can be formedby terminating (J,K)-regular protograph-based LDPC convolutional codes. Byvarying the termination length, we obtain a large selection of LDPC block codeensembles with varying code rates and substantially better iterative decodingthresholds than those of (J,K)-regular LDPC block code ensembles, despite thefact that the terminated ensembles are almost regular. Also, by means of anasymptotic weight enumerator analysis, we show that minimum distance growslinearly with block length for all of the ensembles in these families, i.e.,the ensembles are asymptotically good. We find that, as the termination lengthincreases, families of "asymptotically regular" codes with capacity approachingiterative decoding thresholds and declining minimum distance growth rates areobtained, allowing a code designer to trade-off between distance growth rateand threshold. Further, we show that the thresholds and the distance growthrates can be improved by carefully choosing the component protographs used inthe code construction.

Asymptotically Regular LDPC Codes with Linear Distance Growth and Thresholds Close to Capacity