Meny

Du är här

Tailbiting codes obtained via convolutional codes with large active distance-slopes

Publiceringsår: 2002
Språk: Engelska
Sidor: 2577-2587
Publikation/Tidskrift/Serie: IEEE TRANSACTIONS ON INFORMATION THEORY
Volym: 48
Nummer: 9
Dokumenttyp: Artikel
Förlag: IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC

Sammanfattning

The slope of the active distances is an important parameter when investigating the error-correcting capability of convolutional codes and the distance behavior of concatenated convolutional codes. The slope of the active distances is equal to the minimum average weight cycle in the state-transition diagram of the encoder. A general upper bound on the slope depending on the free distance of the convolutional code and new upper bounds on the slope of special classes of binary convolutional codes are derived. Moreover, a search technique, resulting in new tables of rate R = 1/2 and rate R = 1/3 convolutional encoders with high memories and large active distance-slopes is presented. Furthermore, we show that convolutional codes with large slopes can be used to obtain new tailbiting block codes with large minimum distances. Tables of rate R = 1/2 and rate R = 1/3 tailbiting codes with larger minimum distances than the best previously known quasi-cyclic codes are given. Two new tailbiting codes also have larger minimum distances than the best previously known binary linear block codes with same size and length. One of them is also superior in terms of minimum distance to any previously known binary nonlinear block code with the same set of parameters.

Disputation

Nyckelord

  • Technology and Engineering
  • convolutional codes
  • active distances
  • quasi-cyclic
  • minimum distance
  • tailbiting codes
  • codes

Övriga

Published
  • ISSN: 0018-9448

Box 117, 221 00 LUND
Telefon 046-222 00 00 (växel)
Telefax 046-222 47 20
lu [at] lu [dot] se

Fakturaadress: Box 188, 221 00 LUND
Organisationsnummer: 202100-3211
Om webbplatsen