Name
Abstract | ||
|---|---|---|
A linear code with a complementary dual (or an LCD code) is defined to be a linear code C whose dual code C ⊥ satisfies C∩C ⊥ = { 0 } . The algebraic characterization of LCD codes is given, and it is shown that asymptotically good LCD codes exist. LCD codes are shown to provide an optimum linear coding solution for the two-user binary adder channel. The nearest-neighbor (or maximum-likelihood) decoding problem for LCD codes is shown to reduce to the problem: given a word in C ⊥ , find the nearest codeword in C . |
Year | DOI | Venue |
|---|---|---|
1992 | 10.1016/0012-365X(92)90563-U | Discrete Mathematics |
Keywords | Field | DocType |
complementary dual,linear code,nearest neighbor,satisfiability | Discrete mathematics,Combinatorics,Concatenated error correction code,Parity-check matrix,Polynomial code,Block code,Cyclic code,Reed–Muller code,Linear code,Mathematics,Dual code | Journal |
Volume | ISSN | Citations |
106-107, | Discrete Mathematics | 80 |
PageRank | References | Authors |
6.59 | 1 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| James L. Massey | 1 | 1096 | 272.94 |