The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

Trellis complexity of short linear codes

På svenska

Author

Summary, in English

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

Publishing year

2007

Language

English

Pages

361-368

Publication/Series

IEEE Transactions on Information Theory

Volume

53

Issue

1

Document type

Journal article

Publisher

IEEE - Institute of Electrical and Electronics Engineers Inc.

Topic

  • Electrical Engineering, Electronic Engineering, Information Engineering

Keywords

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

Status

Published

ISBN/ISSN/Other

  • ISSN: 0018-9448