Bartolomeu F. Uchôa Filho

Learn More
In this paper, we propose and analyze a generalized construction of distributed network codes for a network consisting of M users sending independent information to a common base station through independent block fading channels. The aim is to increase the diversity order of the system without reducing its throughput. The proposed scheme, called generalized(More)
In this work, we propose and analyze a generalized construction of distributed network codes for a network consisting of M users sending different information to a common base station through independent block fading channels. The aim is to increase the diversity order of the system without reducing its code rate. The proposed scheme, called generalized(More)
In this work, we propose and analyze a construction of adaptive network codes for a multiple access network under independent block-fading assumption. We aim to increase the system average transmission rate of the recently proposed generalized dynamic-network codes (GDNC) without reducing its diversity order, making use of a small amount of information fed(More)
In this paper, we consider a wireless-powered cooperative communication network consisting of one hybrid access-point (AP), one source, and one relay. In contrast to conventional cooperative networks, the source and relay in the considered network have no embedded energy supply. They need to rely on the energy harvested from the signals broadcasted by the(More)
The multiplicative-additive finite-field matrix channel arises as an adequate model for linear network coding systems when links are subject to errors and erasures, and both the network topology and the network code are unknown. In a previous work we proposed a general construction of multishot codes for this channel based on the multilevel coding theory.(More)
This paper deals with the multiplicative finite-field matrix channel, a discrete memoryless channel whose input and output are matrices (over a finite field) related by a multiplicative transfer matrix. The model considered here assumes that all transfer matrices with the same rank are equiprobable, so that the channel is completely characterized by the(More)
In this paper, we consider noncoherent random linear coding networks (RLCNs) as a discrete memoryless channel (DMC) whose input and output alphabets consist of subspaces. This contrasts with previous channel models in the literature which assume matrices as the channel input and output. No particular assumptions are made on the network topology or the(More)
The performance and complexity of turbo decoding using rate k/n constituent codes are investigated. The conventional, minimal and sectionalized trellis modules of the constituent convolutional codes are utilized. The performance metric is the bit error rate (BER), while complexity is analyzed based on the number of multiplications, summations and(More)
The process of adding high-density information onto printed material enables and improves interesting hardcopy document applications, such as: security, authentication, physical-electronic round tripping, item-level tagging as well as consumer/product interaction. This investigation on robust and high capacity print codes aims to maximize information(More)