Woven convolutional graph codes with large free distances
- 47 Downloads
Constructions of woven graph codes based on constituent convolutional codes are studied, and examples of woven convolutional graph codes are presented. Existence of codes satisfying the Costello lower bound on the free distance within a random ensemble of woven graph codes based on s-partite, s-uniform hypergraphs is shown, where s depends only on the code rate. Simulation results for Viterbi decoding of woven graph codes are presented and discussed.
KeywordsInformation Transmission Code Rate Block Code Parity Check Convolutional Code
Unable to display preview. Download preview PDF.
- 1.Bocharova, I.E., Kudryashov, B.D., Johannesson, R., and Zyablov, V.V., Asymptotically Good Woven Codes with Fixed Constituent Convolutional Codes, in Proc. 2007 IEEE Int. Sympos. on Information Theory (ISIT’2007), Nice, France, 2007, pp. 2326–2330.Google Scholar