Trace Elements in Soils of the South Texas Uranium District: Concentrations, Origin, and Environmental Significance

UT Librarie

Test instrumentation evaluates electrostatic hazards in fluid system

RJ-1 fuel surface potential is measured with a probe to determine the degree of hazard originating from static electricity buildup in the hydraulic fluid. The probe is mounted in contact with the fluid surface and connected to an electrostatic voltmeter

Metamorphic fluids and uplift-erosion history of a portion of the Kapuskasing structural zone, Ontario, as deduced from fluid inclusions

Fluid inclusions can be used to determine the compositional evolution of fluids present in high grade metamorphic rocks (Touret, 1979) along with the general P-T path followed by the rocks during uplift and erosion (Hollister et al., 1979). In this context, samples of high grade gneisses from the Kapuskasing structural zone (KSZ, Fig. 1) of eastern Ontario were studied in an attempt to define the composition of syn- and post-metamorphic fluids and help constrain the uplift and erosion history of the KSZ. Recent work by Percival (1980), Percival and Card (1983) and Percival and Krogh (1983) shows that the KSZ represents lower crustal granulites that form the lower portion of an oblique cross section through the Archean crust, which was up faulted along a northeast striking thrust fault. The present fluid inclusion study places constraints upon the P-T path which the KSZ followed during uplift and erosion

A Rate-Distortion Exponent Approach to Multiple Decoding Attempts for Reed-Solomon Codes

Algorithms based on multiple decoding attempts of Reed-Solomon (RS) codes have recently attracted new attention. Choosing decoding candidates based on rate-distortion (R-D) theory, as proposed previously by the authors, currently provides the best performance-versus-complexity trade-off. In this paper, an analysis based on the rate-distortion exponent (RDE) is used to directly minimize the exponential decay rate of the error probability. This enables rigorous bounds on the error probability for finite-length RS codes and leads to modest performance gains. As a byproduct, a numerical method is derived that computes the rate-distortion exponent for independent non-identical sources. Analytical results are given for errors/erasures decoding.Comment: accepted for presentation at 2010 IEEE International Symposium on Information Theory (ISIT 2010), Austin TX, US

On Multiple Decoding Attempts for Reed-Solomon Codes: A Rate-Distortion Approach

One popular approach to soft-decision decoding of Reed-Solomon (RS) codes is based on using multiple trials of a simple RS decoding algorithm in combination with erasing or flipping a set of symbols or bits in each trial. This paper presents a framework based on rate-distortion (RD) theory to analyze these multiple-decoding algorithms. By defining an appropriate distortion measure between an error pattern and an erasure pattern, the successful decoding condition, for a single errors-and-erasures decoding trial, becomes equivalent to distortion being less than a fixed threshold. Finding the best set of erasure patterns also turns into a covering problem which can be solved asymptotically by rate-distortion theory. Thus, the proposed approach can be used to understand the asymptotic performance-versus-complexity trade-off of multiple errors-and-erasures decoding of RS codes. This initial result is also extended a few directions. The rate-distortion exponent (RDE) is computed to give more precise results for moderate blocklengths. Multiple trials of algebraic soft-decision (ASD) decoding are analyzed using this framework. Analytical and numerical computations of the RD and RDE functions are also presented. Finally, simulation results show that sets of erasure patterns designed using the proposed methods outperform other algorithms with the same number of decoding trials.Comment: to appear in the IEEE Transactions on Information Theory (Special Issue on Facets of Coding Theory: from Algorithms to Networks

Approaching Capacity at High-Rates with Iterative Hard-Decision Decoding

A variety of low-density parity-check (LDPC) ensembles have now been observed to approach capacity with message-passing decoding. However, all of them use soft (i.e., non-binary) messages and a posteriori probability (APP) decoding of their component codes. In this paper, we show that one can approach capacity at high rates using iterative hard-decision decoding (HDD) of generalized product codes. Specifically, a class of spatially-coupled GLDPC codes with BCH component codes is considered, and it is observed that, in the high-rate regime, they can approach capacity under the proposed iterative HDD. These codes can be seen as generalized product codes and are closely related to braided block codes. An iterative HDD algorithm is proposed that enables one to analyze the performance of these codes via density evolution (DE).Comment: 22 pages, this version accepted to the IEEE Transactions on Information Theor