Asymptotic performance of woven graph codes

Irina Bocharova; Boris Kudryashov; Rolf Johannesson; Victor Zyablov

doi:10.1109/ISIT.2008.4595142

Asymptotic performance of woven graph codes

Irina Bocharova, Boris Kudryashov, Rolf Johannesson, Victor Zyablov

Department of Electrical and Information Technology

Research output: Chapter in Book/Report/Conference proceeding › Paper in conference proceeding › peer-review

Abstract

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.

Original language	English
Title of host publication	[Host publication title missing]
Pages	1025-1029
DOIs	https://doi.org/10.1109/ISIT.2008.4595142
Publication status	Published - 2008
Event	IEEE International Symposium on Information Theory, 2008 - Toronto, Toronto, Canada Duration: 2008 Jul 6 → 2008 Jul 11

Conference

Conference	IEEE International Symposium on Information Theory, 2008
Country/Territory	Canada
City	Toronto
Period	2008/07/06 → 2008/07/11

Subject classification (UKÄ)

Electrical Engineering, Electronic Engineering, Information Engineering

Access to Document

10.1109/ISIT.2008.4595142

Cite this

@inproceedings{6f00fd39980d448c91b07759640ab79a,

title = "Asymptotic performance of woven graph codes",

abstract = "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.",

author = "Irina Bocharova and Boris Kudryashov and Rolf Johannesson and Victor Zyablov",

year = "2008",

doi = "10.1109/ISIT.2008.4595142",

language = "English",

isbn = "978-1-4244-2256-2",

pages = "1025--1029",

booktitle = "[Host publication title missing]",

note = "IEEE International Symposium on Information Theory, 2008 ; Conference date: 06-07-2008 Through 11-07-2008",

}

TY - GEN

T1 - Asymptotic performance of woven graph codes

AU - Bocharova, Irina

AU - Kudryashov, Boris

AU - Johannesson, Rolf

AU - Zyablov, Victor

PY - 2008

Y1 - 2008

N2 - 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.

AB - 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.

U2 - 10.1109/ISIT.2008.4595142

DO - 10.1109/ISIT.2008.4595142

M3 - Paper in conference proceeding

SN - 978-1-4244-2256-2

SP - 1025

EP - 1029

BT - [Host publication title missing]

T2 - IEEE International Symposium on Information Theory, 2008

Y2 - 6 July 2008 through 11 July 2008

ER -

Asymptotic performance of woven graph codes

Abstract

Conference

Subject classification (UKÄ)

Access to Document

Fingerprint

Cite this