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.

Asymptotic performance of woven graph codes

På svenska

Author

Summary, in English

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 satisying the Varshamov-Gilbert (VG) and the Costello lower bound on the minimum distance and the free distance, respectively.

Publishing year

2008

Language

English

Pages

1025-1029

Publication/Series

[Host publication title missing]

Document type

Conference paper

Topic

  • Electrical Engineering, Electronic Engineering, Information Engineering

Conference name

IEEE International Symposium on Information Theory, 2008

Conference date

2008-07-06 - 2008-07-11

Conference place

Toronto, Canada

Status

Published

Research group

  • Information Theory

ISBN/ISSN/Other

  • ISBN: 978-1-4244-2256-2