Results 81 to 90 of about 236,875 (314)
A Multisecret-Sharing Scheme Based on LCD Codes
Mathematics, 2020 Secret sharing is one of the most important cryptographic protocols. Secret sharing schemes (SSS) have been created to that end. This protocol requires a dealer and several participants.
Adel Alahmadi +5 more
doaj +1 more source
, 2011 The performance of a novel fountain coding scheme based on maximum distance separable (MDS) codes constructed over Galois fields of order q is investigated. Upper and lower bounds on the decoding failure probability under maximum likelihood decoding are
Lázaro Blasco, Francisco +3 more
core +1 more source
On the generalization of the construction of quantum codes from Hermitian self-orthogonal codes
, 2021 Many $q$-ary stabilizer quantum codes can be constructed from Hermitian self-orthogonal $q^2$-ary linear codes. This result can be generalized to $q^{2 m}$-ary linear codes, $m > 1$.
Galindo, Carlos, Hernando, Fernando
core +1 more source
Gut microbiome and aging—A dynamic interplay of microbes, metabolites, and the immune system
FEBS Letters, EarlyView.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
Ternary Linear Codes and Quadrics [PDF]
The Electronic Journal of Combinatorics, 2009 For an $[n,k,d]_3$ code ${\cal C}$ with $gcd(d,3)=1$, we define a map $w_G$ from $\Sigma={\rm PG}(k-1,3)$ to the set of weights of codewords of ${\cal C}$ through a generator matrix $G$. A $t$-flat $\Pi$ in $\Sigma$ is called an $(i,j)_t$ flat if $(i,j)=(|\Pi \cap F_0|,|\Pi \cap F_1|)$, where $F_0 = \{P \in \Sigma | w_G(P) \equiv 0 \pmod{3 ...
Yuri Yoshida, Tatsuya Maruta
openaire +2 more sources
FEBS Letters, EarlyView.Biomolecular condensates formed by fused in sarcoma (FUS) are dissolved by high ATP concentrations yet persist in cells. Using a reconstituted system, we demonstrate that valosin‐containing protein (VCP), an AAA+ ATPase, counteracts ATP‐driven dissolution of FUS condensates through its D2 ATPase activity.
Hitomi Kimura +2 more
wiley +1 more source
Quasi-cyclic Generalized LDPC codes with low error floors
, 2008 In this paper, a novel methodology for designing structured generalized LDPC (G-LDPC) codes is presented. The proposed design results in quasi-cyclic G-LDPC codes for which efficient encoding is feasible through shift-register-based circuits.
Ryan, William E. +6 more
core +1 more source
Diversity and complexity in neural organoids
FEBS Letters, EarlyView.Neural organoid research aims to expand genetic diversity on one side and increase tissue complexity on the other. Chimeroids integrate multiple donor genomes within single organoids. Self‐organising multi‐identity organoids, exogenous cell seeding, or enforced assembly of region‐specific organoids contribute to tissue complexity.
Ilaria Chiaradia, Madeline A. Lancaster
wiley +1 more source
Low-Floor Tanner Codes via Hamming-Node or RSCC-Node Doping
, 2006 We study the design of structured Tanner codes with low error-rate floors on the AWGN channel. The design technique involves the “doping” of standard LDPC (proto-)graphs, by which we mean Hamming or recursive systematic convolutional (RSC) code ...
Ryan, William E. +5 more
core +1 more source
Non-linear maximum rank distance codes [PDF]
, 2016 By exploring some geometry of Segre varieties and Veronese varieties, new families of non linear maximum rank distance codes and optimal constant rank codes are ...
Pavese, Francesco +2 more
core +1 more source