On the Construction and Analysis of Iteratively Decodable Codes
Iterative decoding methods allow efficient decoding of long codes that are composed of smaller component codes. As a result reliable communication can be achieved with low decoding complexity even for rates close to Shannon capacity. This makes iteratively decodable codes a very attractive object of study in modern coding theory. This thesis focuses on different kinds of cycles which appear in th
