2000 character limit reached
Free Distance Bounds for Protograph-Based Regular LDPC Convolutional Codes (0804.4466v1)
Published 28 Apr 2008 in cs.IT and math.IT
Abstract: In this paper asymptotic methods are used to form lower bounds on the free distance to constraint length ratio of several ensembles of regular, asymptotically good, protograph-based LDPC convolutional codes. In particular, we show that the free distance to constraint length ratio of the regular LDPC convolutional codes exceeds that of the minimum distance to block length ratio of the corresponding LDPC block codes.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.