Meny

Javascript verkar inte påslaget? - Vissa delar av Lunds universitets webbplats fungerar inte optimalt utan javascript, kontrollera din webbläsares inställningar.
Du är här

A BEAST for prowling in trees

Publiceringsår: 2004
Språk: Engelska
Sidor: 1295-1302
Publikation/Tidskrift/Serie: IEEE Transactions on Information Theory
Volym: 50
Nummer: 6
Dokumenttyp: Artikel
Förlag: IEEE

Sammanfattning

When searching for convolutional codes and tailbiting codes of high complexity it is of vital importance to use fast algorithms for computing their weight spectra, which corresponds to finding low-weight paths in their code trellises. This can be efficiently done by a combined search in both forward and backward code trees. A bidirectional efficient algorithm for searching such code trees (BEAST) is presented. For large encoder memories, it is shown that BEAST is significantly more efficient than comparable algorithms. BEAST made it possible to rind new convolutional and tailbiting codes that have larger free (minimum) distances than the previously best known codes with the same parameters. Tables of such codes are presented.

Disputation

Nyckelord

  • Technology and Engineering
  • tailbiting codes
  • distance
  • convolutional codes
  • bidirectional search
  • free
  • distance spectrum

Övriga

Published
Yes
  • 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