Woven Graph Codes over Hyper Graphs

Conference: SCC'08 - 7th International ITG Conference on Source and Channel Coding
01/14/2008 - 01/16/2008 at Ulm, Germany

Proceedings: SCC'08

Pages: 5Language: englishTyp: PDF

Personal VDE Members are entitled to a 10% discount on this title

Bocharova, Irina E.; Kudryashov, Boris D. (Dept. of Information Systems, Univ. of Aerospace Instrum, St.-Petersburg, Russia)
Johannesson, Rolf (Dept. of Electro and Information Technology, Lund University, Sweden)
Zyablov, Victor V. (Inst. for Information Transm. Problems, Russian Academy of Sciences, Moscow, Russia)

Constructions of woven graph codes based on constituent block and convolutional codes are studied. The constructions are based on s-partite s-uniform hypergraphs, where s depends only on the code rate. Product-type lower bounds on the minimum and free distances for woven graph codes with block and convolutional constituent codes, respectively, are given. Examples of woven hypergraph codes with large free distances are presented.