4 vw V0 V1 nn N RN D parallel concatenation of balanced nregular bipartite V0V1m ENnm AnR0n BnR1n binary linear codes R R0R11 15 A decoding algorithm was suggested in our ID: 486038
Download Pdf The PPT/PDF document "Bipartite-graph codes" is the property of its rightful owner. Permission is granted to download and print the materials on this web site for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.
4 Bipartite-graph codes vw V0 V1 nn N, RN, D] = parallel concatenation of balanced, n-regular, bipartite |V0|=|V1|=m, |E|=N=nm A[n,R0n] B[n,R1n] binary linear codes R R0+R1-1 15 A decoding algorithm was suggested in our previous work: A.B., A. Mazumdar, and G. Zémor, (Adv. Math. Commun., ‘08 Here we consider the ensemble of codes ,m) defined by random regular (hyper)graphsand a local code A[n,R of errors correctable with We compute examples with local Hamming codes. We also estimate the proportion of correctable errors for large length of the local code A