Meny

Du är här

Low state complexity block codes via convolutional codes

Publiceringsår: 2004
Språk: Engelska
Sidor: 2022-2030
Publikation/Tidskrift/Serie: IEEE TRANSACTIONS ON INFORMATION THEORY
Volym: 50
Nummer: 9
Dokumenttyp: Artikel
Förlag: IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC

Sammanfattning

A new class of block codes with low state complexity of their conventional trellis representations called double zero-tail terminated convolutional codes (DZT codes) is introduced. It is shown that there exist DZT-codes meeting the Varshamov-Gilbert bound on the minimum distance and having asymptotically optimal state complexity. Two ways of constructing DZT-codes are considered. Examples of DZT-codes meeting a lower bound on the state complexity are given.

Disputation

Nyckelord

  • Technology and Engineering
  • tailbiting (TB)
  • conventional trellis
  • block codes
  • double zero-tail terminated
  • minimal trellis
  • trellis
  • convolutional codes (DZT codes)

Ö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