Learn More
We generalize the notion of cyclic codes by using generator poly-nomials in (non commutative) skew polynomial rings. Since skew polynomial rings are left and right euclidean, the obtained codes share most properties of cyclic codes. Since there are much more skew-cyclic codes, this new class of codes allows to systematically search for codes with good(More)
The major neuronal post-translational modification of tubulin, polyglutamylation, can act as a molecular potentiometer to modulate microtubule-associated proteins (MAPs) binding as a function of the polyglutamyl chain length. The relative affinity of Tau, MAP2, and kinesin has been shown to be optimal for tubulin modified by approximately 3 glutamyl units.(More)
We generalize the construction of linear codes via skew polynomial rings by using Galois rings instead of finite fields as coefficients. The resulting non commutative rings are no longer left and right Euclidean. Codes that are principal ideals in quotient rings of skew polynomial rings by a two sided ideals are studied. As an application, skew constacyclic(More)
In [4], starting from an automorphism θ of a finite field F q and a skew polynomial ring R = F q [X; θ], module θ-codes are defined as left R-submodules of R/Rf where f ∈ R. In [4] it is conjectured that an Euclidean self-dual module θ-code is a θ-constacyclic code and a proof is given in the special case when the order of θ divides the length of the code.(More)
Interaction of rat kinesin and Drosophila nonclaret disjunctional motor domains with tubulin was studied by a blot overlay assay. Either plus-end or minus-end-directed motor domain binds at the same extent to both alpha- and beta-tubulin subunits, suggesting that kinesin binding is an intrinsic property of each tubulin subunit and that motor directionality(More)
The aim of t.lIis paper is to flccide whether a liuear tliffer-fmtial equation with polponIia1 coefficients df~pcudiug on piLI?ll~lf~tCrS has got. polymrlial solut.ioIIs. 3lore pref:isclv we want to fwust.rufX il finit.f~ set 2' of nef:fwarp ad suffi&nt dgelxilif' iUld arithmetic: codit icms sudl tllilt t,lwrc is a poly-IIoIiiinl solution if and ouly if(More)
In this work the definition of codes as modules over skew polynomial rings of automorphism type is generalized to skew polynomial rings, whose multiplication is defined using an automorphism and a derivation. This produces a more general class of codes which, in some cases, produce better distance bounds than module skew codes constructed only with an(More)
The construction of cyclic codes can be generalized to so called module θ-cyclic codes using noncommutative polynomials. The product of the generator polynomial g of a self-dual module θ-cyclic code and its " skew reciprocal polynomial " is known to be a noncommu-tative polynomial of the form X n − a, reducing the problem of the computation of all such(More)