Results 71 to 80 of about 29,101,112 (306)
Optimal rate list decoding via derivative codes
, 2011 The classical family of $[n,k]_q$ Reed-Solomon codes over a field $\F_q$ consist of the evaluations of polynomials $f \in \F_q[X]$ of degree $< k$ at $n$ distinct field elements. In this work, we consider a closely related family of codes, called (order $
Carol Wang +3 more
core +3 more sources
A polymatroid approach to generalized weights of rank metric codes [PDF]
Designs, Codes and Cryptography, 2019 We consider the notion of a (q, m)-polymatroid, due to Shiromoto, and the more general notion of (q, m)-demi-polymatroid, and show how generalized weights can be defined for them. Further, we establish a duality for these weights analogous to Wei duality
S. Ghorpade, T. Johnsen
semanticscholar +1 more source
Molecular bases of circadian magnesium rhythms across eukaryotes
FEBS Letters, EarlyView.Circadian rhythms in intracellular [Mg2+] exist across eukaryotic kingdoms. Central roles for Mg2+ in metabolism suggest that Mg2+ rhythms could regulate daily cellular energy and metabolism. In this Perspective paper, we propose that ancestral prokaryotic transport proteins could be responsible for mediating Mg2+ rhythms and posit a feedback model ...
Helen K. Feord, Gerben van Ooijen
wiley +1 more source
Доклады Белорусского государственного университета информатики и радиоэлектроникиAnalytical relations and a methodology for calculating the performance indicators of communication and multimedia broadcasting systems using multi-position modulation types (QAM-M, FM-M, FM-M, CHMS-M, AM-M, OFM-M) and multi-stage coding based on non ...
E. B. Lipkovich, V. V. Rabtsevich
doaj +1 more source
Repeated-Root Constacyclic Codes Over the Chain Ring Fpm[u]/⟨u3⟩
IEEE Access, 2020 Let Z = Fpm[u]/(u3) be the finite commutative chain ring, where p is a prime, m is a positive integer and Fpm is the finite field with pm elements. In this paper, we determine all repeated-root constacyclic codes of arbitrary lengths over Z and their ...
Tania Sidana, Anuradha Sharma
doaj +1 more source
Higher-Dimensional Quantum Hypergraph-Product Codes with Finite Rates. [PDF]
Physical Review Letters, 2018 We describe a family of quantum error-correcting codes which generalize both the quantum hypergraph-product codes by Tillich and Zémor and all families of toric codes on m-dimensional hypercubic lattices.
Weilei Zeng, L. Pryadko
semanticscholar +1 more source
Crosstalk between the ribosome quality control‐associated E3 ubiquitin ligases LTN1 and RNF10
FEBS Letters, EarlyView.Loss of the E3 ligase LTN1, the ubiquitin‐like modifier UFM1, or the deubiquitinating enzyme UFSP2 disrupts endoplasmic reticulum–ribosome quality control (ER‐RQC), a pathway that removes stalled ribosomes and faulty proteins. This disruption may trigger a compensatory response to ER‐RQC defects, including increased expression of the E3 ligase RNF10 ...
Yuxi Huang +8 more
wiley +1 more source
On the Performance of Reed-Muller Codes with respect to Random Errors and Erasures [PDF]
ACM-SIAM Symposium on Discrete Algorithms, 2018 This work proves new results on the ability of binary Reed-Muller codes to decode from random errors and erasures. We obtain these results by proving improved bounds on the weight distribution of Reed-Muller codes of high degrees.
Ori Sberlo, Amir Shpilka
semanticscholar +1 more source
Peptide‐based ligand antagonists block a Vibrio cholerae adhesin
FEBS Letters, EarlyView.The structure of a peptide‐binding domain of the Vibrio cholerae adhesin FrhA was solved by X‐ray crystallography, revealing how the inhibitory peptide AGYTD binds tightly at its Ca2+‐coordinated pocket. Structure‐guided design incorporating D‐amino acids enhanced binding affinity, providing a foundation for developing anti‐adhesion therapeutics ...
Mingyu Wang +9 more
wiley +1 more source
Proceedings Mathematical Sciences, 2001 Let \(q\) be an odd prime power, \(\mathbb{F}_q\) the finite field of order \(q\), \(m\) a positive integer, and \(R= \mathbb{F}_q[X]/(X^{2^m}-1)\). The author shows that the following \(m+1\) elements of \(R\) are idempotents, \[ e_0(X):=2^{-m}\sum_{j=0}^{2^m-1}X^j, \qquad e_i(X):=2^{i-m-1}\left(1+\sum_{k=i+1}^m S_k(X)-S_i(X)\right) \] for \(1\leq i ...
openaire +1 more source