subject:(coding)

Università della Svizzera italiana

1. Rapanta, Chrysi. Communication processes in eLearning design and development: an interaction analysis approach.

Degree: 2011, Università della Svizzera italiana

► The present dissertation has as a main goal to identify and describe relevant design and communication processes taking place during co-design meetings, in a way… (more)

▼ The present dissertation has as a main goal to identify and describe relevant design and communication processes taking place during co-design meetings, in a way suitable to inform practice in similar settings in the field of eLearning design and development. The need for such a research emerges from the inadequacy of prescriptive models that can guide professionals in their communication during the design of on-line courses. This inadequacy has been evident also in other design fields, thus a tendency towards empirical team design research has been recently established. In the margins of this research tendency, several different methods of analyzing how a team actually interacts during design have been hitherto proposed. Our research applies an Interaction analysis approach, akin to take into consideration various aspects of both the design and communication processes taking place in parallel during a professional co-design meeting. Such an approach allows for the study of the team’s double focus during task-oriented interaction: the realization of the task on which interaction focuses on, and the task of communicating about it. Thus, on the basis of viewing team design activity mainly as a socio-cognitive interaction activity, a method of corpus construction and analysis is proposed, namely DROMEAS. DROMEAS takes its name from the coding dimensions to which it refers, namely: Design activity, Representational act, Object, Meta-epistemic reference, Dialogue act, and dialogue sequence. The selection of these dimensions over others is based on the theoretical constructs this dissertation addresses, which are: design co-construction, dialogicality, deliberativeness, intermediary representations, design-related arguments, and user experience. Applying DROMEAS to an extended dataset (7625 interaction units) derived from 15 co-design meetings of two teams – as representative of high reputation European Distance Universities – has led to several insights and observations regarding both the team design practice in the field of eLearning, and the adequacy of DROMEAS as a method to gain such insights. As far as the former is concerned, our results refer to the structure of design and communication processes, in terms of activities, acts, and objects involved, the content “put on the table”, the arguments produced, and the task-related emerging roles. Regarding the latter, methodological considerations such as the adequacy of dialogue acts, instead of speech acts, to describe interaction, the argumentation schemes emerged, and the merging of semantic-cognitive and dialogical aspects regarding communication acts are discussed. As a conclusion, it is found that the design and the communication processes are mutually dependent, and both depend of the team goal appearing as predominant at each instance of interaction. The selection of an Interaction analysis approach has been proven adequate to richly describe team interaction at various levels and through different focuses. Finally, the identification of argumentation schemes in… Advisors/Committee Members: Lorenzo (Dir.).

Subjects/Keywords: coding

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Rapanta, C. (2011). Communication processes in eLearning design and development: an interaction analysis approach. (Thesis). Università della Svizzera italiana. Retrieved from http://doc.rero.ch/record/25001

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Rapanta, Chrysi. “Communication processes in eLearning design and development: an interaction analysis approach.” 2011. Thesis, Università della Svizzera italiana. Accessed January 18, 2021. http://doc.rero.ch/record/25001.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Rapanta, Chrysi. “Communication processes in eLearning design and development: an interaction analysis approach.” 2011. Web. 18 Jan 2021.

Vancouver:

Rapanta C. Communication processes in eLearning design and development: an interaction analysis approach. [Internet] [Thesis]. Università della Svizzera italiana; 2011. [cited 2021 Jan 18]. Available from: http://doc.rero.ch/record/25001.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Rapanta C. Communication processes in eLearning design and development: an interaction analysis approach. [Thesis]. Università della Svizzera italiana; 2011. Available from: http://doc.rero.ch/record/25001

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

McMaster University

2. Chen, Ying. Video Compression via Predictable Coding over Virtual Frames.

Degree: MASc, 2020, McMaster University

URL: http://hdl.handle.net/11375/25400

►

Video applications have become more and more common in the past few decades, in the meantime, optimizing video coding has received more attention. Existing video… (more)

Subjects/Keywords: video coding

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Chen, Y. (2020). Video Compression via Predictable Coding over Virtual Frames. (Masters Thesis). McMaster University. Retrieved from http://hdl.handle.net/11375/25400

Chicago Manual of Style (16^th Edition):

Chen, Ying. “Video Compression via Predictable Coding over Virtual Frames.” 2020. Masters Thesis, McMaster University. Accessed January 18, 2021. http://hdl.handle.net/11375/25400.

MLA Handbook (7^th Edition):

Chen, Ying. “Video Compression via Predictable Coding over Virtual Frames.” 2020. Web. 18 Jan 2021.

Vancouver:

Chen Y. Video Compression via Predictable Coding over Virtual Frames. [Internet] [Masters thesis]. McMaster University; 2020. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/11375/25400.

Council of Science Editors:

Chen Y. Video Compression via Predictable Coding over Virtual Frames. [Masters Thesis]. McMaster University; 2020. Available from: http://hdl.handle.net/11375/25400

Queens University

3. Li, Ye. Efficient Network Coding for Different Network Topologies .

Degree: Electrical and Computer Engineering, 2014, Queens University

URL: http://hdl.handle.net/1974/12602

► Network coding is known to be able to improve a network's throughput and resilience to packet losses. However, in practice high decoding complexity has been… (more)

▼ Network coding is known to be able to improve a network's throughput and resilience to packet losses. However, in practice high decoding complexity has been a major obstacle that prevents network coding from being widely employed. This thesis considers efficient network coding methods that have low complexity for different types of scenarios. Simple network topologies are first considered. We propose a systematic network coding approach for networks that consist of one or two two-hop lossy paths. It is proved that, compared to the random linear network coding approach, the proposed scheme requires much less computation in encoding and decoding and also achieves a higher end-to-end rate. It is demonstrated that a judicious use of uncoded packets in these networks may provide considerable gain over random coding. For networks with complex or changing topologies, we investigate the generation-based strategy to design network codes, in which source packets are grouped into subsets called generations and coding is only performed among packets belonging to the same generation. We design generation-based network codes for two different decoders that may be used in different scenarios to meet specific performance/complexity constraints. The first approach, which is generation-by-generation decoding, decodes within generations and therefore its complexity can be made linear by properly choosing the generation size. We analyze the decoding process and propose 1) a method to estimate the optimal amount of overlap among generations, which is a key parameter of generation-based network codes and 2) a new code based on unequal-size generations. The proposed code is shown to outperform existing codes in terms of both computational cost and reception overhead. The second approach considers overhead-optimized decoding, which decodes generations jointly and has lower overhead than the generation-by-generation decoder but requires more computation. We provide an overhead-optimized decoder design with low computational cost and then design codes that are sparser than existing codes. The proposed code is shown to have lower overhead and decoding cost.

Subjects/Keywords: Network Coding

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Li, Y. (2014). Efficient Network Coding for Different Network Topologies . (Thesis). Queens University. Retrieved from http://hdl.handle.net/1974/12602

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Li, Ye. “Efficient Network Coding for Different Network Topologies .” 2014. Thesis, Queens University. Accessed January 18, 2021. http://hdl.handle.net/1974/12602.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Li, Ye. “Efficient Network Coding for Different Network Topologies .” 2014. Web. 18 Jan 2021.

Vancouver:

Li Y. Efficient Network Coding for Different Network Topologies . [Internet] [Thesis]. Queens University; 2014. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/1974/12602.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Li Y. Efficient Network Coding for Different Network Topologies . [Thesis]. Queens University; 2014. Available from: http://hdl.handle.net/1974/12602

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

4. Rao, Naveen G. Cortical dynamics of movement planning, execution, and sensory integration in parietal-motor networks.

Degree: PhD, Neuroscience, 2012, Brown University

URL: https://repository.library.brown.edu/studio/item/bdr:297696/

► In this thesis, we explored mechanisms for how the brain transforms incoming sensory information into meaningful motor output. The motor cortex is known as the… (more)

▼ In this thesis, we explored mechanisms for how the brain transforms incoming sensory information into meaningful motor output. The motor cortex is known as the area of the cortex most closely associated with movement. In our first result, we showed MI is more heavily involved in this sensory-to-motor transformation than previously thought. We showed that MI cells have, not only movement-related activity, but also responses to visual cues that are meaningful in the context of current or upcoming movements. Past studies have indicated that MI is likely not involved in spatial processing, so we surmise that local ensembles of MI neurons are capable of associating certain sensory inputs with motor plans when the sensory information does not require spatial processing to be relevant to motor output. Next, we showed that area 2/5 neurons on the surface of the postcentral gyrus tend not to respond to visual cues and tend to become active after movement has commenced. Thus, they are unlikely to be involved in the sensorimotor transformation in our task. We showed that both area 2/5 and MI have robust responses to physical perturbation of the arm, indicating both areas receive proprioceptive information. These responses have a similar latency in both areas, suggesting a parallel computation is occurring in each area. However, area 2/5 responses to perturbation incorporate both the ongoing movement direction as well as the direction of perturbation, while MI responses are related only to perturbation direction. Finally, we presented evidence that the goal information in area 2/5 came from early MI activity before movements, but does not result in spiking in area 2/5. Rather, we believe this goal information from MI influences the area 2/5 network to contextually process incoming sensory information. Taken together, these results suggest that area 2/5 processes sensory information in the context of this early motor plan. This interaction allows spatial corroboration of the effector limb to goal and possibly spatial motor error calculation. Advisors/Committee Members: Donoghue, John (Director), Sheinberg, David (Reader), Frank, Michael (Reader), Kalasha, John (Reader).

