Asymptotic performance of woven graph codes
Constructions of woven graph codes based on constituent block and convolutional codes are studied. It is shown that within the random ensemble of such codes based on s-partite, s-uniform hypergraphs, where s depends only on the code rate, there exist codes satisying the Varshamov-Gilbert (VG) and the Costello lower bound on the minimum distance and the free distance, respectively.
- Technology and Engineering
IEEE International Symposium on Information Theory
- Information Theory
"©2008 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE."
- ISBN: 978-1-4244-2256-2