Title :
Lattice paths: Coding and complexity
Author_Institution :
Dept. of Bus. Inf., Marmara Univ. Istanbul, Istanbul
Abstract :
We shall study several sequences of numbers arising in the array beta(n; k) = 3 middot (n+k/k) - 2 middot (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.
Keywords :
combinatorial mathematics; computational complexity; convolutional codes; error detection codes; coding; combinatorial theory; complexity; convolutional burst-error detecting codes; lattice paths; Combinatorial mathematics; Convolutional codes; Informatics; Lattices;
Conference_Titel :
Information Theory and Applications Workshop, 2009
Conference_Location :
San Diego, CA
Print_ISBN :
978-1-4244-3990-4
DOI :
10.1109/ITA.2009.5044969