Subjects/Keywords: neural coding

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Rao, N. G. (2012). Cortical dynamics of movement planning, execution, and sensory integration in parietal-motor networks. (Doctoral Dissertation). Brown University. Retrieved from https://repository.library.brown.edu/studio/item/bdr:297696/

Chicago Manual of Style (16^th Edition):

Rao, Naveen G. “Cortical dynamics of movement planning, execution, and sensory integration in parietal-motor networks.” 2012. Doctoral Dissertation, Brown University. Accessed January 18, 2021. https://repository.library.brown.edu/studio/item/bdr:297696/.

MLA Handbook (7^th Edition):

Rao, Naveen G. “Cortical dynamics of movement planning, execution, and sensory integration in parietal-motor networks.” 2012. Web. 18 Jan 2021.

Vancouver:

Rao NG. Cortical dynamics of movement planning, execution, and sensory integration in parietal-motor networks. [Internet] [Doctoral dissertation]. Brown University; 2012. [cited 2021 Jan 18]. Available from: https://repository.library.brown.edu/studio/item/bdr:297696/.

Council of Science Editors:

Rao NG. Cortical dynamics of movement planning, execution, and sensory integration in parietal-motor networks. [Doctoral Dissertation]. Brown University; 2012. Available from: https://repository.library.brown.edu/studio/item/bdr:297696/

5. Bondy, Adrian G. Decision-Related Feedback Influences the Structure of Correlated Variability in Visual Cortex.

Degree: PhD, Neuroscience, 2015, Brown University

URL: https://repository.library.brown.edu/studio/item/bdr:674087/

