Coding Theory and Algebraic Combinatorics

This chapter introduces and elaborates on the fruitful interplay of coding theory and algebraic combinatorics, with most of the focus on the interaction of codes with combinatorial designs, finite geometries, simple groups, sphere packings, kissing numbers, lattices, and association schemes. In particular, special interest is devoted to the relationship between codes and combinatorial designs. We describe and recapitulate important results in the development of the state of the art. In addition, we give illustrative examples and constructions, and highlight recent advances. Finally, we provide a collection of significant open problems and challenges concerning future research.Comment: 33 pages; handbook chapter, to appear in: "Selected Topics in Information and Coding Theory", ed. by I. Woungang et al., World Scientific, Singapore, 201

Analysis of the Gas Core Actinide Transmutation Reactor (GCATR)

Design power plant studies were carried out for two applications of the plasma core reactor: (1) As a breeder reactor, (2) As a reactor able to transmute actinides effectively. In addition to the above applications the reactor produced electrical power with a high efficiency. A reactor subsystem was designed for each of the two applications. For the breeder reactor, neutronics calculations were carried out for a U-233 plasma core with a molten salt breeding blanket. A reactor was designed with a low critical mass (less than a few hundred kilograms U-233) and a breeding ratio of 1.01. The plasma core actinide transmutation reactor was designed to transmute the nuclear waste from conventional LWR's. The spent fuel is reprocessed during which 100% of Np, Am, Cm, and higher actinides are separated from the other components. These actinides are then manufactured as oxides into zirconium clad fuel rods and charged as fuel assemblies in the reflector region of the plasma core actinide transmutation reactor. In the equilibrium cycle, about 7% of the actinides are directly fissioned away, while about 31% are removed by reprocessing

The Gewirtz graph: An exercise in the theory of graph spectra

Graphs;mathematics

Modeling and Analysis of Actinide Diffusion Behavior in Irradiated Metal Fuel

There have been numerous attempts to model fast reactor fuel behavior in the last 40 years. The US currently does not have a fully reliable tool to simulate the behavior of metal fuels in fast reactors. The experimental database necessary to validate the codes is also very limited. The DOE-sponsored Advanced Fuels Campaign (AFC) has performed various experiments that are ready for analysis. Current metal fuel performance codes are either not available to the AFC or have limitations and deficiencies in predicting AFC fuel performance. A modified version of a new fuel performance code, FEAST-Metal , was employed in this investigation with useful results. This work explores the modeling and analysis of AFC metallic fuels using FEAST-Metal, particularly in the area of constituent actinide diffusion behavior. The FEAST-Metal code calculations for this work were conducted at Los Alamos National Laboratory (LANL) in support of on-going activities related to sensitivity analysis of fuel performance codes. A sensitivity analysis of FEAST-Metal was completed to identify important macroscopic parameters of interest to modeling and simulation of metallic fuel performance. A modification was made to the FEAST-Metal constituent redistribution model to enable accommodation of newer AFC metal fuel compositions with verified results. Applicability of this modified model for sodium fast reactor metal fuel design is demonstrated

Uniformity in association schemes and coherent configurations: cometric Q-antipodal schemes and linked systems

Inspired by some intriguing examples, we study uniform association schemes and uniform coherent configurations, including cometric Q-antipodal association schemes. After a review of imprimitivity, we show that an imprimitive association scheme is uniform if and only if it is dismantlable, and we cast these schemes in the broader context of certain --- uniform --- coherent configurations. We also give a third characterization of uniform schemes in terms of the Krein parameters, and derive information on the primitive idempotents of such a scheme. In the second half of the paper, we apply these results to cometric association schemes. We show that each such scheme is uniform if and only if it is Q-antipodal, and derive results on the parameters of the subschemes and dismantled schemes of cometric Q-antipodal schemes. We revisit the correspondence between uniform indecomposable three-class schemes and linked systems of symmetric designs, and show that these are cometric Q-antipodal. We obtain a characterization of cometric Q-antipodal four-class schemes in terms of only a few parameters, and show that any strongly regular graph with a ("non-exceptional") strongly regular decomposition gives rise to such a scheme. Hemisystems in generalized quadrangles provide interesting examples of such decompositions. We finish with a short discussion of five-class schemes as well as a list of all feasible parameter sets for cometric Q-antipodal four-class schemes with at most six fibres and fibre size at most 2000, and describe the known examples. Most of these examples are related to groups, codes, and geometries.Comment: 42 pages, 1 figure, 1 table. Published version, minor revisions, April 201