Trellis Complexity of Short Linear Codes

  • Authors:

  • I. E. Bocharova;R. Johannesson;B. D. Kudryashov

  • Affiliations:

  • Dept. of Inf. Syst., St.-Petersburg Univ. of Aerosp. Instrum., St. Petersburg;-;-

  • Venue:
  • IEEE Transactions on Information Theory
  • Year:
  • 2007

Quantified Score

Hi-index 754.84

Visualization

Abstract

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