Loading...
Please wait, while we are loading the content...
Similar Documents
Trellis complexity bounds for decoding linear block codes
| Content Provider | NASA Technical Reports Server (NTRS) |
|---|---|
| Author | Kiely, A. B. Lin, W. Dolinar, S. McEliece, R. J. Ekroot, L. |
| Copyright Year | 1995 |
| Description | We consider the problem of finding a trellis for a linear block code that minimizes one or more measures of trellis complexity. The domain of optimization may be different permutations of the same code or different codes with the same parameters. Constraints on trellises, including relationships between the minimal trellis of a code and that of the dual code, are used to derive bounds on complexity. We define a partial ordering on trellises: If a trellis is optimum with respect to this partial ordering, if has the desirable property that it simultaneously minimizes all of the complexity measures examined. We examine properties of such optimal trellises and give examples of optimal permutations of codes, most notably the (48,24,12) quadratic residue code. |
| File Size | 677758 |
| Page Count | 14 |
| File Format | |
| Alternate Webpage(s) | http://archive.org/details/NASA_NTRS_Archive_19950025813 |
| Archival Resource Key | ark:/13960/t6sz1770n |
| Language | English |
| Publisher Date | 1995-05-15 |
| Access Restriction | Open |
| Subject Keyword | Communications And Radar Linear Programming Permutations Decoding Trellis Coding Ntrs Nasa Technical Reports Server (ntrs) Nasa Technical Reports Server Aerodynamics Aircraft Aerospace Engineering Aerospace Aeronautic Space Science |
| Content Type | Text |
| Resource Type | Article |
