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

Low-density parity-check (LDPC) convolutional codes are capable of achievingexcellent performance with low encoding and decoding complexity. In this paperwe discuss several graph-cover-based methods for deriving families oftime-invariant and time-varying LDPC convolutional codes from LDPC block codesand show how earlier proposed LDPC convolutional code constructions can bepresented within this framework. Some of the constructed convolutional codessignificantly outperform the underlying LDPC block codes. We investigate somepossible reasons for this "convolutional gain," and we also discuss the ---mostly moderate --- decoder cost increase that is incurred by going from LDPCblock to LDPC convolutional codes.

Deriving Good LDPC Convolutional Codes from LDPC Block Codes