Results 71 to 80 of about 223,530 (281)
Subspace Codes Based on Partial Injective Maps of Vector Spaces Over Finite Fields
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
Bounds for certain cyclic an-codes
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
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
Lower Bounds on the Lifting Degree of QC-LDPC Codes by Difference Matrices
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
Gut microbiome and aging—A dynamic interplay of microbes, metabolites, and the immune system
Age‐dependent shifts in microbial communities engender shifts in microbial metabolite profiles. These in turn drive shifts in barrier surface permeability of the gut and brain and induce immune activation. When paired with preexisting age‐related chronic inflammation this increases the risk of neuroinflammation and neurodegenerative diseases.
Aaron Mehl, Eran Blacher
wiley +1 more source
Entropic Bounds on the Average Length of Codes with a Space
We consider the problem of constructing prefix-free codes in which a designated symbol, a space, can only appear at the end of codewords. We provide a linear-time algorithm to construct almost-optimal codes with this property, meaning that their average ...
Roberto Bruno, Ugo Vaccaro
doaj +1 more source
Symmetric Disjunctive List-Decoding Codes
A binary code is said to be a disjunctive list-decoding $s_L$-code (LD $s_L$-code), $s \ge 2$, $L \ge 1$, if the code is identified by the incidence matrix of a family of finite sets in which the union (or disjunctive sum) of any $s$ sets can cover not ...
D'yachkov, Arkadii +3 more
core +1 more source
The Divisible Code Bound Revisited
A linear code over \(\text{GF}(q)\) is called divisible if the weights of its codewords have a common divisor \(\Delta > 1\). If \(\Delta\) is relatively prime to \(q\), the code is essentially a \(\Delta\)-fold replicated code. So the case of interest is when the characteristic \(p\) divides \(\Delta\). The author gives a new, character-free proof for
openaire +1 more source
This study reveals a unique active site enriched in methionine residues and demonstrates that these residues play a critical role by stabilizing carbocation intermediates through novel sulfur–cation interactions. Structure‐guided mutagenesis further revealed variants with significantly altered product profiles, enhancing pseudopterosin formation. These
Marion Ringel +13 more
wiley +1 more source
Reed-Muller codes for random erasures and errors
This paper studies the parameters for which Reed-Muller (RM) codes over $GF(2)$ can correct random erasures and random errors with high probability, and in particular when can they achieve capacity for these two classical channels. Necessarily, the paper
Alon N. +8 more
core +1 more source

