Abstract: This paper presents a class of iteratively decodable cyclic codes. Codes in this class have large minimum distance; however, their Tanner graphs contain many short cycles of length 4. With ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback