Webbläsaren som du använder stöds inte av denna webbplats. Alla versioner av Internet Explorer stöds inte längre, av oss eller Microsoft (läs mer här: * https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Var god och använd en modern webbläsare för att ta del av denna webbplats, som t.ex. nyaste versioner av Edge, Chrome, Firefox eller Safari osv.

On permutor designs based on cycles for serially concatenated convolutional codes

Författare

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

Publiceringsår

2004

Språk

Engelska

Sidor

1494-1503

Publikation/Tidskrift/Serie

IEEE Transactions on Communications

Volym

52

Issue

9

Dokumenttyp

Artikel i tidskrift

Förlag

IEEE - Institute of Electrical and Electronics Engineers Inc.

Ämne

  • Electrical Engineering, Electronic Engineering, Information Engineering

Nyckelord

  • permutor design
  • serially concatenated convolutional codes (SCCCs)

Status

Published

ISBN/ISSN/Övrigt

  • ISSN: 0090-6778