Generator Matrix Based Search for Extremal Self-Dual Binary Error-Correcting Codes

Self-dual doubly even linear binary error-correcting codes, often referred to as Type II codes, are codes closely related to many combinatorial structures such as 5-designs. Extremal codes are codes that have the largest possible minimum distance for a given length and dimension. The existence of an extremal (72,36,16) Type II code is still open. Previous results show that the automorphism group of a putative code C with the aforementioned properties has order 5 or dividing 24. In this work, we present a method and the results of an exhaustive search showing that such a code C cannot admit an automorphism group Z6. In addition, we present so far unpublished construction of the extended Golay code by P. Becker. We generalize the notion and provide example of another Type II code that can be obtained in this fashion. Consequently, we relate Becker's construction to the construction of binary Type II codes from codes over GF(2^r) via the Gray map.

Relating propelinear and binary G-linear codes

In this paper we establish the connections between two different extensions of Z(4)-linearity for binary Hamming spaces, We present both notions - propelinearity and G-linearity - in the context of isometries and group actions, taking the viewpoint of geometrically uniform codes extended to discrete spaces. We show a double inclusion relation: binary G-linear codes are propelinear codes, and translation-invariant propelinear codes are G-linear codes. (C) 2002 Elsevier B.V. B.V. All rights reserved.

Synthesis and properties of branched polyethylene/high-density polyethylene blends using a homogeneous binary catalyst system composed of early and late transition metal complexes

Branched polyethylene/high-density polyethylene blends (BPE/HDPE) with a wide range of molecular weights, melt flow indexes (MFI), and intrinsic viscosity were prepared using the homogeneous binary catalyst system composed by Ni(alpha-diimine)Cl-2 (1) (alpha-diimine = 1,4-bis(2,6-diisopropylphenyl)-acenaphthenediimine) and {Tp(Ms*)} TiCl3 (2) (Tp(Ms*)=hydridobis(3-mesitylpyrazol-1-yl)(5-mesityl-pyrazol-1-yl)) activated with MAO and/or TIBA in hexane at two different polymerization temperatures (30 and 55 degreesC) and by varying the nickel loading molar fraction (x(Ni)). At all Temperatures, a non-linear correlation between the x(Ni) and the productivity was observed, suggesting the occurrence of a synergistic effect between the nickel and the titanium catalyst precursors, which is more pronounced at 55 degreesC. The molecular weight of the BPE/HDPE blends considerably decreases with increasing Al/M molar ratio. The melt flow indexes (MFI) and intrinsic viscosities (eta) are strongly affected by x(Ni), but the melting temperatures are nearly constant, 132 +/- 3 degreesC. Dynamic mechanical thermal analysis (DMTA) shows the formation of different polymeric materials where the stiffness vanes according, to the x(Ni) and temperature used in the polymerization reaction. The surface morphology of the BPE/HDPE blends studied by scanning electron microscopy (SEM) revealed a low miscibility between the PE phases resulting in the formation of a sandwich structure after etching with o-xylene.

Genetic Algorithms (Binary and Real Codes) for the Optimisation of a Fermentation Process for Butanol Production

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

The cultural industry and new codes of modernity

Includes bibliography

Weight vs magnetization enumerator for Gallager codes

We propose a method to determine the critical noise level for decoding Gallager type low density parity check error correcting codes. The method is based on the magnetization enumerator (¸M), rather than on the weight enumerator (¸W) presented recently in the information theory literature. The interpretation of our method is appealingly simple, and the relation between the different decoding schemes such as typical pairs decoding, MAP, and finite temperature decoding (MPM) becomes clear. Our results are more optimistic than those derived via the methods of information theory and are in excellent agreement with recent results from another statistical physics approach.

A hierarchy of phase transitions in optimal neuronal coding:from binary to M-ary discrete optimal codes

We have investigated how optimal coding for neural systems changes with the time available for decoding. Optimization was in terms of maximizing information transmission. We have estimated the parameters for Poisson neurons that optimize Shannon transinformation with the assumption of rate coding. We observed a hierarchy of phase transitions from binary coding, for small decoding times, toward discrete (M-ary) coding with two, three and more quantization levels for larger decoding times. We postulate that the presence of subpopulations with specific neural characteristics could be a signiture of an optimal population coding scheme and we use the mammalian auditory system as an example.

Some MDS Codes over Gf(64) Connected with the Binary Doubly-Even [72,36,16] Code

* The author is supported by a Return Fellowship from the Alexander von Humboldt Foundation.

On the Weight Distribution of the Coset Leaders of Constacyclic Codes

Constacyclic codes with one and the same generator polynomial and distinct length are considered. We give a generalization of the previous result of the first author [4] for constacyclic codes. Suitable maps between vector spaces determined by the lengths of the codes are applied. It is proven that the weight distributions of the coset leaders don’t depend on the word length, but on generator polynomials only. In particular, we prove that every constacyclic code has the same weight distribution of the coset leaders as a suitable cyclic code.

Minimal Codewords in Linear Codes

2000 Mathematics Subject Classification: 94B05, 94B15.

The role of vision in obese and normal-weight children's gait control

Previous research has suggested that perceptual-motor difficulties may account for obese children's lower motor competence; however, specific evidence is currently lacking. Therefore, this study examined the effect of altered visual conditions on spatiotemporal and kinematic gait parameters in obese versus normal-weight children. Thirty-two obese and normal-weight children (11.2 ± 1.5 years) walked barefoot on an instrumented walkway at constant self-selected speed during LIGHT and DARK conditions. Three-dimensional motion analysis was performed to calculate spatiotemporal parameters, as well as sagittal trunk segment and lower extremity joint angles at heel-strike and toe-off. Self-selected speed did not significantly differ between groups. In the DARK condition, all participants walked at a significantly slower speed, decreased stride length, and increased stride width. Without normal vision, obese children had a more pronounced increase in relative double support time compared to the normal-weight group, resulting in a significantly greater percentage of the gait cycle spent in stance. Walking in the DARK, both groups showed greater forward tilt of the trunk and restricted hip movement. All participants had increased knee flexion at heel-strike, as well as decreased knee extension and ankle plantarflexion at toe-off in the DARK condition. The removal of normal vision affected obese children's temporal gait pattern to a larger extent than that of normal-weight peers. Results suggest an increased dependency on vision in obese children to control locomotion. Next to the mechanical problem of moving excess mass, a different coupling between perception and action appears to be governing obese children's motor coordination and control.

Dynamic texture reconstruction from sparse codes for unusual event detection in crowded scenes

Unusual event detection in crowded scenes remains challenging because of the diversity of events and noise. In this paper, we present a novel approach for unusual event detection via sparse reconstruction of dynamic textures over an overcomplete basis set, with the dynamic texture described by local binary patterns from three orthogonal planes (LBPTOP). The overcomplete basis set is learnt from the training data where only the normal items observed. In the detection process, given a new observation, we compute the sparse coefficients using the Dantzig Selector algorithm which was proposed in the literature of compressed sensing. Then the reconstruction errors are computed, based on which we detect the abnormal items. Our application can be used to detect both local and global abnormal events. We evaluate our algorithm on UCSD Abnormality Datasets for local anomaly detection, which is shown to outperform current state-of-the-art approaches, and we also get promising results for rapid escape detection using the PETS2009 dataset.