Results 81 to 90 of about 8,529,401 (324)

Degradation mechanism of the von Willebrand factor A2 domain by nattokinase

open access: yesFEBS Letters, EarlyView.
Nattokinase, a natto‐derived protease, exhibits potent antithrombotic effects. This study demonstrates that nattokinase directly cleaves the von Willebrand factor (vWF) A2 domain in vitro. Unlike the native regulator ADAMTS13, nattokinase degrades folded vWF independently of shear stress.
Ryuichi Hyakumoto   +3 more
wiley   +1 more source

Matrix product codes over finite commutative Frobenius rings

open access: yes, 2014
Properties of matrix product codes over finite commutative Frobenius rings are investigated. The minimum distance of matrix product codes constructed with several types of matrices is bounded in different ways.
Liu, Hongwei, Fan, Yun, Ling, San
core   +1 more source

On Low-Complexity Decoding of Product Codes for High-Throughput Fiber-Optic Systems [PDF]

open access: yesInternational Symposium on Turbo Codes and Iterative Information Processing, 2018
We study low-complexity iterative decoding algorithms for product codes. We revisit two algorithms recently proposed by the authors based on bounded distance decoding (BDD) of the component codes that improve the performance of conventional iterative BDD
Alireza Sheikh   +4 more
semanticscholar   +1 more source

Two-Layer Error Control Codes Combining Rectangular and Hamming Product Codes for Cache Error

open access: yesJournal of Low Power Electronics and Applications, 2014
We propose a novel two-layer error control code, combining error detection capability of rectangular codes and error correction capability of Hamming product codes in an efficient way, in order to increase cache error resilience for many core systems ...
Meilin Zhang, Paul Ampadu
doaj   +1 more source

Twisted tensor product codes [PDF]

open access: yesDesigns, Codes and Cryptography, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Modulation of Homer1 EVH1 domain internal dynamics by putative autism‐associated mutations

open access: yesFEBS Letters, EarlyView.
The putative autism‐associated M65I and S97L variants of the EVH1 domain of the postsynaptic scaffold protein Homer1 do not exhibit substantial changes in their overall structure or partner binding. Both of them, but especially the M65I variant, show altered internal dynamics relative to the wild‐type domain on the μs‐ms timescale, indicated by the ...
Fanni Farkas   +6 more
wiley   +1 more source

On cyclic product codes

open access: yes, 1993
It is known that when the blocklengths of two cyclic codes are relatively prime their product code is cyclic when serialized using Chinese Remainder Theorem.
Rajan, B. S.
core   +1 more source

Targeted Clifford logical gates for hypergraph product codes [PDF]

open access: yesQuantum
Starting with an explicit framework for designing logical Clifford circuits for CSS codes, we construct logical gates for Hypergraph Product Codes. We first derive symplectic matrices for CNOT, CZ, Phase, and Hadamard operators, which together generate ...
Adway Patra, Alexander Barg
doaj   +1 more source

The ubiquitin‐proteasome system and autophagy as guardians of the cellular proteome

open access: yesFEBS Letters, EarlyView.
This Perspective covers the three principles governing the crosstalk between the ubiquitin‐proteasome system and autophagy in cellular proteostasis: (1) a shared ubiquitin code routing substrates via shuttle factors or autophagy receptors; (2) spatial compartmentalization into phase‐separated degradation hubs and organelle‐specific modules (exemplified
Ivan Dikic
wiley   +1 more source

Rate compatible shortened turbo product codes

open access: yes, 2006
International audienceIn this paper, we propose a set of design criteria of constructing shortened turbo product codes. Based on the criteria, we design two families of rate-compatible turbo product codes. The performance of rate-compatible turbo product
Feng, Dongning   +2 more
core   +1 more source

Home - About - Disclaimer - Privacy