Avancerad sökning
Hittade 4 avhandlingar som matchar ovanstående sökkriterier.
1. On the Construction and Analysis of Iteratively Decodable Codes
Sammanfattning : Iterative decoding methods allow efficient decoding of long codes that are composed of smaller component codes. As a result reliable communication can be achieved with low decoding complexity even for rates close to Shannon capacity. This makes iteratively decodable codes a very attractive object of study in modern coding theory. LÄS MER
2. Source-channel coding for wireless networks
Sammanfattning : The aim of source coding is to represent information as accurately as possible using as few bits as possible and in order to do so redundancy from the source needs to be removed. The aim of channel coding is in some sense the contrary, namely to introduce redundancy that can be exploited to protect the information when being transmitted over a nonideal channel. LÄS MER
3. Source-Channel Coding in Networks
Sammanfattning : The aim of source coding is to represent information as accurately as possible using as few bits as possible and in order to do so redundancy from the source needs to be removed. The aim of channel coding is in some sense the contrary, namely to introduce redundancy that can be exploited to protect the information when being transmitted over a nonideal channel. LÄS MER
4. Human Forkhead Genes
Sammanfattning : The forkhead family constitutes a group of genes which encodes transcription factors that share a common DNA-binding domain, the forkhead domain. The first member to be discovered was the Drosophila melanogaster gene fork head. Members of this family have been found in a variety of species from bakers' yeast to man. LÄS MER