From block to convolutional codes using block distances

Vladimir Sidorenko, Carlos Medina, Martin Bossert

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Citations (Scopus)

Abstract

It is well known that convolutional codes can be considered as block codes over a field of rational functions. Being a block code, every convolutional code has "block" distance dB. The free distance df of a convolutional code is lower bounded by dB, df ≥ dB With this approach, every method of designing or combining block codes immediately gives a method to design or to combine convolutional codes. The block distance dB of the new convolutional code is known (or can be estimated), this gives a lower bound for the free distance of the new convolutional code. We investigate the properties of block distance and show that block distance of blocked convolutional codes reaches free distance. The proposed method is demonstrated for Reed-Solomon codes, for the direct product codes and for bipartite graph codes. For these examples, bounds of type d f ≥ dB and improved bounds are obtained.

Original languageEnglish
Title of host publicationProceedings - 2007 IEEE International Symposium on Information Theory, ISIT 2007
Pages2331-2335
Number of pages5
DOIs
Publication statusPublished - 2007
Externally publishedYes
Event2007 IEEE International Symposium on Information Theory, ISIT 2007 - Nice, France
Duration: 24 Jun 200729 Jun 2007

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8101

Conference

Conference2007 IEEE International Symposium on Information Theory, ISIT 2007
Country/TerritoryFrance
CityNice
Period24/06/0729/06/07

Fingerprint

Dive into the research topics of 'From block to convolutional codes using block distances'. Together they form a unique fingerprint.

Cite this