The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

Woven convolutional graph codes with large free distances

På svenska

Author

Summary, in English

Constructions of woven graph codes based on constituent convolutional codes are studied and examples of woven convolutional graph codes are presented. The existence of codes, satisfying the Costello lower bound on the free distance, within the random ensemble of woven graph codes based on s-partite, s-uniform hypergraphs, where s depends only on the code rate, is shown. Simulation results for Viterbi decoding of woven graph codes are presented and discussed.

Publishing year

2011

Language

English

Pages

1-14

Publication/Series

Problems of Information Transmission

Volume

47

Issue

1

Document type

Journal article

Publisher

Springer

Topic

  • Electrical Engineering, Electronic Engineering, Information Engineering

Keywords

  • LDPC codes
  • hypergraphs
  • graph codes
  • graphs
  • Convolutional codes
  • girth
  • tailbiting codes
  • woven codes

Status

Published

Research group

  • Information Theory

ISBN/ISSN/Other

  • ISSN: 0032-9460