New approaches to reduced-complexity decoding
dc.contributor.author | Coffey, John T. | en_US |
dc.contributor.author | Goodman, Rodney M. | en_US |
dc.contributor.author | Farrell, Patrick G. | en_US |
dc.date.accessioned | 2006-04-10T14:31:05Z | |
dc.date.available | 2006-04-10T14:31:05Z | |
dc.date.issued | 1991-11-07 | en_US |
dc.identifier.citation | Coffey, John T., Goodman, Rodney M., Farrell, Patrick G. (1991/11/07)."New approaches to reduced-complexity decoding." Discrete Applied Mathematics 33(1-3): 43-60. <http://hdl.handle.net/2027.42/29034> | en_US |
dc.identifier.uri | http://www.sciencedirect.com/science/article/B6TYW-45JC83K-11/2/fd2594c8d4b90f6952a28860cc947596 | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/29034 | |
dc.description.abstract | We examine new approaches to the problem of decoding general linear codes under the strategies of full or bounded hard decoding and bounded soft decoding. The objective is to derive enhanced new algorithms that take advantage of the major features of existing algorithms to reduce decoding complexity. We derive a wide range of results on the complexity of many existing algorithms. We suggest a new algorithm for cyclic codes, and show how it exploits all the main features of the existing algorithms. Finally, we propose a new approach to the problem of bounded soft decoding, and show that its asymptotic complexity is significantly lower than that of any other currently known general algorithm. In addition, we give a characterization of the weight distribution of the average linear code and thus show that the Gilbert-Varshamov bound is tight for virtually all linear codes over any symbol field. | en_US |
dc.format.extent | 2208124 bytes | |
dc.format.extent | 3118 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | text/plain | |
dc.language.iso | en_US | |
dc.publisher | Elsevier | en_US |
dc.title | New approaches to reduced-complexity decoding | en_US |
dc.type | Article | en_US |
dc.rights.robots | IndexNoFollow | en_US |
dc.subject.hlbsecondlevel | Mathematics | en_US |
dc.subject.hlbtoplevel | Science | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | University of Michigan, Ann Arbor, MI 48109-2122, USA | en_US |
dc.contributor.affiliationother | California Institute of Technology, Pasadena, CA, USA | en_US |
dc.contributor.affiliationother | University of Manchester, Manchester, UK | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/29034/1/0000066.pdf | en_US |
dc.identifier.doi | http://dx.doi.org/10.1016/0166-218X(91)90107-8 | en_US |
dc.identifier.source | Discrete Applied Mathematics | en_US |
dc.owningcollname | Interdisciplinary and Peer-Reviewed |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.