Javascript is not activated in your browser. This website needs javascript activated to work properly.
Du är här

Trellis complexity of short linear codes

Publiceringsår: 2007
Språk: Engelska
Sidor: 361-368
Publikation/Tidskrift/Serie: IEEE Transactions on Information Theory
Volym: 53
Nummer: 1
Dokumenttyp: Artikel
Förlag: IEEE


An extended table of Shuurman's bounds on the state complexity of short binary linear codes is presented. Some new lower and upper bounds are obtained. Most of the newly found codes are based on the so-called double zero-tail termination (DZT) construction



  • Technology and Engineering
  • short binary linear codes
  • double zero-tail termination
  • linear codes
  • binary codes
  • trellis codes
  • DZT
  • Shuurman's bound
  • trellis complexity


  • 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