Braided block codes

  • Authors:
  • Alberto Jiménez Feltström;Dmitri Truhachev;Michael Lentmaier;Kamil Sh. Zigangirov

  • Affiliations:
  • Department of System Architecture, DS2, Parc Tecnologic, Paterna, Valencia, Spain;Department of Electrical and Computer Engineering, University of Alberta, Edmonton, AB, Canada;Vodafone Chair Mobile Communications Systems, Dresden University of Technology, Dresden, Germany;Department of Electrical Engineering, University of Notre Dame, Notre Dame, IN and Institute for Problems of Information Transmission, Moscow, Russia

  • Venue:
  • IEEE Transactions on Information Theory
  • Year:
  • 2009

Quantified Score

Hi-index 754.90

Visualization

Abstract

A new class of binary iteratively decodable codes with good decoding performance is presented. These codes, called braided block codes (BBCs), operate on continuous data streams and are constructed by interconnection of two component block codes. BBCs can be considered as convolutional (or sliding) version of either Elias' product codes or expander codes. In this paper, we define BBCs, describe methods of their construction, analyze code properties, and study asymptotic iterative decoding performance.