By Topic

Woven Graph Codes: Asymptotic Performances and Examples

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Bocharova, I.E. ; Dept. of Inf. Syst., St. Petersburg Univ. of Inf. Technol., St. Petersburg, Russia ; Johannesson, R. ; Kudryashov, B.D. ; Zyablov, V.V.

Constructions of woven graph codes based on constituent block and convolutional codes are studied. It is shown that within the random ensembles of such codes based on s-partite, s-uniform hypergraphs, where s depends only on the code rate, there exist codes satisfying the Gilbert-Varshamov (GV) and the Costello lower bound on the minimum distance and the free distance, respectively. A connection between regular bipartite graphs and tailbiting (TB) codes is shown. Some examples of woven graph codes are presented. Among them, an example of a rate Rwg=1/3 woven graph code with dfree=32 based on Heawood's bipartite graph, containing n=7 constituent rate Rc=2/3 convolutional codes with overall constraint lengths ¿c =5, is given.

Published in:

Information Theory, IEEE Transactions on  (Volume:56 ,  Issue: 1 )