On Complexity and Efficiency in Encoding and Decoding Error-correcting Codes
<p>A central paradox of coding theory has been noted for many years, and concerns the existence and construction of the best codes. Virtually every linear code is "good" in the sense that it meets the Gilbert-Varshamov bound on distance versus redundancy. Despite the sophisticated co...
Main Author: | |
---|---|
Format: | Others |
Language: | en |
Published: |
1989
|
Online Access: | https://thesis.library.caltech.edu/2541/3/coffey_jt_1989.pdf Coffey, John Timothy (1989) On Complexity and Efficiency in Encoding and Decoding Error-correcting Codes. Dissertation (Ph.D.), California Institute of Technology. doi:10.7907/4jy2-w055. https://resolver.caltech.edu/CaltechETD:etd-06102005-114154 <https://resolver.caltech.edu/CaltechETD:etd-06102005-114154> |
Internet
https://thesis.library.caltech.edu/2541/3/coffey_jt_1989.pdfCoffey, John Timothy (1989) On Complexity and Efficiency in Encoding and Decoding Error-correcting Codes. Dissertation (Ph.D.), California Institute of Technology. doi:10.7907/4jy2-w055. https://resolver.caltech.edu/CaltechETD:etd-06102005-114154 <https://resolver.caltech.edu/CaltechETD:etd-06102005-114154>