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.

On permutor designs based on cycles for serially concatenated convolutional codes

På svenska

Author

  • A Huebner
  • DV Truhachev
  • Kamil Zigangirov

Summary, in English

A new permutor design for serially concatenated convolutional codes is presented. It is based on the construction of a permutation matrix without short cycles of special types. For such a permutor, we give a lower bound on the minimum distance of the overall code that is significantly larger than that achievable with first-order separation (spreading factors). Additionally, the minimum distance can be attuned to the permutation length. This property may be useful for the construction of codes with moderate block lengths.

Publishing year

2004

Language

English

Pages

1494-1503

Publication/Series

IEEE Transactions on Communications

Volume

52

Issue

9

Document type

Journal article

Publisher

IEEE - Institute of Electrical and Electronics Engineers Inc.

Topic

  • Electrical Engineering, Electronic Engineering, Information Engineering

Keywords

  • permutor design
  • serially concatenated convolutional codes (SCCCs)

Status

Published

ISBN/ISSN/Other

  • ISSN: 0090-6778