62 search results - page 5 / 13 » Improved Upper Bound for the Redundancy of Fix-Free Codes |
CORR
2006
Springer
14 years 9 months ago
2006
Springer
This paper is focused on the performance analysis of binary linear block codes (or ensembles) whose transmission takes place over independent and memoryless parallel channels. New ...
CORR
2006
Springer
14 years 9 months ago
2006
Springer
Abstract--We address the maximum attainable rate of fingerprinting codes under the marking assumption, studying lower and upper bounds on the value of the rate for various sizes of...
CORR
2004
Springer
14 years 9 months ago
2004
Springer
We address the problem of bounding below the probability of error under maximum-likelihood decoding of a binary code with a known distance distribution used on a binarysymmetric ch...
85
Voted
JSAC
1998
14 years 9 months ago
1998
—The performance and design of turbo codes using coherent BPSK signaling on the Rayleigh fading channel is considered. In low signal-to-noise regions, performance analysis uses s...
SAC
2002
ACM
14 years 9 months ago
2002
ACM
Iterative solvers such as the Jacobi and Gauss-Seidel relaxation methods are important, but time-consuming building blocks of many scientific and engineering applications. The per...