Let R be a finite chain ring (e.g. a Galois ring), K its residue field and C a linear code over R. We prove that d(C), the Hamming distance of C, is d((C : α)), where (C : α) is a submodule quotient, α is a certain element of R and denotes the canonical projection to K. These two codes also have the same set of minimal codeword supports. We explicitly construct a generator matrix/polynomial of ...

We present new, eecient algorithms for computations on separable matrix algebras over innnite elds. We provide a probabilistic of the Monte Carlo type to nd a generator for the centre of a given algebra A F mm over an innnite eld F using a number of operations that is within a logarithmic factor of the cost of solving m m systems of linear equations. A Las Vegas algorithm is also provided under...

This paper introduces a method to generate efficient vectorized implementations of small stride permutations using only vector load and vector shuffle instructions. These permutations are crucial for highperformance numerical kernels including the fast Fourier transform. Our generator takes as input only the specification of the target platform’s SIMD vector ISA and the desired permutation. The...

We compute the minimal log discrepancies of determinantal varieties square matrices, and more generally pairs (Dk,∑αiDki) consisting a variety (of matrices) an R-linear sum subvarieties. Our result implies semicontinuity conjecture for such pairs. For these computations, we use description via codimensions cylinders in space jets; this necessitates computations explicit generator canonical diff...

Market based valuation of generation assets is a critical problem in competitive power markets. Previous approaches to this problem has included modeling the cash flow from a generator as a spread option between electricity and fuel prices, which ignores the effect of flexibility and startup costs. Simulation based approaches with full unit commitment constraint have been presented, but they ar...

Ding et al [DNRS97] propose a stream generator based on several layers. We present several attacks. First, we observe that the non-surjectivity of a linear combination step allows us to recover half the key with minimal effort. Next, we show that the various bytes are insufficiently mixed by these layers, enabling an attack similar to those on two-loop Vigenere ciphers to recover the remainder ...

In this document we develop a non-linear, stochastic and integer model for the problem of determining the optimal hourly schedule of power generation in a hydrothermal power system. We consider a power generation system comprising thermal and hydro units and the problem concerns the scheduling of operation levels for all power units and considering the hydro constrains, such that the operation ...

We introduce generator blocking sets of finite classical polar spaces. These sets are a generalisation of maximal partial spreads. We prove a characterization of these minimal sets of the polar spaces Q(2n, q), Q(2n + 1, q) and H(2n, q), in terms of cones with vertex a subspace contained in the polar space and with base a generator blocking set in a polar space of rank 2. keywords: partial spre...

In today‟s world everyday a new technology which is faster, smaller and more complex than its predecessor is being developed. Reversible computation is a research area characterized by having only computational models that is both forward and backward deterministic. Reversible Logic is gaining significant consideration as the potential logic design style for implementation in modern nanotechnol...

Urban and road planners must take right decisions related to urban traffic management and controlling noise pollution. Their assessments and resolutions have important consequences on the annoyance of population exposed to road-traffic-noise and controlling other environmental pollutants (e.g. NOx or ultrafine particles emitted by heavy vehicles). One of the key decisions is the selection of wh...