54 search results - page 4 / 11 » Upper Bound on List-Decoding Radius of Binary Codes |
COMBINATORICS
2002
13 years 7 months ago
2002
Let G = (V, E) be a connected undirected graph and S a subset of vertices. If for all vertices v V , the sets Br(v) S are all nonempty and different, where Br(v) denotes the set...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
-- The performance of maximum-likelihood (ML) decoded binary linear block codes is addressed via the derivation of tightened upper bounds on their decoding error probability. The u...
DCC
2001
IEEE
14 years 7 months ago
2001
IEEE
The multicovering radii of a code are recent generalizations of the covering radius of a code. For positive m, the m-covering radius of C is the least radius t such that every m-tu...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
Assuming iterative decoding for binary erasure channels (BECs), a novel tree-based technique for upper bounding the bit error rates (BERs) of arbitrary, finite low-density parity-c...
TIT
2002
13 years 7 months ago
2002
Let ( ) denote the maximum possible number of codewords in a binary code of length and minimum Hamming distance . For large values of , the best known upper bound, for fixed , is t...