148 search results - page 10 / 30 » tit 2010 |
TIT
2010
13 years 4 months ago
2010
Abstract--In 1986, Don Knuth published a very simple algorithm for constructing sets of bipolar codewords with equal numbers of "1"s and "01"s, called balanced ...
TIT
2010
13 years 4 months ago
2010
We determine that exponential Welch permutations lead in general to the smallest maximal frequency hops among all Costas permutations, and are also relatively easy to study, as a ...
TIT
2010
13 years 4 months ago
2010
Abstract--An iterative decoding threshold analysis for terminated regular LDPC convolutional (LDPCC) codes is presented. Using density evolution techniques, the convergence behavio...
TIT
2010
13 years 4 months ago
2010
The theory of Markov set-chains is applied to derive upper and lower bounds on the capacity of finite-state channels that are tighter than the classic bounds by Gallager. The new ...
TIT
2010
13 years 4 months ago
2010
The utility of limited feedback for coding over an individual sequence of DMCs is investigated. This study complements recent results showing how limited or noisy feedback can boos...