Results 71 to 80 of about 16,644 (310)
Modulation of Homer1 EVH1 domain internal dynamics by putative autism‐associated mutations
FEBS 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
Low-complexity trellis decoding of linear block codes. [PDF]
, 1995 The authors introduce a new simple encoding technique which allows the design of a wide variety of linear block codes. They present a number of examples in which the most widely used codes (Reed-Muller, Hamming, Golay, optimum etc.) have been designed ...
Markarian, G. S. +2 more
core
On the accuracy of the binomial approximation to the distance distribution of codes
, 1995 The binomial distribution is a well-known approximation to the distance spectra of many classes of codes.
Krasikov, I, Litsyn, S
core +1 more source
Stabilizer Codes and Quantum Error Correction [PDF]
, 1997 Controlling operational errors and decoherence is one of the major challenges facing the field of quantum computation and other attempts to create specified many-particle entangled states.
Daniel Gottesman, Gottesman, Daniel Eric
core +1 more source
New upper bounds on separating codes
, 2017 Separating codes, initially introduced to test automaton, has been revived lately in the study of fingerprinting codes, which are used for copyright protection.
Schaathun, Hans Georg, Cohen, Gerard
core +2 more sources
Subspace Codes Based on Partial Injective Maps of Vector Spaces Over Finite Fields
IEEE Access, 2020 Subspace codes are widely used in error corrections of random network coding. In this article, subspace codes based on partial injective maps of vector spaces over finite fields are considered. Several bounds of the subspace codes (n, M, 2b, e)q based on
Hong-Li Wang, Gang Wang, You Gao
doaj +1 more source
The ubiquitin‐proteasome system and autophagy as guardians of the cellular proteome
FEBS 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
Flat tori, lattices and bounds for commutative group codes
, 2008 We show that commutative group spherical codes in R(n), as introduced by D. Slepian, are directly related to flat tori and quotients of lattices. As consequence of this view, we derive new results on the geometry of these codes and an upper bound for ...
SIQUEIRA, Rogerio M. +3 more
core +1 more source
Lower Bounds on the Lifting Degree of QC-LDPC Codes by Difference Matrices
IEEE Access, 2018 In this paper, we define two “difference matrices” which correspond to an exponent matrix. We present necessary and sufficient conditions for these difference matrices to have quasi-cyclic low-density parity-check codes (QC-LDPC) codes with
Farzane Amirzade, Mohammad-Reza Sadeghi
doaj +1 more source
Bounds for certain cyclic an-codes
Information and Control, 1973 For an odd integer B 0 mod(3) and for a cyclotomic coset C of integers modulo B having the property: if r ε C, then B — r ε C; the number of integers which belong to C and to the half-open interval (B/3, 2B/3 is lower bounded. This result is then used to obtain a lower bound on the minimum arithmetic distance of a cyclic AN-code with generator A and ...
openaire +2 more sources