Name
Abstract | ||
|---|---|---|
In this paper, we propose nontrivial codes that achieve a non-zero zero-error rate for several odd-letter noisy-typewriter channels. Some of these codes (specifically, those which are defined for a number of letters of the channel of the form 2(n) + 1) achieve the best-known lower bound on the zero-error capacity. We build the codes using linear codes over rings, as we do not require the multiplicative inverse to build the codes. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1109/ITW.2011.6089510 | 2011 IEEE INFORMATION THEORY WORKSHOP (ITW) |
Keywords | Field | DocType |
upper bound,linear code,channel capacity,lower bound,error rate,vectors,channel coding,noise measurement | Discrete mathematics,Hamming code,Concatenated error correction code,Computer science,Low-density parity-check code,Turbo code,Block code,Serial concatenated convolutional codes,Expander code,Theoretical computer science,Linear code | Conference |
Citations | PageRank | References |
1 | 0.37 | 2 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Francisco J. R. Ruiz | 1 | 7 | 2.18 |
| Fernando Pérez-Cruz | 2 | 749 | 61.24 |