Computer Science – Information Theory
Scientific paper
2008-04-07
Computer Science
Information Theory
Submitted to IEEE Trans. Inform. Theory
Scientific paper
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 satisfying the Varshamov-Gilbert (VG) and the Costello lower bound on the minimum distance and the free distance, respectively. A connection between regular bipartite graphs and tailbiting codes is shown. Some examples of woven graph codes are presented. Among them an example of a rate $R_{\rm wg}=1/3$ woven graph code with $d_{\rm free}=32$ based on Heawood's bipartite graph and containing $n=7$ constituent rate $R^{c}=2/3$ convolutional codes with overall constraint lengths $\nu^{c}=5$ is given. An encoding procedure for woven graph codes with complexity proportional to the number of constituent codes and their overall constraint length $\nu^{c}$ is presented.
Bocharova Irina E.
Johannesson Rolf
Kudryashov Boris D.
Zyablov Victor V.
No associations
LandOfFree
Woven Graph Codes: Asymptotic Performances and Examples does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Woven Graph Codes: Asymptotic Performances and Examples, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Woven Graph Codes: Asymptotic Performances and Examples will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-729878