Spelling suggestions: "subject:"foding 1heory."" "subject:"foding atheory.""
81 |
Adaptive digital transceiver for rayleigh fading channels /Hughes, Jeffery R. January 1900 (has links)
Thesis (M.S.)--Oregon State University, 2004. / Typescript (photocopy). Includes bibliographical references (leaves 43-44). Also available on the World Wide Web.
|
82 |
Intersection problem for the class of quaternary Reed-Muller codesDelgado Ortiz, Abel Ahbid Ahmed. Phelps, Kevin Thomas, January 2009 (has links)
Thesis (Ph. D.)--Auburn University, 2009. / Abstract. Includes bibliographical references (p. 51-52).
|
83 |
Hardware design of scalable and unified modular division and Montgomery multiplication /Park, Song Jun. January 1900 (has links)
Thesis (M.S.)--Oregon State University, 2006. / Printout. Includes bibliographical references (leaves 43-44). Also available on the World Wide Web.
|
84 |
Optimal encoding of continuous-amplitude memoryless sources with constrained size output alphabetFinamore, Weiler Alves. January 1978 (has links)
Thesis--Wisconsin. / Vita. Includes bibliographical references (leaves 177-178).
|
85 |
Improving turbo codes through code design and hybrid ARQKim, Han Jo. January 2005 (has links)
Thesis (Ph. D.)--University of Florida, 2005. / Title from title page of source document. Document formatted into pages; contains 85 pages. Includes vita. Includes bibliographical references.
|
86 |
Signal detection in unknown interference channels /Li, Tao. January 2006 (has links)
Thesis (Ph.D.)--Hong Kong University of Science and Technology, 2006. / Includes bibliographical references (leaves 124-133). Also available in electronic version.
|
87 |
Network coding in relay networks /Alban, Eduardo. January 1900 (has links)
Thesis (M.S.)--Oregon State University, 2008. / Printout. Includes bibliographical references (leaves 67-71). Also available on the World Wide Web.
|
88 |
New contributions to source and channel codingVan der Walt, Werner 12 September 2012 (has links)
D.Ing. / Due to continuous research there is a large variety of new source and channel coding technologies which are constantly being introduced and refined. This study presents a new approach that enables one to use enumerative source coding on variable length codewords. The technique introduced are shown to provide an effective and fast decoder. The encoding process depends on the code used and its qualities. This new technique is illustrated by applying it to Huffman source coding. As a result, an efficient and fast Huffman decoder was constructed. The new decoder also resulted in small codebook representations. An efficient source coding mechanism, must be complemented by a channel and error correction coding mechanism which is just as efficient to ensure an optimal communication channel. We conclude this study by investigating channel and constrained coding. We know that the implementation of error correction and detection codes, like Reed-Solomon codes, are resource intensive with longer codewords. This problem is circumvented by the introduction of an alternative channel architecture. In this new architecture, a channel code is applied to the source data before an error correction code is applied to the channel data. For long codewords in the channel code, this new approach is shown to be equal or superior to block and sliding window codes. This new approach is block based, but unlike block codes, usable in most types of channels.
|
89 |
Coding theorems for systems of channels /Gemma, James Leo January 1970 (has links)
No description available.
|
90 |
Two mathematical security aspects of the RSA cryptosystem : signature padding schemes and key generation with a backdoorArboit, Geneviève January 2008 (has links)
No description available.
|
Page generated in 0.0421 seconds