56 search results - page 4 / 12 » Upper bounds on the rate of LDPC Codes |
COCO
2009
Springer
14 years 3 months ago
2009
Springer
Locally testable codes (LTCs) are error-correcting codes for which membership, in the code, of a given word can be tested by examining it in very few locations. Most known constru...
CORR
2006
Springer
13 years 8 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
13 years 8 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...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
—Distributed orthogonal space–time block codes (DOSTBCs) achieving full-diversity order and single-symbol maximum-likelihood (ML) decodability have been introduced recently by ...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Abstract--The L-user additive white Gaussian noise multiway relay channel is considered, where multiple users exchange information through a single relay at a common rate. Existing...