Sciweavers

35 search results - page 1 / 7
» Uniformly bounded duplication codes
Sort
View
ITA
2007
118views Communications» more  ITA 2007»
13 years 4 months ago
Uniformly bounded duplication codes
Duplication is the replacement of a factor w within a word by ww. This operation can be used iteratively to generate languages starting from words or sets of words. By undoing dupl...
Peter Leupold, Victor Mitrana
DLT
2007
13 years 6 months ago
Duplication Roots
Recently the duplication closure of words and languages has received much interest. We investigate a reversal of it: the duplication root reduces a word to a square-free one. After...
Peter Leupold
TIT
2010
111views Education» more  TIT 2010»
12 years 11 months ago
Directly lower bounding the information capacity for channels with I.I.D.deletions and duplications
We directly lower bound the information capacity for channels with i.i.d. deletions and duplications. Our approach differs from previous work in that we focus on the information ca...
Adam Kirsch, Eleni Drinea
ETT
2000
106views Education» more  ETT 2000»
13 years 4 months ago
On Union Bounds for Random Serially Concatenated Turbo Codes with Maximum Likelihood Decoding
The input-output weight enumeration (distribution) function of the ensemble of serially concatenated turbo codes is derived, where the ensemble is generated by a uniform choice ov...
Igal Sason, Shlomo Shamai