Title :
Counting sequences obtained from the synchronization channel
Author :
Sala, Frederic ; Dolecek, Lara
Author_Institution :
Dept. of Electr. Eng., Univ. of California, Los Angeles, Los Angeles, CA, USA
Abstract :
Synchronization channels, which can remove codeword symbols or introduce extraneous symbols, pose additional difficulties when compared to the commonly-studied substitution channel. A traditional problem in this area is to count the number of sequences formed when deleting a fixed number of symbols from a sequence. This work contains our first effort towards solving a similar, yet previously unexplored, problem: deriving bounds on the number of sequences obtained by deleting and inserting a fixed number of symbols.
Keywords :
channel coding; codeword symbols removal; counting sequences; synchronization channel; Approximation methods; Educational institutions; Electrical engineering; Error correction codes; Synchronization; Upper bound;
Conference_Titel :
Information Theory Proceedings (ISIT), 2013 IEEE International Symposium on
Conference_Location :
Istanbul
DOI :
10.1109/ISIT.2013.6620761
