Lattice Paths: Coding and Complexity


Tamm U.

IEEE Information Theory and Applications Workshop, California, United States Of America, 8 - 13 February 2009, pp.352-355 identifier

  • Publication Type: Conference Paper / Full Text
  • City: California
  • Country: United States Of America
  • Page Numbers: pp.352-355

Abstract

We shall study several sequences of numbers arising in the array beta(n, k) = 3 . (n+k k) - 2 . (n+k k-1). Some of them relate to an old problem of Berlekamp, which arose in the construction of certain convolutional burst-error detecting codes. The other sequences are of recent interest in combinatorial theory.