Name
Abstract | ||
|---|---|---|
The theoretical aspects of the encoding process are investigated, resulting in a precise definition of linear codes together with theorems that clarify how they can be obtained. A particular subset of linear codes, called superlinear codes, for which the performance analysis is highly simplified is identified. The most relevant performance measures for the analysis of this class of codes are discussed. The minimum Euclidean distance and the event and bit error probabilities are found analytically using the uniform error property (when applicable) or variations on it. This yields accurate upper and lower bounds to the error rate at the price of reasonable computational complexity. The theory is then applied to the search for `good' codes and to their performance evaluation. The cases of 16- and 32-PSK codes, which are good candidates for use in digital satellite transmission, are considered. Several new results in terms of error event and bit error probabilities are presented, showing considerable gains in terms of SNR with respect to the uncoded case |
Year | DOI | Venue |
|---|---|---|
1988 | 10.1109/18.2631 | Information Theory, IEEE Transactions |
Keywords | DocType | Volume |
encoding,error statistics,modulation,phase shift keying,16-PSK codes,32-PSK codes,SNR,bit error probabilities,coding,digital satellite transmission,encoding,error event,error rate,linear codes,minimum Euclidean distance,modulation,superlinear codes | Journal | 34 |
Issue | ISSN | Citations |
2 | 0018-9448 | 30 |
PageRank | References | Authors |
17.62 | 8 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| S. Benedetto | 1 | 883 | 167.24 |
| Marsan, M.A. | 2 | 77 | 19.34 |
| Albertengo, G. | 3 | 32 | 18.30 |
| Giachin, E. | 4 | 30 | 17.62 |