Results 71 to 80 of about 236,875 (314)
We reconstituted Synechocystis glycogen synthesis in vitro from purified enzymes and showed that two GlgA isoenzymes produce glycogen with different architectures: GlgA1 yields denser, highly branched glycogen, whereas GlgA2 synthesizes longer, less‐branched chains.
Kenric Lee +3 more
wiley +1 more source
Linear Repairing Codes and Side-Channel Attacks
To strengthen the resistance of countermeasures based on secret sharing,several works have suggested to use the scheme introduced by Shamir in 1978, which proposes to use the evaluation of a random d-degree polynomial into n ≥ d + 1 public points to ...
Hervé Chabanne +2 more
doaj +1 more source
On the Fan Associated to a Linear Code [PDF]
We will show how one can compute all reduced Gröbner bases with re-spect to a degree compatible ordering for code ideals -even though these binomial ideals are not toric. To this end, the correspondence of linear codes and binomial ideals will be briefly described as well as their resemblance to toric ideals.
Natalia Dück +2 more
openaire +2 more sources
Linear programming bounds for doubly-even self-dual codes
Using a variant of linear programming method we derive a new upper bound on the minimum distance d of doubly-even self-dual codes of length n. Asymptotically, for n growing, it gives d/n
Krasikov, I, Simon Litsyn, Ilia Krasikov
core +1 more source
Tau acetylation at K331 has limited impact on tau pathology in vivo
We mapped tau post‐translational modifications in humanized MAPT knock‐in mice and in amyloid‐bearing double knock‐in mice. Acetylation within the repeat domain, particularly around K331, showed modest increases under amyloid pathology. To test functional relevance, we generated MAPTK331Q knock‐in mice.
Shoko Hashimoto +3 more
wiley +1 more source
Linear codes over a general infinite family of rings and MacWilliams-type relations [PDF]
Irwansyah, Djoko Suprijanto
doaj +1 more source
Squares of Random Linear Codes [PDF]
Given a linear code $C$, one can define the $d$-th power of $C$ as the span of all componentwise products of $d$ elements of $C$. A power of $C$ may quickly fill the whole space. Our purpose is to answer the following question: does the square of a code "typically" fill the whole space?
I. Cascudo (Ignacio) +3 more
openaire +2 more sources
Derives an estimate for the error term in the binomial approximation of spectra of BCH codes. This estimate asymptotically improves on the bounds by Sidelnikov (1971), Kasami et al. (1985), and Sole (1990)
Krasikov, I +3 more
core +1 more source
Reconfigurable rateless codes [PDF]
We propose novel reconfigurable rateless codes, that are capable of not only varying the block length but also adaptively modify their encoding strategy by incrementally adjusting their degree distribution according to the prevalent channel conditions ...
Sheng Chen +7 more
core +1 more source
Structural insights into an engineered feruloyl esterase with improved MHET degrading properties
A feruloyl esterase was engineered to mimic key features of MHETase, enhancing the degradation of PET oligomers. Structural and computational analysis reveal how a point mutation stabilizes the active site and reshapes the binding cleft, expading substrate scope.
Panagiota Karampa +5 more
wiley +1 more source