► Sensory neurons exhibit unpredictable spiking responses to fixed sensory input. Some of this response variability is correlated between neuronal pairs. This correlated variability (spike-count correlation;… (more)

▼ Sensory neurons exhibit unpredictable spiking responses to fixed sensory input. Some of this response variability is correlated between neuronal pairs. This correlated variability (spike-count correlation; rsc) is thought to impair judgments about the stimulus, because these rely on statistical decisions based on pooling many sensory neurons. However, a portion of the correlated variability may in fact reflect variability in modulatory/feedback inputs. How such common inputs impact the neuronal representation of sensory events is poorly understood. An important experimental constraint can be provided by quantifying the portion of rsc that derives from feedback. We confine our analysis to the structured rsc thought to be important for perceptual judgments. In this dissertation, I present results from population recordings in macaque primary visual cortex (V1) while subjects perform a coarse orientation discrimination task using filtered noise stimuli. Given current models, the presence of choice-related activity (Choice Probability; CP) implies that rsc structure take a particular form. I empirically demonstrate that the rsc structure in area V1 (along the orientation dimension) is compatible with these predictions. However, I show quantitatively that this is mostly due to common inputs which change dynamically with the subject’s task (i.e. the set of orientations being discriminated), strongly implying a feedback origin. I also show quantitatively that CP is mostly due to the portion of rsc structure that changes dynamically with the task. This is compatible with the view that signals related to a subject’s perceptual choice are fed back to V1 neurons supporting that choice, and that CP is mostly due to this feedback. In addition, I show that the structured spike-count correlations that change dynamically with the subject’s task degrade the perceptual performance of an ideal observer of the V1 population. This is because they introduce fluctuations in the V1 representation that mimic the effect of changing the stimulus along the dimension being discriminated. I discuss what these results imply about the nature of the common feedback inputs that appear to underlie rsc structure, and discuss possible feedforward effects the resulting spikes may have on a perceptual decision. Advisors/Committee Members: Cumming, Bruce (Director), Wurtz, Robert (Reader), Sheinberg, David (Reader), Shadlen, Michael (Reader).

Subjects/Keywords: neural coding

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Bondy, A. G. (2015). Decision-Related Feedback Influences the Structure of Correlated Variability in Visual Cortex. (Doctoral Dissertation). Brown University. Retrieved from https://repository.library.brown.edu/studio/item/bdr:674087/

Chicago Manual of Style (16^th Edition):

Bondy, Adrian G. “Decision-Related Feedback Influences the Structure of Correlated Variability in Visual Cortex.” 2015. Doctoral Dissertation, Brown University. Accessed January 18, 2021. https://repository.library.brown.edu/studio/item/bdr:674087/.

MLA Handbook (7^th Edition):

Bondy, Adrian G. “Decision-Related Feedback Influences the Structure of Correlated Variability in Visual Cortex.” 2015. Web. 18 Jan 2021.

Vancouver:

Bondy AG. Decision-Related Feedback Influences the Structure of Correlated Variability in Visual Cortex. [Internet] [Doctoral dissertation]. Brown University; 2015. [cited 2021 Jan 18]. Available from: https://repository.library.brown.edu/studio/item/bdr:674087/.

Council of Science Editors:

Bondy AG. Decision-Related Feedback Influences the Structure of Correlated Variability in Visual Cortex. [Doctoral Dissertation]. Brown University; 2015. Available from: https://repository.library.brown.edu/studio/item/bdr:674087/

University of Ottawa

6. Cheng, Zhong. Communication of Dependent Messages Over Compound Channels .

Degree: 2015, University of Ottawa

URL: http://hdl.handle.net/10393/32595

► In the communication of multimedia content, certain dependency structure often exists among the source-coded messages by different source coding techniques, where by "dependency" we mean… (more)

▼ In the communication of multimedia content, certain dependency structure often exists among the source-coded messages by different source coding techniques, where by "dependency" we mean the dependent contributions of the messages to the overall reconstruction quality. Motivated by such notion of dependency, this thesis considers the problem of communicating dependent source-coded messages over compound channels, which include the attractive wireless channels and packet-loss channels. In this thesis we propose a novel framework to model arbitrary dependency structure among source-coded messages from the source-reconstruction perspectives, and formulate the problem of communicating such messages over compound channels as the problem of maximizing the average utility at the receiver. Over discrete memoryless channels (DMC), we derive the expression of maximal achievable utility, which appears to be governed by the channel coding theorem. Over degraded compound channels, we study analytically the maximal achievable utility by superposition codes. To achieve the maximal utility, the encoder chooses the best sub-chain in the utility graph and encodes it using the best superposition code. For the case of two source-coded messages, we show that the maximal utility achieved by superposition codes is the maximum among all coding schemes. Since in practice layered codes (LC) and multiple description codes (MDC) are two most attracted source coding schemes which induce different dependency structures among coded messages, we numerically evaluate the maximal achievable utility for sources coded with those two source coding schemes communicated over DMC and degraded compound channels respectively, and show the impact of communication delay and channel condition on their respective achievable utilities. In addition, for communicating a Gaussian N(0,1) independent identically distributed (i.i.d.) sequence over degraded compound channels, the joint source channel coding schemes are considered and the minimal achievable distortion is derived and compared for different combinations of source and channel codes. It is shown that the combination of LC and superposition codes outperforms other coding schemes. The comparative behaviour among those techniques is further demonstrated by the experimental results. Practically, we study the performances of various coding schemes for communicating two dependent messages over quasi-static Rayleigh fading channels, which include conventional channel codes, time sharing codes, and a low-density parity-check (LDPC) based coding scheme, termed Bi-LDPC codes. The success rates and the throughput of the considered coding schemes are compared. For communicating a Gaussian N(0,1) source sequence encoded by LC and MDC respectively over quasi-static Rayleigh fading channels, the average distortion is also compared among different channel coding schemes. It appears that Bi-LDPC codes, conventional channel codes encoding both messages, and time sharing type-2 (TS-2) codes, each has their advantage over…

Subjects/Keywords: Channel coding

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Cheng, Z. (2015). Communication of Dependent Messages Over Compound Channels . (Thesis). University of Ottawa. Retrieved from http://hdl.handle.net/10393/32595

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Cheng, Zhong. “Communication of Dependent Messages Over Compound Channels .” 2015. Thesis, University of Ottawa. Accessed January 18, 2021. http://hdl.handle.net/10393/32595.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Cheng, Zhong. “Communication of Dependent Messages Over Compound Channels .” 2015. Web. 18 Jan 2021.

Vancouver:

Cheng Z. Communication of Dependent Messages Over Compound Channels . [Internet] [Thesis]. University of Ottawa; 2015. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/10393/32595.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Cheng Z. Communication of Dependent Messages Over Compound Channels . [Thesis]. University of Ottawa; 2015. Available from: http://hdl.handle.net/10393/32595

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

7. Halalai, Raluca. On reducing latency in geo-distributed systems through state partitioning and caching.

Degree: 2018, Université de Neuchâtel

URL: http://doc.rero.ch/record/323987

► Les systèmes distribués modernes sont de plus en plus grands, et sont déployés dans plusieurs régions géographiques. L’objectif final de tels systèmes est de fournir… (more)

▼ Les systèmes distribués modernes sont de plus en plus grands, et sont déployés dans plusieurs régions géographiques. L’objectif final de tels systèmes est de fournir des services à leurs utilisateurs ainsi que haute disponibilité et bonne performance. Cette thèse propose des techniques pour réduire le latence perçue par des utilisateurs. Pour commencer, nous considérons les systèmes qui utilisent la technique de réplication de machines à états afin de garantir la cohérence des données. La technique de réplication de machines à états copie un service à plusieurs emplacements et coordonne les répliques afin de sérialiser toutes les commandes émis par des clients. La coordination à grande échelle a un impact significatif sur la performance du système. Nous étudions comment le partition- nement d’état peut aider à réduire les performances sans affecter la sémantique du système. Premièrement, nous formalisons les conditions dans lesquelles un service est partitionnable et proposons une approche de partitionnement d’état générique. Nous partitionnons un service de coordination géo-distribué et montrons qu’il surpasse son homologue non partitionné, tout en offrant les mêmes garanties. Nous augmentons notre système avec un partitionne- ment d’état dynamique, qui s’adapte à la charge de travail. Notre évaluation montre que le partitionnement d’état dynamique a un impact positif sur les performances du notre système de fichiers. Finalement, nous étudions le compromis entre la latence et les coûts de stockage dans les systèmes de stockage qui utilisent des techniques de codage d’effacement. Afin d’améliorer les performances de lecture, les systèmes de stockage utilisent des caches qui sont proches des clients. Cependant, les stratégies de mise en cache traditionnelles ne sont pas conçu pour les particularités du codage d’effacement et ne sont pas bien adaptés à ce scénario. Nous avons proposé un algorithme pour mettre en cache des données codées et nous l’avons utilisé pour implémenter une système de mise en cache basée sur Memcached. Notre algorithme reconfigure le cache en fonction de la charge de travail et peut surpasser la performance des po- litiques de mise en cache traditionnelles comme Least Recently Used et Least Frequently Used. Advisors/Committee Members: Pascal (Dir.).

Subjects/Keywords: erasure coding

13 more images…

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Halalai, R. (2018). On reducing latency in geo-distributed systems through state partitioning and caching. (Thesis). Université de Neuchâtel. Retrieved from http://doc.rero.ch/record/323987

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Halalai, Raluca. “On reducing latency in geo-distributed systems through state partitioning and caching.” 2018. Thesis, Université de Neuchâtel. Accessed January 18, 2021. http://doc.rero.ch/record/323987.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Halalai, Raluca. “On reducing latency in geo-distributed systems through state partitioning and caching.” 2018. Web. 18 Jan 2021.

Vancouver:

Halalai R. On reducing latency in geo-distributed systems through state partitioning and caching. [Internet] [Thesis]. Université de Neuchâtel; 2018. [cited 2021 Jan 18]. Available from: http://doc.rero.ch/record/323987.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Halalai R. On reducing latency in geo-distributed systems through state partitioning and caching. [Thesis]. Université de Neuchâtel; 2018. Available from: http://doc.rero.ch/record/323987

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Universidad de Cantabria

8. Garrido Ortiz, Pablo. Opportunistic Network Coding over Wireless Networks: Combinación de Soluciones de Codificación de Red con Técnicas Oportunistas sobre Redes Malladas Inalámbricas.

Degree: 2018, Universidad de Cantabria

URL: http://hdl.handle.net/10902/14879

► RESUMEN: Las redes de comunicación han sufrido un cambio drástico desde sus orígenes, y actualmente se enfrentan a un panorama donde el número de dispositivos… (more)

Subjects/Keywords: Network Coding

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Garrido Ortiz, P. (2018). Opportunistic Network Coding over Wireless Networks: Combinación de Soluciones de Codificación de Red con Técnicas Oportunistas sobre Redes Malladas Inalámbricas. (Doctoral Dissertation). Universidad de Cantabria. Retrieved from http://hdl.handle.net/10902/14879

Chicago Manual of Style (16^th Edition):

Garrido Ortiz, Pablo. “Opportunistic Network Coding over Wireless Networks: Combinación de Soluciones de Codificación de Red con Técnicas Oportunistas sobre Redes Malladas Inalámbricas.” 2018. Doctoral Dissertation, Universidad de Cantabria. Accessed January 18, 2021. http://hdl.handle.net/10902/14879.

MLA Handbook (7^th Edition):

Garrido Ortiz, Pablo. “Opportunistic Network Coding over Wireless Networks: Combinación de Soluciones de Codificación de Red con Técnicas Oportunistas sobre Redes Malladas Inalámbricas.” 2018. Web. 18 Jan 2021.

Vancouver:

Garrido Ortiz P. Opportunistic Network Coding over Wireless Networks: Combinación de Soluciones de Codificación de Red con Técnicas Oportunistas sobre Redes Malladas Inalámbricas. [Internet] [Doctoral dissertation]. Universidad de Cantabria; 2018. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/10902/14879.

Council of Science Editors:

Garrido Ortiz P. Opportunistic Network Coding over Wireless Networks: Combinación de Soluciones de Codificación de Red con Técnicas Oportunistas sobre Redes Malladas Inalámbricas. [Doctoral Dissertation]. Universidad de Cantabria; 2018. Available from: http://hdl.handle.net/10902/14879

McMaster University

9. Zheng, Qixue. Graph-Based Solution for Two Scalar Quantization Problems in Network Systems.

Degree: MASc, 2018, McMaster University

URL: http://hdl.handle.net/11375/23972

►

This thesis addresses the optimal scalar quantizer design for two problems, i.e. the two-stage Wyner-Ziv coding problem and the multiple description coding problem for finite-alphabet… (more)

▼

This thesis addresses the optimal scalar quantizer design for two problems, i.e. the two-stage Wyner-Ziv coding problem and the multiple description coding problem for finite-alphabet sources. The optimization problems are formulated as the minimization of a weighted sum of distortions and rates. The proposed solutions are globally optimal when the cells in each partition are contiguous. The solution algorithms are both based on solving the single-source or the all-pairs minimum-weight path (MWP) problems in certain weighted directed acyclic graphs (WDAG). When the conventional dynamic programming technique is used to solve the underlying MWP problems the time complexity achieved is O(N³) for both problems, where N is the size of the source alphabet. We first present the optimal design of a two-stage Wyner-Ziv scalar quantizer with forwardly or reversely degraded side information (SI) {for finite-alphabet sources and SI}. We assume that binning is performed optimally and address the design of the quantizer partitions. A solution based on dynamic programming is proposed with O(N³) time complexity. %The solution relies on finding the single-source or the all-pairs MWP in several one dimensional WDAGs. Further, a so-called {\it partial Monge property} is additionally introduced and a faster solution algorithm exploiting this property is proposed. Experimental results assess the practical performance of the proposed scheme. Then we present the optimal design of an improved modified multiple-description scalar quantizer (MMDSQ). The improvement is achieved by optimizing all the scalar quantizers. %are optimized under the assumption that all the central and side quantizers have contiguous codecells. The optimization is based on solving the single-source MWP problem in a coupled quantizer graph and the all-pairs MWP problem in a WDAG. Another variant design with the same optimization but enhanced with a better decoding process is also presented to decrease the gap to theoretical bounds. Both designs for the second problem have close or even better performances than the literature as shown in experiments.

Thesis

Master of Applied Science (MASc)

Advisors/Committee Members: Dumitrescu, Sorina, Electrical and Computer Engineering.

Subjects/Keywords: Wyner-Ziv coding; Multiple Description Coding

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Zheng, Q. (2018). Graph-Based Solution for Two Scalar Quantization Problems in Network Systems. (Masters Thesis). McMaster University. Retrieved from http://hdl.handle.net/11375/23972

Chicago Manual of Style (16^th Edition):

Zheng, Qixue. “Graph-Based Solution for Two Scalar Quantization Problems in Network Systems.” 2018. Masters Thesis, McMaster University. Accessed January 18, 2021. http://hdl.handle.net/11375/23972.

MLA Handbook (7^th Edition):

Zheng, Qixue. “Graph-Based Solution for Two Scalar Quantization Problems in Network Systems.” 2018. Web. 18 Jan 2021.

Vancouver:

Zheng Q. Graph-Based Solution for Two Scalar Quantization Problems in Network Systems. [Internet] [Masters thesis]. McMaster University; 2018. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/11375/23972.

Council of Science Editors:

Zheng Q. Graph-Based Solution for Two Scalar Quantization Problems in Network Systems. [Masters Thesis]. McMaster University; 2018. Available from: http://hdl.handle.net/11375/23972

10. -5066-7722. Coding mechanisms for communication and compression : analysis of wireless channels and DNA sequencing.

Degree: PhD, Electrical and Computer Engineering, 2015, University of Texas – Austin

URL: http://hdl.handle.net/2152/31408

► This thesis comprises of two related but distinct components: Coding arguments for communication channels and information-theoretic analysis for haplotype assembly. The common thread for both… (more)

Subjects/Keywords: Expansion coding; Polar coding; Haplotype assembly

3 more images…

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

-5066-7722. (2015). Coding mechanisms for communication and compression : analysis of wireless channels and DNA sequencing. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/31408

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Chicago Manual of Style (16^th Edition):

-5066-7722. “Coding mechanisms for communication and compression : analysis of wireless channels and DNA sequencing.” 2015. Doctoral Dissertation, University of Texas – Austin. Accessed January 18, 2021. http://hdl.handle.net/2152/31408.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

MLA Handbook (7^th Edition):

-5066-7722. “Coding mechanisms for communication and compression : analysis of wireless channels and DNA sequencing.” 2015. Web. 18 Jan 2021.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Vancouver:

-5066-7722. Coding mechanisms for communication and compression : analysis of wireless channels and DNA sequencing. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2015. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/2152/31408.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Council of Science Editors:

-5066-7722. Coding mechanisms for communication and compression : analysis of wireless channels and DNA sequencing. [Doctoral Dissertation]. University of Texas – Austin; 2015. Available from: http://hdl.handle.net/2152/31408

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

11. Inocêncio, Miguel Oliveira. Transform co-processor for AV1 video coding standard .

Degree: 2019, Universidade de Aveiro

URL: http://hdl.handle.net/10773/29716

► This dissertation presents a study made of the video coding standard AV1. The research provides statistical results referring to various encoding options, such as the… (more)

Subjects/Keywords: Video Coding; AV1; Transform Coding; DCT; FPGA

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Inocêncio, M. O. (2019). Transform co-processor for AV1 video coding standard . (Thesis). Universidade de Aveiro. Retrieved from http://hdl.handle.net/10773/29716

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Inocêncio, Miguel Oliveira. “Transform co-processor for AV1 video coding standard .” 2019. Thesis, Universidade de Aveiro. Accessed January 18, 2021. http://hdl.handle.net/10773/29716.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Inocêncio, Miguel Oliveira. “Transform co-processor for AV1 video coding standard .” 2019. Web. 18 Jan 2021.

Vancouver:

Inocêncio MO. Transform co-processor for AV1 video coding standard . [Internet] [Thesis]. Universidade de Aveiro; 2019. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/10773/29716.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Inocêncio MO. Transform co-processor for AV1 video coding standard . [Thesis]. Universidade de Aveiro; 2019. Available from: http://hdl.handle.net/10773/29716

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Texas A&M University

12. Hamidi Sepehr, Fatemeh. Performance Analysis of Block Codes over Finite-state Channels in Delay-sensitive Communications.

Degree: PhD, Electrical Engineering, 2014, Texas A&M University

URL: http://hdl.handle.net/1969.1/152477

► As the mobile application landscape expands, wireless networks are tasked with supporting different connection profiles, including real-time traffic and delay-sensitive communications. Among many ensuing engineering… (more)

▼ As the mobile application landscape expands, wireless networks are tasked with supporting different connection profiles, including real-time traffic and delay-sensitive communications. Among many ensuing engineering challenges is the need to better understand the fundamental limits of forward error correction in non-asymptotic regimes. This dissertation seeks to characterize the performance of block codes over finite-state channels with memory and also evaluate their queueing performance under different encoding/decoding schemes. In particular, a fading formulation is considered where a discrete channel with correlation over time introduces errors. For carefully selected channel models and arrival processes, a tractable Markov structure composed of queue length and channel state is identified. This facilitates the analysis of the stationary behavior of the system, leading to evaluation criteria such as bounds on the probability of the queue exceeding a threshold. Specifically, this dissertation focuses on system models with scalable arrival profiles based on Poisson processes, and finite-state memory channels. These assumptions permit the rigorous comparison of system performance for codes with arbitrary block lengths and code rates. Based on this characterization, it is possible to optimize code parameters for delay-sensitive applications over various channels. Random codes and BCH codes are then employed as means to study the relationship between code-rate selection and the queueing performance of point-to-point data links. The introduced methodology offers a new perspective on the joint queueing-coding analysis for finite-state channels, and is supported by numerical simulations. Furthermore, classical results from information theory are revisited in the context of channels with rare transitions, and bounds on the probabilities of decoding failure are derived for random codes. An analysis framework is presented where channel dependencies within and across code words are preserved. The results are subsequently integrated into a queueing formulation. It is shown that for current formulation, the performance analysis based on upper bounds provides a good estimate of both the system performance and the optimum code parameters. Overall, this study offers new insights about the impact of channel correlation on the performance of delay-aware communications and provides novel guidelines to select optimum code rates and block lengths. Advisors/Committee Members: Pfister, Henry D (advisor), Chamberland, Jean-Francois (advisor), Shakkottai, Srinivas (committee member), Sivakumar, N. (committee member).

Subjects/Keywords: Queueing; Channel Coding

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Hamidi Sepehr, F. (2014). Performance Analysis of Block Codes over Finite-state Channels in Delay-sensitive Communications. (Doctoral Dissertation). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/152477

Chicago Manual of Style (16^th Edition):

Hamidi Sepehr, Fatemeh. “Performance Analysis of Block Codes over Finite-state Channels in Delay-sensitive Communications.” 2014. Doctoral Dissertation, Texas A&M University. Accessed January 18, 2021. http://hdl.handle.net/1969.1/152477.

MLA Handbook (7^th Edition):

Hamidi Sepehr, Fatemeh. “Performance Analysis of Block Codes over Finite-state Channels in Delay-sensitive Communications.” 2014. Web. 18 Jan 2021.

Vancouver:

Hamidi Sepehr F. Performance Analysis of Block Codes over Finite-state Channels in Delay-sensitive Communications. [Internet] [Doctoral dissertation]. Texas A&M University; 2014. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/1969.1/152477.

Council of Science Editors:

Hamidi Sepehr F. Performance Analysis of Block Codes over Finite-state Channels in Delay-sensitive Communications. [Doctoral Dissertation]. Texas A&M University; 2014. Available from: http://hdl.handle.net/1969.1/152477

University of Johannesburg

13. Helberg, Albertus Stephanus Jacobus. Coding for the correction of synchronization errors.

Degree: 2014, University of Johannesburg

URL: http://hdl.handle.net/10210/12226

►

Ph.D. (Electrical & Electronic Engineering)

In the ideal communication system no noise is present and error free communication is possible. In practice, however, several factors… (more)

Subjects/Keywords: Coding theory; Synchronization

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Helberg, A. S. J. (2014). Coding for the correction of synchronization errors. (Thesis). University of Johannesburg. Retrieved from http://hdl.handle.net/10210/12226

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Helberg, Albertus Stephanus Jacobus. “Coding for the correction of synchronization errors.” 2014. Thesis, University of Johannesburg. Accessed January 18, 2021. http://hdl.handle.net/10210/12226.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Helberg, Albertus Stephanus Jacobus. “Coding for the correction of synchronization errors.” 2014. Web. 18 Jan 2021.

Vancouver:

Helberg ASJ. Coding for the correction of synchronization errors. [Internet] [Thesis]. University of Johannesburg; 2014. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/10210/12226.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Helberg ASJ. Coding for the correction of synchronization errors. [Thesis]. University of Johannesburg; 2014. Available from: http://hdl.handle.net/10210/12226

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Addis Ababa University

14. DEREJE, GIRMA. PERFORMANCE ANALYSIS OF SPACE TIME CODING ON MIMO AND COOPERATIVE DIVERSITY SYSTEM .

Degree: 2012, Addis Ababa University

URL: http://etd.aau.edu.et/dspace/handle/123456789/4409

► In a wireless network, users can relay information to exploit cooperative diversity, thereby increasing reliability. The uses of multiple transmit and receive antennas (MIMO) can… (more)

Subjects/Keywords: CODING; COOPERATIVE; MIMO

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

DEREJE, G. (2012). PERFORMANCE ANALYSIS OF SPACE TIME CODING ON MIMO AND COOPERATIVE DIVERSITY SYSTEM . (Thesis). Addis Ababa University. Retrieved from http://etd.aau.edu.et/dspace/handle/123456789/4409

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

DEREJE, GIRMA. “PERFORMANCE ANALYSIS OF SPACE TIME CODING ON MIMO AND COOPERATIVE DIVERSITY SYSTEM .” 2012. Thesis, Addis Ababa University. Accessed January 18, 2021. http://etd.aau.edu.et/dspace/handle/123456789/4409.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

DEREJE, GIRMA. “PERFORMANCE ANALYSIS OF SPACE TIME CODING ON MIMO AND COOPERATIVE DIVERSITY SYSTEM .” 2012. Web. 18 Jan 2021.

Vancouver:

DEREJE G. PERFORMANCE ANALYSIS OF SPACE TIME CODING ON MIMO AND COOPERATIVE DIVERSITY SYSTEM . [Internet] [Thesis]. Addis Ababa University; 2012. [cited 2021 Jan 18]. Available from: http://etd.aau.edu.et/dspace/handle/123456789/4409.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

DEREJE G. PERFORMANCE ANALYSIS OF SPACE TIME CODING ON MIMO AND COOPERATIVE DIVERSITY SYSTEM . [Thesis]. Addis Ababa University; 2012. Available from: http://etd.aau.edu.et/dspace/handle/123456789/4409

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Victoria University of Wellington

15. Van Velthooven, Claudia. Scripted tower [Creative coding for responsive environments].

Degree: 2017, Victoria University of Wellington

URL: http://hdl.handle.net/10063/7037

► This thesis is based on investigating computational design methodologies for the generation of responsive environments, exploring the opportunities that creative coding and parametric based design… (more)

▼ This thesis is based on investigating computational design methodologies for the generation of responsive environments, exploring the opportunities that creative coding and parametric based design approaches can offer architects of the 21st century. It is highly research focused with a test-case design formulated as an outcome of this research. Architecture has always evolved with history to remain a manifestation and reflection of society and the materials/tools available to the architects at the time. Today, technological advancements and computational techniques have redefined the agency of design methodologies and manifested a paradigmatic shift to the context and practice of architecture. Computationally mediated form finding techniques have rapidly evolved over the past twenty years and continue to advance the possibilities to generate new building forms and complex, responsive, and adaptive geometries. It is undeniable that within the last decade, digital technologies have begun to initiate a paramount ensemble of affordance that are reconfiguring design and design thinking. This research invites the possibilities of creative-code-based design systems, as this approach becomes more widely taken up and more confidently embedded into the design process by architects and designers across the globe. Scripting/coding is typically seen primarily as a productivity tool compared to its potential to assist design exploration however, the power of computationally mediated design does not lie in computer aided design (CAD) based work flows, but in the possibility to engage with algorithmic design processes that unite design with the computer; the difference between computerisation (CAD) and computation (scripting). This research investigates the potentials of a computational design methodology that integrates creative coding techniques for early-stage design approach. There are endless ways to utilise code-based processes for design; to begin, this research focuses on exploring a few common techniques, leading into a novel, innovative code that is context specific and locally and globally responsive. The nature of code is inherently open-source with digital files easily transferable and shared online. This poses prevalent current concerns surrounding topics of authorship, and generates speculations of how this may affect/contribute to the wider profession and the future of the architectural profession - another discourse addressed in this research. The outcome of this research process is tested through a system for a responsive tower design. The tower is highly speculative and is primarily concerned/focused on the innovative design process and, accordingly, the potentials for creative-code-based generative design in architecture. The tower is context specific to Wellington, embedding local wind data and immediate environmental conditions into the code, employing an emergent/generative design that could not have been prior conceived-of with the human mind alone. Developing on Carpo’s quote (page 10) further, this… Advisors/Committee Members: Schnabel, Marc Aurel, Sweet, Kevin.

Subjects/Keywords: Responsive; Coding; Scripting

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Van Velthooven, C. (2017). Scripted tower [Creative coding for responsive environments]. (Masters Thesis). Victoria University of Wellington. Retrieved from http://hdl.handle.net/10063/7037

Chicago Manual of Style (16^th Edition):

Van Velthooven, Claudia. “Scripted tower [Creative coding for responsive environments].” 2017. Masters Thesis, Victoria University of Wellington. Accessed January 18, 2021. http://hdl.handle.net/10063/7037.

MLA Handbook (7^th Edition):

Van Velthooven, Claudia. “Scripted tower [Creative coding for responsive environments].” 2017. Web. 18 Jan 2021.

Vancouver:

Van Velthooven C. Scripted tower [Creative coding for responsive environments]. [Internet] [Masters thesis]. Victoria University of Wellington; 2017. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/10063/7037.

Council of Science Editors:

Van Velthooven C. Scripted tower [Creative coding for responsive environments]. [Masters Thesis]. Victoria University of Wellington; 2017. Available from: http://hdl.handle.net/10063/7037

Delft University of Technology

16. Antoniou, D. (author). A systematic method to execute simulated phishing tests.

Degree: 2015, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:a564c014-59d0-4802-860d-cae04d69448a

This thesis is a coding scheme with which people can perform simulated phishing tests in systematic way. This enables the making of evidence-based phishing and allows for future analysis of the phishing results.

Management of Technology

ICT

Technology, Policy and Management

Advisors/Committee Members: Pieters, W. (mentor).

Subjects/Keywords: phishing; coding scheme

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Antoniou, D. (. (2015). A systematic method to execute simulated phishing tests. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:a564c014-59d0-4802-860d-cae04d69448a

Chicago Manual of Style (16^th Edition):

Antoniou, D (author). “A systematic method to execute simulated phishing tests.” 2015. Masters Thesis, Delft University of Technology. Accessed January 18, 2021. http://resolver.tudelft.nl/uuid:a564c014-59d0-4802-860d-cae04d69448a.

MLA Handbook (7^th Edition):

Antoniou, D (author). “A systematic method to execute simulated phishing tests.” 2015. Web. 18 Jan 2021.

Vancouver:

Antoniou D(. A systematic method to execute simulated phishing tests. [Internet] [Masters thesis]. Delft University of Technology; 2015. [cited 2021 Jan 18]. Available from: http://resolver.tudelft.nl/uuid:a564c014-59d0-4802-860d-cae04d69448a.

Council of Science Editors:

Antoniou D(. A systematic method to execute simulated phishing tests. [Masters Thesis]. Delft University of Technology; 2015. Available from: http://resolver.tudelft.nl/uuid:a564c014-59d0-4802-860d-cae04d69448a

Queens University

17. Azar, Ghady. On the Optimality of the Hamming Metric for Decoding Block Codes over Binary Additive Noise Channels .

Degree: Mathematics and Statistics, 2013, Queens University

URL: http://hdl.handle.net/1974/8111

► Most of the basic concepts of algebraic coding theory are derived for the memoryless binary symmetric channel. These concepts do not necessarily hold for time-varying… (more)

Subjects/Keywords: Communications ; Coding Theory

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Azar, G. (2013). On the Optimality of the Hamming Metric for Decoding Block Codes over Binary Additive Noise Channels . (Thesis). Queens University. Retrieved from http://hdl.handle.net/1974/8111

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Azar, Ghady. “On the Optimality of the Hamming Metric for Decoding Block Codes over Binary Additive Noise Channels .” 2013. Thesis, Queens University. Accessed January 18, 2021. http://hdl.handle.net/1974/8111.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Azar, Ghady. “On the Optimality of the Hamming Metric for Decoding Block Codes over Binary Additive Noise Channels .” 2013. Web. 18 Jan 2021.

Vancouver:

Azar G. On the Optimality of the Hamming Metric for Decoding Block Codes over Binary Additive Noise Channels . [Internet] [Thesis]. Queens University; 2013. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/1974/8111.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Azar G. On the Optimality of the Hamming Metric for Decoding Block Codes over Binary Additive Noise Channels . [Thesis]. Queens University; 2013. Available from: http://hdl.handle.net/1974/8111

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of New South Wales

18. Perera, Dilmi. Investigating the role of non-coding mutations in cancer.

Degree: Prince of Wales Clinical School, 2017, University of New South Wales

URL: http://handle.unsw.edu.au/1959.4/57601 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:44168/SOURCE02?view=true

► Whole genomes are being sequenced at an accelerated pace but research into cancer causing mutations has focused primarily on protein-coding mutations owing to difficulties associated… (more)

▼ Whole genomes are being sequenced at an accelerated pace but research into cancer causing mutations has focused primarily on protein-coding mutations owing to difficulties associated with identifying and interpreting causality of noncoding mutations. Nevertheless, projects such as ENCODE and the Epigenome Atlas have led to the generation of genome-wide datasets that have contributed to our understanding of the noncoding parts of the human genome. The integration of these datasets has the potential to shed light on the functions of noncoding sequences, gene regulatory modules and epistatic interactions underlying disease associations. Moreover, through technological advances it is now feasible to routinely sequence whole genomes of cancer samples which has enable large international consortiums such as TCGA and ICGC to create public datasets consisting of mutations from whole genome sequencing of 1000s of tumour samples. The integrative analyses of datasets from these resources have provided new opportunities to interrogate non-coding cancer mutations. In order to elucidate the role of cis-regulatory mutations in cancer, I developed an annotation method and web tool to study the effect of cis-regulatory mutations in cancer and to identify potential causal mutations for further investigations. Applying this tool to whole breast cancer genome sequencing data, I discovered a point mutation in the enhancer of CDK6 that results in the overexpression of the gene. I then conducted a pan-cancer analysis of cis-regulatory mutations using somatic mutations from 1161 whole tumour genomes across 14 cancer types from publicly available data sources which revealed a previously unknown mechanism linking transcription initiation and NER as a major contributor of somatic point mutation hotspots at active gene promoters in cancer genomes. In the final chapter of the thesis, I examined cancer mutations in non-coding RNA and their effect on structure and function. Through this thesis, I have been able to significantly contribute to our understanding of non-coding or regulatory regions of the genome and the role of mutations in these regions in cancer and to develop computational methods and tools to assist experimentalists to further explore this field of science. Advisors/Committee Members: Wong, Jason, Prince of Wales Clinical School, Faculty of Medicine, UNSW, Pimanda, John, Prince of Wales Clinical School, Faculty of Medicine, UNSW.

Subjects/Keywords: Non-coding mutations

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Perera, D. (2017). Investigating the role of non-coding mutations in cancer. (Doctoral Dissertation). University of New South Wales. Retrieved from http://handle.unsw.edu.au/1959.4/57601 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:44168/SOURCE02?view=true

Chicago Manual of Style (16^th Edition):

Perera, Dilmi. “Investigating the role of non-coding mutations in cancer.” 2017. Doctoral Dissertation, University of New South Wales. Accessed January 18, 2021. http://handle.unsw.edu.au/1959.4/57601 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:44168/SOURCE02?view=true.

MLA Handbook (7^th Edition):

Perera, Dilmi. “Investigating the role of non-coding mutations in cancer.” 2017. Web. 18 Jan 2021.

Vancouver:

Perera D. Investigating the role of non-coding mutations in cancer. [Internet] [Doctoral dissertation]. University of New South Wales; 2017. [cited 2021 Jan 18]. Available from: http://handle.unsw.edu.au/1959.4/57601 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:44168/SOURCE02?view=true.

Council of Science Editors:

Perera D. Investigating the role of non-coding mutations in cancer. [Doctoral Dissertation]. University of New South Wales; 2017. Available from: http://handle.unsw.edu.au/1959.4/57601 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:44168/SOURCE02?view=true

University of Texas – Austin

19. Bhowmick, Abhishek. Algebraic and analytic techniques in coding theory.

Degree: PhD, Computer science, 2015, University of Texas – Austin

URL: http://hdl.handle.net/2152/33308

► Error correcting codes are designed to tackle the problem of reliable trans- mission of data through noisy channels. A major challenge in coding theory is… (more)

▼ Error correcting codes are designed to tackle the problem of reliable trans- mission of data through noisy channels. A major challenge in coding theory is to efficiently recover the original message even when many symbols of the received data have been corrupted. This is called the unique decoding problem of error correcting codes. More precisely, if the user wants to send K bits, the code stretches K bits to N bits to tolerate errors in the N bits. Then the goal is to recover the original K bits of the message. Often, the receiver requires only a certain part of the message. In such cases, analyzing the entire received data (word) becomes prohibitive. The challenge is to design a local decoder which queries only few locations of the received word and outputs the part of the message required. This is known as local decoding of an error correcting code. The unique decoding problem faces a certain combinatorial barrier. That is, there is a limit to the number of errors it can tolerate in order to uniquely identify the correct message. This is called the unique decoding radius. A major open problem is to understand what happens if one allows for errors beyond this threshold. The goal is to design an algorithm that can recover the right message, or possibly a list of messages (preferably a small number). This is referred to as list decoding of an error correcting code. At the core of many such codes lies polynomials. Polynomials play a fundamental role in computer science with important applications in algorithm design, complexity theory, pseudo-randomness and machine learning. In this dissertation, we improve our understanding of well known classes of codes and discover various properties of polynomials. As an additional consequence, we obtain results in a suite of problems in effective algebraic geometry, including Hilbert’s nullstellensatz, ideal membership problem and counting rational points in a variety. Advisors/Committee Members: Zuckerman, David I. (advisor), Bajaj, Chandrajit (committee member), Gal, Anna (committee member), Lovett, Shachar (committee member), Price, Eric (committee member).

Subjects/Keywords: Polynomials; Coding theory

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Bhowmick, A. (2015). Algebraic and analytic techniques in coding theory. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/33308

Chicago Manual of Style (16^th Edition):

Bhowmick, Abhishek. “Algebraic and analytic techniques in coding theory.” 2015. Doctoral Dissertation, University of Texas – Austin. Accessed January 18, 2021. http://hdl.handle.net/2152/33308.

MLA Handbook (7^th Edition):

Bhowmick, Abhishek. “Algebraic and analytic techniques in coding theory.” 2015. Web. 18 Jan 2021.

Vancouver:

Bhowmick A. Algebraic and analytic techniques in coding theory. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2015. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/2152/33308.

Council of Science Editors:

Bhowmick A. Algebraic and analytic techniques in coding theory. [Doctoral Dissertation]. University of Texas – Austin; 2015. Available from: http://hdl.handle.net/2152/33308

University of Illinois – Urbana-Champaign

20. Johnson, Erik C. Minimum-error, energy-constrained source coding by sensory neurons.

Degree: PhD, Electrical & Computer Engr, 2016, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/95741

► Neural coding, the process by which neurons represent, transmit, and manipulate physical signals, is critical to the function of the nervous system. Despite years of… (more)

▼ Neural coding, the process by which neurons represent, transmit, and manipulate physical signals, is critical to the function of the nervous system. Despite years of study, neural coding is still not fully understood. Efforts to model neural coding could improve both the understanding of the nervous system and the design of artificial devices which interact with neurons. Sensory receptors and neurons transduce physical signals into a sequence of action potentials, called a spike train. The principles which underly the translation from signal to spike train are still under investigation. From the perspective of an organism, neural codes which maximize the fidelity of the encoded signal (minimize encoding error), provide a competitive advantage. Selective pressure over evolutionary timescales has likely encouraged neural codes which minimize encoding error. At the same time, neural coding is metabolically expensive, which suggests that selective pressure would also encourage neural codes which minimize energy. Based on these assumptions, this work proposes a principle of neural coding which captures the trade-off between error and energy as a constrained optimization problem of minimizing encoding error while satisfying a constraint on energy. A solution to the proposed optimization problem is derived in the limit of high spike-rates. The solution is to track the instantaneous reconstruction error, and to time spikes when the error crosses a threshold value. In the limit of large signals, the threshold level is a constant, but in general it is signal dependent. This coding model, called the neural source coder, implies neurons should be able to track reconstruction error internally, using the error signal to precisely time spikes. Mathematically, this model is similar to existing adaptive threshold models, but it provides a new way to understand coding by sensory neurons. Comparing the predictions of the neural source coder to experimental data recorded from a peripheral neuron, the coder is able to predict spike times with considerable accuracy. Intriguingly, this is also true for a cortical neuron which has a low spike-rate. Reconstructions using the neural source coder show lower error than other spiking neuron models. The neural source coder also predicts the asymmetric spike-rate adaptation seen in sensory neurons (the primary-like response). An alternative expression for the neural source coder is as an instantaneous-rate coder of a rate function which depends on the signal, signal derivative, and encoding parameters. The instantaneous rate closely predicts experimental peri-stimulus time histograms. The addition of a stochastic threshold to the neural source coder accounts for the spike-time jitter observed in experimental datasets. Jittered spike-trains from the neural source coder show long-term interval statistics which closely match experimental recordings from a peripheral neuron. Moreover, the spike trains have strongly anti-correlated intervals, a feature observed in experimental data.… Advisors/Committee Members: Jones, Douglas L. (advisor), Jones, Douglas L. (Committee Chair), Levinson, Stephen E. (committee member), Varshney, Lav R. (committee member), Nelson, Mark E. (committee member), Ratnam, Rama (committee member).

Subjects/Keywords: neural coding; sensory neurons; source coding; temporal coding; minimum energy

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Johnson, E. C. (2016). Minimum-error, energy-constrained source coding by sensory neurons. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/95741

Chicago Manual of Style (16^th Edition):

Johnson, Erik C. “Minimum-error, energy-constrained source coding by sensory neurons.” 2016. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed January 18, 2021. http://hdl.handle.net/2142/95741.

MLA Handbook (7^th Edition):

Johnson, Erik C. “Minimum-error, energy-constrained source coding by sensory neurons.” 2016. Web. 18 Jan 2021.

Vancouver:

Johnson EC. Minimum-error, energy-constrained source coding by sensory neurons. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2016. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/2142/95741.

Council of Science Editors:

Johnson EC. Minimum-error, energy-constrained source coding by sensory neurons. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2016. Available from: http://hdl.handle.net/2142/95741

NSYSU

21. Tseng, Tsungyi-Yi. High Efficiency Video Coding via Predictive Texture Synthesis.

Degree: Master, Electrical Engineering, 2013, NSYSU

URL: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0810113-152240

► In recent years, video coding technology such as H.264/AVC and High Efficiency Video Coding (HEVC) has matured. Among the coding methods, intra coding is a… (more)

Subjects/Keywords: video coding; intra coding; H.264/AVC; High Efficiency Video Coding(HEVC); video compression

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Tseng, T. (2013). High Efficiency Video Coding via Predictive Texture Synthesis. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0810113-152240

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Tseng, Tsungyi-Yi. “High Efficiency Video Coding via Predictive Texture Synthesis.” 2013. Thesis, NSYSU. Accessed January 18, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0810113-152240.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Tseng, Tsungyi-Yi. “High Efficiency Video Coding via Predictive Texture Synthesis.” 2013. Web. 18 Jan 2021.

Vancouver:

Tseng T. High Efficiency Video Coding via Predictive Texture Synthesis. [Internet] [Thesis]. NSYSU; 2013. [cited 2021 Jan 18]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0810113-152240.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Tseng T. High Efficiency Video Coding via Predictive Texture Synthesis. [Thesis]. NSYSU; 2013. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0810113-152240

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of California – San Diego

22. Arbabjolfaei, Fatemeh. Index Coding: Fundamental Limits, Coding Schemes, and Structural Properties.

Degree: Electrical Engineering (Communication Theory and Systems), 2017, University of California – San Diego

URL: http://www.escholarship.org/uc/item/5jj8f93m

► Originally introduced to minimize the number of transmissions in satellite communication, index coding is a canonical problem in network information theory that studies the fundamental… (more)

Subjects/Keywords: Electrical engineering; Computer science; graph theory; index coding; lexicographic product; network coding; random coding

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Arbabjolfaei, F. (2017). Index Coding: Fundamental Limits, Coding Schemes, and Structural Properties. (Thesis). University of California – San Diego. Retrieved from http://www.escholarship.org/uc/item/5jj8f93m

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Arbabjolfaei, Fatemeh. “Index Coding: Fundamental Limits, Coding Schemes, and Structural Properties.” 2017. Thesis, University of California – San Diego. Accessed January 18, 2021. http://www.escholarship.org/uc/item/5jj8f93m.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Arbabjolfaei, Fatemeh. “Index Coding: Fundamental Limits, Coding Schemes, and Structural Properties.” 2017. Web. 18 Jan 2021.

Vancouver:

Arbabjolfaei F. Index Coding: Fundamental Limits, Coding Schemes, and Structural Properties. [Internet] [Thesis]. University of California – San Diego; 2017. [cited 2021 Jan 18]. Available from: http://www.escholarship.org/uc/item/5jj8f93m.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Arbabjolfaei F. Index Coding: Fundamental Limits, Coding Schemes, and Structural Properties. [Thesis]. University of California – San Diego; 2017. Available from: http://www.escholarship.org/uc/item/5jj8f93m

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Texas A&M University

23. Hern, Brett Michael. Coding Schemes for Physical Layer Network Coding Over a Two-Way Relay Channel.

Degree: PhD, Electrical Engineering, 2013, Texas A&M University

URL: http://hdl.handle.net/1969.1/151149

► We consider a two-way relay channel in which two transmitters want to exchange information through a central relay. The relay observes a superposition of the… (more)

▼ We consider a two-way relay channel in which two transmitters want to exchange information through a central relay. The relay observes a superposition of the trans- mitted signals from which a function of the transmitted messages is computed for broadcast. We consider the design of codebooks which permit the recovery of a function at the relay and derive information-theoretic bounds on the rates for reliable decoding at the relay. In the spirit of compute-and-forward, we present a multilevel coding scheme that permits reliable computation (or, decoding) of a class of functions at the relay. The function to be decoded is chosen at the relay depending on the channel realization. We define such a class of reliably computable functions for the proposed coding scheme and derive rates that are universally achievable over a set of channel gains when this class of functions is used at the relay. We develop our framework with general modulation formats in mind, but numerical results are presented for the case where each node transmits using 4-ary and 8-ary modulation schemes. Numerical results demonstrate that the flexibility afforded by our proposed scheme permits substantially higher rates than those achievable by always using a fixed function or considering only linear functions over higher order fields. Our numerical results indicate that it is favorable to allow the relay to attempt both compute-and-forward and decode-and-forward decoding. Indeed, either method considered separately is suboptimal for computation over general channels. However, we obtain a converse result when the transmitters are restricted to using identical binary linear codebooks generated uniformly at random. We show that it is impossible for this code ensemble to achieve any rate higher than the maximum of the rates achieved using compute-and-forward and decode-and-forward decoding. Finally, we turn our attention to the design of low density parity check (LDPC) ensembles which can practically achieve these information rates with joint-compute- and-forward message passing decoding. To this end, we construct a class of two-way erasure multiple access channels for which we can exactly characterize the performance of joint-compute-and-forward message passing decoding. We derive the processing rules and a density evolution like analysis for several classes of LDPC ensembles. Utilizing the universally optimal performance of spatially coupled LDPC ensembles with message passing decoding, we show that a single encoder and de- coder with puncturing can achieve the optimal rate region for a range of channel parameters. Advisors/Committee Members: Narayanan, Krishna R. (advisor), Miller, Scott (committee member), Sprintson, Alex (committee member), Jiang, Anxiao (committee member).

Subjects/Keywords: Two-Way Relay Channel; Physical Layer Network Coding; Information Theory; Channel Coding; Multilevel Coding

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Hern, B. M. (2013). Coding Schemes for Physical Layer Network Coding Over a Two-Way Relay Channel. (Doctoral Dissertation). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/151149

Chicago Manual of Style (16^th Edition):

Hern, Brett Michael. “Coding Schemes for Physical Layer Network Coding Over a Two-Way Relay Channel.” 2013. Doctoral Dissertation, Texas A&M University. Accessed January 18, 2021. http://hdl.handle.net/1969.1/151149.

MLA Handbook (7^th Edition):

Hern, Brett Michael. “Coding Schemes for Physical Layer Network Coding Over a Two-Way Relay Channel.” 2013. Web. 18 Jan 2021.

Vancouver:

Hern BM. Coding Schemes for Physical Layer Network Coding Over a Two-Way Relay Channel. [Internet] [Doctoral dissertation]. Texas A&M University; 2013. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/1969.1/151149.

Council of Science Editors:

Hern BM. Coding Schemes for Physical Layer Network Coding Over a Two-Way Relay Channel. [Doctoral Dissertation]. Texas A&M University; 2013. Available from: http://hdl.handle.net/1969.1/151149

Texas A&M University

24. Zhang, Yifu. Multiterminal Video Coding: From Theory to Application.

Degree: PhD, Electrical Engineering, 2012, Texas A&M University

URL: http://hdl.handle.net/1969.1/ETD-TAMU-2012-08-11428

► Multiterminal (MT) video coding is a practical application of the MT source coding theory. For MT source coding theory, two problems associated with achievable rate… (more)

Subjects/Keywords: video coding; information theory; multiterminal source coding; H.264/AVC; multiview video coding; depth camera

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Zhang, Y. (2012). Multiterminal Video Coding: From Theory to Application. (Doctoral Dissertation). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2012-08-11428

Chicago Manual of Style (16^th Edition):

Zhang, Yifu. “Multiterminal Video Coding: From Theory to Application.” 2012. Doctoral Dissertation, Texas A&M University. Accessed January 18, 2021. http://hdl.handle.net/1969.1/ETD-TAMU-2012-08-11428.

MLA Handbook (7^th Edition):

Zhang, Yifu. “Multiterminal Video Coding: From Theory to Application.” 2012. Web. 18 Jan 2021.

Vancouver:

Zhang Y. Multiterminal Video Coding: From Theory to Application. [Internet] [Doctoral dissertation]. Texas A&M University; 2012. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2012-08-11428.

Council of Science Editors:

Zhang Y. Multiterminal Video Coding: From Theory to Application. [Doctoral Dissertation]. Texas A&M University; 2012. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2012-08-11428

Delft University of Technology

25. Marcelis, P.J. (author). Frame Loss Characterisation and Data Erasure Coding for LoRaWAN.

Degree: 2016, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:78c5e6ea-d34b-498d-b723-9b45d7998480

►

Internet of Things (IoT) solutions are increasingly being deployed for smart applications. With the rise of smart cities there is a need for low cost… (more)

▼

Internet of Things (IoT) solutions are increasingly being deployed for smart applications. With the rise of smart cities there is a need for low cost and long range Low Power Wide Area Network (LPWAN) technologies. LoRaWAN is an energy efficient and cheap LPWAN solution. It is rapidly being adopted all around the world. LoRaWAN however does not provide communication robustness in its basic configuration. Transmitted frames can be lost. In this study we perform extensive measurements on a brand new LoRaWAN network to characterise spatial and temporal properties of frame loss. The empirical outage probability for the farthest measured distance from the closest gateway of 7.5 km in our deployment is as low as 0.004, but the frame loss at this distance is significantly high with 70% frame loss. Furthermore, we show that burstiness in frame loss can be expected for both mobile and stationary situations. Frame loss results in data loss, since in the basic configuration frames are only transmitted once. To reduce data loss in packet-based transmission like in LoRaWAN, we design a novel data erasure coding scheme called DaRe. This coding scheme extends frames with redundant information that is calculated from the data from previous frames. We use a fountain code approach with a sliding window. We also develop an implementation for DaRe in LoRaWAN. We show that 99% of the data can be recovered with a code rate of 1/2 when frame loss is up to 40%. Compared to a simple repetition coding method DaRe provides 21% more data recovery, and can save up to 42% energy consumption on transmission for 10 byte data units. DaRe also provides better resilience against bursty frame loss. This study provides useful results to both LoRaWAN network operators as well as developers of LoRaWAN applications. Network operators can use the results to identify possible weaknesses in the network, and application developers are offered a tool to prevent possible data loss.

Electrical Engineering, Mathematics and Computer Science

Embedded Software Section

Advisors/Committee Members: Venkatesha Prasad, R.R. (mentor).

Subjects/Keywords: lora; lorawan; network; measurements; forward error correction; erasure coding; channel coding; application level coding

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Marcelis, P. J. (. (2016). Frame Loss Characterisation and Data Erasure Coding for LoRaWAN. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:78c5e6ea-d34b-498d-b723-9b45d7998480

Chicago Manual of Style (16^th Edition):

Marcelis, P J (author). “Frame Loss Characterisation and Data Erasure Coding for LoRaWAN.” 2016. Masters Thesis, Delft University of Technology. Accessed January 18, 2021. http://resolver.tudelft.nl/uuid:78c5e6ea-d34b-498d-b723-9b45d7998480.

MLA Handbook (7^th Edition):

Marcelis, P J (author). “Frame Loss Characterisation and Data Erasure Coding for LoRaWAN.” 2016. Web. 18 Jan 2021.

Vancouver:

Marcelis PJ(. Frame Loss Characterisation and Data Erasure Coding for LoRaWAN. [Internet] [Masters thesis]. Delft University of Technology; 2016. [cited 2021 Jan 18]. Available from: http://resolver.tudelft.nl/uuid:78c5e6ea-d34b-498d-b723-9b45d7998480.

Council of Science Editors:

Marcelis PJ(. Frame Loss Characterisation and Data Erasure Coding for LoRaWAN. [Masters Thesis]. Delft University of Technology; 2016. Available from: http://resolver.tudelft.nl/uuid:78c5e6ea-d34b-498d-b723-9b45d7998480

26. Khattak, Shadan. Low complexity multiview video coding.

Degree: PhD, 2014, De Montfort University

URL: http://hdl.handle.net/2086/10511

► 3D video is a technology that has seen a tremendous attention in the recent years. Multiview Video Coding (MVC) is an extension of the popular… (more)

▼ 3D video is a technology that has seen a tremendous attention in the recent years. Multiview Video Coding (MVC) is an extension of the popular H.264 video coding standard and is commonly used to compress 3D videos. It offers an improvement of 20% to 50% in compression efficiency over simulcast encoding of multiview videos using the conventional H.264 video coding standard. However, there are two important problems associated with it: (i) its superior compression performance comes at the cost of significantly higher computational complexity which hampers the real-world realization of MVC encoder in applications such as 3D live broadcasting and interactive Free Viewpoint Television (FTV), and (ii) compressed 3D videos can suffer from packet loss during transmission, which can degrade the viewing quality of the 3D video at the decoder. This thesis aims to solve these problems by presenting techniques to reduce the computational complexity of the MVC encoder and by proposing a consistent error concealment technique for frame losses in 3D video transmission. The thesis first analyses the complexity of the MVC encoder. It then proposes two novel techniques to reduce the complexity of motion and disparity estimation. The first method achieves complexity reduction in the disparity estimation process by exploiting the relationship between temporal levels, type of macroblocks and search ranges while the second method achieves it by exploiting the geometrical relation- ship between motion and disparity vectors in stereo frames. These two methods are then combined with other state-of-the-art methods in a unique framework where gains add up. Experimental results show that the proposed low-complexity framework can reduce the encoding time of the standard MVC encoder by over 93% while maintaining similar compression efficiency performance. The addition of new View Synthesis Prediction (VSP) modes to the MVC encoding framework improves the compression efficiency of MVC. However, testing additional modes comes at the cost of increased encoding complexity. In order to reduce the encoding complexity, the thesis, next, proposes a bayesian early mode decision technique for a VSP enhanced MVC coder. It exploits the statistical similarities between the RD costs of the VSP SKIP mode in neighbouring views to terminate the mode decision process early. Results indicate that the proposed technique can reduce the encoding time of the enhanced MVC coder by over 33% at similar compression efficiency levels. Finally, compressed 3D videos are usually required to be broadcast to a large number of users where transmission errors can lead to frame losses which can degrade the video quality at the decoder. A simple reconstruction of the lost frames can lead to inconsistent reconstruction of the 3D scene which may negatively affect the viewing experience of a user. In order to solve this problem, the thesis proposes, at the end, a consistency model for recovering frames lost during transmission. The proposed consistency model is used to evaluate…

Subjects/Keywords: 600; multiview video coding; 3D Video; Video Compression; Video Coding; MVC; 3D Video Coding

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Khattak, S. (2014). Low complexity multiview video coding. (Doctoral Dissertation). De Montfort University. Retrieved from http://hdl.handle.net/2086/10511

Chicago Manual of Style (16^th Edition):

Khattak, Shadan. “Low complexity multiview video coding.” 2014. Doctoral Dissertation, De Montfort University. Accessed January 18, 2021. http://hdl.handle.net/2086/10511.

MLA Handbook (7^th Edition):

Khattak, Shadan. “Low complexity multiview video coding.” 2014. Web. 18 Jan 2021.

Vancouver:

Khattak S. Low complexity multiview video coding. [Internet] [Doctoral dissertation]. De Montfort University; 2014. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/2086/10511.

Council of Science Editors:

Khattak S. Low complexity multiview video coding. [Doctoral Dissertation]. De Montfort University; 2014. Available from: http://hdl.handle.net/2086/10511

NSYSU

27. Liou, Jing-Tsung. Network coding based P2P content distribution system in VANET.

Degree: Master, Computer Science and Engineering, 2009, NSYSU

URL: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0729109-143242

► As the rapid evolution of the technology and the network communication, people can share the multimedia content more easily through the Internet. And devices for… (more)

Subjects/Keywords: P2P; Network coding; VANET

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Liou, J. (2009). Network coding based P2P content distribution system in VANET. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0729109-143242

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Liou, Jing-Tsung. “Network coding based P2P content distribution system in VANET.” 2009. Thesis, NSYSU. Accessed January 18, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0729109-143242.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Liou, Jing-Tsung. “Network coding based P2P content distribution system in VANET.” 2009. Web. 18 Jan 2021.

Vancouver:

Liou J. Network coding based P2P content distribution system in VANET. [Internet] [Thesis]. NSYSU; 2009. [cited 2021 Jan 18]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0729109-143242.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Liou J. Network coding based P2P content distribution system in VANET. [Thesis]. NSYSU; 2009. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0729109-143242

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Oregon State University

28. Hughes, Jeffery R. Adaptive digital transceiver for rayleigh fading channels.

Degree: MS, Electrical and Computer Engineering, 2003, Oregon State University

URL: http://hdl.handle.net/1957/11728

► This thesis presents an adaptive modulation scheme using a Walsh-code modulator. The Walsh-code modulator consists of a dynamic demultiplexer and predetermined sets of orthogonal Walsh-Hadamard… (more)

Subjects/Keywords: Coding theory

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Hughes, J. R. (2003). Adaptive digital transceiver for rayleigh fading channels. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/11728

Chicago Manual of Style (16^th Edition):

Hughes, Jeffery R. “Adaptive digital transceiver for rayleigh fading channels.” 2003. Masters Thesis, Oregon State University. Accessed January 18, 2021. http://hdl.handle.net/1957/11728.

MLA Handbook (7^th Edition):

Hughes, Jeffery R. “Adaptive digital transceiver for rayleigh fading channels.” 2003. Web. 18 Jan 2021.

Vancouver:

Hughes JR. Adaptive digital transceiver for rayleigh fading channels. [Internet] [Masters thesis]. Oregon State University; 2003. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/1957/11728.

Council of Science Editors:

Hughes JR. Adaptive digital transceiver for rayleigh fading channels. [Masters Thesis]. Oregon State University; 2003. Available from: http://hdl.handle.net/1957/11728

Oregon State University

29. Nguyen, Dong Van. Network coding for multi-user wireless networks.

Degree: PhD, Electrical and Computer Engineering, 2009, Oregon State University

URL: http://hdl.handle.net/1957/12003

► Until a few years ago, wireless-capable laptops were considered novelties by many. It is now hard to find a laptop or a hand-held computing device… (more)

▼ Until a few years ago, wireless-capable laptops were considered novelties by many. It is now hard to find a laptop or a hand-held computing device that is not wireless-ready. As wireless devices are becoming commodities, they have also become an indispensable part of the modern society. Not surprisingly, research in wireless communication has also been significantly advanced in the past decade, to accommodate the growing demand for these wireless devices and applications. Yet, many challenges remain in transmitting information reliably, timely, and efficiently over wireless channels. Unlike wired transmissions, wireless transmissions are subjected to limited bandwidth, and are much more susceptible to environmental noises such as fading and interferences. As a result, it is difficult to transmit information reliably at high data rates. The problem is further compounded by the strict requirements on maximum delay and minimum throughput imposed by current and future multimedia applications. That said, recent advances in coding techniques, communication protocols and architectures provide an optimistic view of future wireless networks that help proliferate high quality wireless multimedia applications. One significant advance in coding theory in the past decade is em Network Coding (NC). NC refers to the notion of mixing information from different flows at intermediate nodes in the network, and it has been shown to achieve throughput capacity. In this dissertation, we investigate NC theories and practical techniques for improving throughput and reducing delay of wireless networking applications. Specifically, the dissertation will focus on theoretical analysis of NC benefits and limitations as well as design of NC-based practical protocols for improving performance in a wireless access network such as Wi-Fi or WiMax. There are three main contributions of the dissertation. First, we propose a NC-based retransmission protocol for broadcasting information from a wireless base station to multiple users in a wireless access network. The proposed NC protocol exploits the special property of wireless transmissions that users in proximity, can listen to each other's transmissions to code the packets in such a way to increase every user throughputs. Both theoretical analysis and simulation results show a significant throughput gain when using the proposed NC protocol over the standard ARQ protocol. Second, we propose a NC-based packet scheduler at a wireless base station for delivering multimedia streams, particularly scalable video streams to multiple users in a wireless access network. We formulate the NC-based packet scheduler problem in the framework of Markov Decision Process (MDP) in which, packet delay, inter-dependency of packets, and different visual contributions of packet types are taken into account, to optimize for the overall visual qualities. We describe an optimal scheduler for transmitting scalable video streams to a small number of users. For a large number of users, we propose a heuristic, simulation-based… Advisors/Committee Members: Nguyen, Thinh (advisor), Lee, Ben (committee member).

Subjects/Keywords: Network Coding; IEEE 802.11 (Standard)

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Nguyen, D. V. (2009). Network coding for multi-user wireless networks. (Doctoral Dissertation). Oregon State University. Retrieved from http://hdl.handle.net/1957/12003

Chicago Manual of Style (16^th Edition):

Nguyen, Dong Van. “Network coding for multi-user wireless networks.” 2009. Doctoral Dissertation, Oregon State University. Accessed January 18, 2021. http://hdl.handle.net/1957/12003.

MLA Handbook (7^th Edition):

Nguyen, Dong Van. “Network coding for multi-user wireless networks.” 2009. Web. 18 Jan 2021.

Vancouver:

Nguyen DV. Network coding for multi-user wireless networks. [Internet] [Doctoral dissertation]. Oregon State University; 2009. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/1957/12003.

Council of Science Editors:

Nguyen DV. Network coding for multi-user wireless networks. [Doctoral Dissertation]. Oregon State University; 2009. Available from: http://hdl.handle.net/1957/12003

Universiteit Utrecht

30. Hendriks, Matthijs. Auditieve woordverwerving en multimedia.

Degree: 2007, Universiteit Utrecht

URL: http://dspace.library.uu.nl:8080/handle/1874/25664

► De invloed van multimedia in het huidige onderwijssysteem neemt de laatste jaren sterk toe. Dit biedt veel nieuwe mogelijkheden in het lesprogramma, maar de effectiviteit… (more)

Subjects/Keywords: Letteren; woordverwerving; dual coding

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Hendriks, M. (2007). Auditieve woordverwerving en multimedia. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/25664

Chicago Manual of Style (16^th Edition):

Hendriks, Matthijs. “Auditieve woordverwerving en multimedia.” 2007. Masters Thesis, Universiteit Utrecht. Accessed January 18, 2021. http://dspace.library.uu.nl:8080/handle/1874/25664.

MLA Handbook (7^th Edition):

Hendriks, Matthijs. “Auditieve woordverwerving en multimedia.” 2007. Web. 18 Jan 2021.

Vancouver:

Hendriks M. Auditieve woordverwerving en multimedia. [Internet] [Masters thesis]. Universiteit Utrecht; 2007. [cited 2021 Jan 18]. Available from: http://dspace.library.uu.nl:8080/handle/1874/25664.

Council of Science Editors:

Hendriks M. Auditieve woordverwerving en multimedia. [Masters Thesis]. Universiteit Utrecht; 2007. Available from: http://dspace.library.uu.nl:8080/handle/1874/25664

Open Access Theses and Dissertations