Sciweavers

2 search results - page 1 / 1
» Counting Lattice Paths by Narayana Polynomials
Sort
View
COMBINATORICS
2000
97views more  COMBINATORICS 2000»
13 years 4 months ago
Counting Lattice Paths by Narayana Polynomials
Let d(n) count the lattice paths from (0, 0) to (n, n) using the steps (0,1), (1,0), and (1,1). Let e(n) count the lattice paths from (0, 0) to (n, n) with permitted steps from th...
Robert A. Sulanke
TIT
2008
83views more  TIT 2008»
13 years 4 months ago
Constrained Codes as Networks of Relations
We address the well-known problem of determining the capacity of constrained coding systems. While the onedimensional case is well understood to the extent that there are technique...
Moshe Schwartz, Jehoshua Bruck