RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PERSONAL OFFICE
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Probl. Peredachi Inf.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Probl. Peredachi Inf., 2011, Volume 47, Issue 1, Pages 3–18 (Mi ppi2033)  

Coding Theory

Woven convolutional graph codes with large free distances

I. E. Bocharovaa, F. Hugb, R. Johannessonb, B. D. Kudryashova

a St. Petersburg State University of Information Technologies, Mechanics and Optics (ITMO)
b Lund University, Sweden

Abstract: 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.

Full text: PDF file (336 kB)
References: PDF file   HTML file

English version:
Problems of Information Transmission, 2011, 47:1, 1–14

Bibliographic databases:

Document Type: Article
UDC: 621.391.15+519.2
Received: 05.05.2010
Revised: 19.10.2010

Citation: I. E. Bocharova, F. Hug, R. Johannesson, B. D. Kudryashov, “Woven convolutional graph codes with large free distances”, Probl. Peredachi Inf., 47:1 (2011), 3–18; Problems Inform. Transmission, 47:1 (2011), 1–14

Citation in format AMSBIB
\Bibitem{BocHugJoh11}
\by I.~E.~Bocharova, F.~Hug, R.~Johannesson, B.~D.~Kudryashov
\paper Woven convolutional graph codes with large free distances
\jour Probl. Peredachi Inf.
\yr 2011
\vol 47
\issue 1
\pages 3--18
\mathnet{http://mi.mathnet.ru/ppi2033}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=2815316}
\transl
\jour Problems Inform. Transmission
\yr 2011
\vol 47
\issue 1
\pages 1--14
\crossref{https://doi.org/10.1134/S0032946011010017}
\isi{http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&DestLinkType=FullRecord&DestApp=ALL_WOS&KeyUT=000289689300001}
\scopus{http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-80051616915}


Linking options:
  • http://mi.mathnet.ru/eng/ppi2033
  • http://mi.mathnet.ru/eng/ppi/v47/i1/p3

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles
  • Проблемы передачи информации Problems of Information Transmission
    Number of views:
    This page:259
    Full text:60
    References:17
    First page:15

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2019