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.

Low state complexity block codes via convolutional codes

På svenska

Author

Summary, in English

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.

Publishing year

2004

Language

English

Pages

2022-2030

Publication/Series

IEEE Transactions on Information Theory

Volume

50

Issue

9

Document type

Journal article

Publisher

IEEE - Institute of Electrical and Electronics Engineers Inc.

Topic

  • Electrical Engineering, Electronic Engineering, Information Engineering

Keywords

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

Status

Published

ISBN/ISSN/Other

  • ISSN: 0018-9448