Loading...
Please wait, while we are loading the content...
Similar Documents
New multi-level codes over gf(q)
| Content Provider | NASA Technical Reports Server (NTRS) |
|---|---|
| Author | Costello Jr., Daniel J. Wu, Jiantian |
| Copyright Year | 1990 |
| Description | Set partitioning to multi-dimensional signal spaces over GF(q), particularly GF sup q-1(q) and GF sup q (q), and show how to construct both multi-level block codes and multi-level trellis codes over GF(q). Two classes of multi-level (n, k, d) block codes over GF(q) with block length n, number of information symbols k, and minimum distance d sub min greater than or = d, are presented. These two classes of codes use Reed-Solomon codes as component codes. They can be easily decoded as block length q-1 Reed-Solomon codes or block length q or q + 1 extended Reed-Solomon codes using multi-stage decoding. Many of these codes have larger distances than comparable q-ary block codes, as component codes. Low rate q-ary convolutional codes, work error correcting convolutional codes, and binary-to-q-ary convolutional codes can also be used to construct multi-level trellis codes over GF(q) or binary-to-q-ary trellis codes, some of which have better performance than the above block codes. All of the new codes have simple decoding algorithms based on hard decision multi-stage decoding. |
| File Size | 826443 |
| Page Count | 24 |
| File Format | |
| Alternate Webpage(s) | http://archive.org/details/NASA_NTRS_Archive_19900016278 |
| Archival Resource Key | ark:/13960/t83j8cf2t |
| Language | English |
| Publisher Date | 1990-07-01 |
| Access Restriction | Open |
| Subject Keyword | Computer Programming And Software Euclidean Geometry Algorithms Partitions Mathematics Symbols Signal Processing Decoding Error Correcting Codes Distance Ntrs Nasa Technical Reports Server (ntrs) Nasa Technical Reports Server Aerodynamics Aircraft Aerospace Engineering Aerospace Aeronautic Space Science |
| Content Type | Text |
| Resource Type | Technical Report |
