Results 201 to 210 of about 415,790 (230)

Moderation between resting-state connectivity and brain amyloid levels on speed of cognitive and physical function in older adults: Evidence for network-based cognitive reserve. [PDF]

Apert Neuro
Laurienti PJ, Kritchevsky SB, Lyday RG, Tomlinson CE, Miller ME, Lockhart SN, Rundle MM, Hugenschmidt CE, Burdette JH, Shappell HM, Chen H, Baker LD, Neyland BR, Holtzer R.   +13 more
europepmc   +1 more source

The Dynamic Connection Layer (DCL): Enhancing Topological Representation in Chemical Graph Neural Networks. [PDF]

ACS Omega
Zhang W, Pearson J.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

On the symbol-pair distance of some classes of repeated-root constacyclic codes over Galois ring

Applicable Algebra in Engineering, Communication and Computing, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dinh, Hai Q., Kumar, Narendra, Singh, Abhay Kumar, Singh, Manoj Kumar, Gupta, Indivar, Maneejuk, Paravee   +5 more
openaire   +2 more sources

Symbol-pair distance of some repeated-root constacyclic codes of length $$p^s$$ over the Galois ring $${{\,\mathrm{GR}\,}}(p^a,m)$$

Applicable Algebra in Engineering, Communication and Computing, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dinh, Hai Q., Kewat, Pramod Kumar, Mondal, Nilay Kumar   +2 more
openaire   +2 more sources

On the Symbol-Pair Distance of Repeated-Root Constacyclic Codes of Prime Power Lengths

IEEE Transactions on Information Theory, 2018
Let $p$ be a prime, and $\lambda$ be a nonzero element of the finite field $\mathbb F_{p^{m}}$ . The $\lambda$ -constacyclic codes of length $p^{s}$ over $\mathbb F_{p^{m}}$ are linearly ordered under set-theoretic inclusion, i.e., they are the ideals $\langle (x-\lambda _{0})^{i} \rangle$ , $0 \leq i \leq p^{s}
Hai Q. Dinh, Bac Trong Nguyen, Abhay Kumar Singh, Songsak Sriboonchitta   +3 more
openaire   +2 more sources

Symbol-Pair Distances of Repeated-Root Negacyclic Codes of Length 2s over Galois Rings

Algebra Colloquium, 2021
Negacyclic codes of length [Formula: see text] over the Galois ring [Formula: see text] are linearly ordered under set-theoretic inclusion, i.e., they are the ideals [Formula: see text], [Formula: see text], of the chain ring [Formula: see text]. This structure is used to obtain the symbol-pair distances of all such negacyclic codes. Among others, for
Hai Q. Dinh, Hualu Liu, Roengchai Tansuchat, Thang M. Vo   +3 more
openaire   +2 more sources

On symbol-pair distances of repeated-root constacyclic codes of length $$2p^s$$ over $${\mathbb {F}}_{p^m}+u{\mathbb {F}}_{p^m}$$ and MDS symbol-pair codes

Applicable Algebra in Engineering, Communication and Computing, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dinh, Hai Q., Singh, Abhay Kumar, Thakur, Madhu Kant   +2 more
openaire   +3 more sources

On the Hamming and Symbol-Pair Distance of Constacyclic Codes of Length $$p^s$$ over $$\mathbb {F}_{p^m}+ u\mathbb {F}_{p^m}$$

International Conference on Advanced Communication Systems and Information Security, 2020
Let \(\mathcal {R}=\mathbb {F}_{p^m}+ u\mathbb {F}_{p^m}, u^2=0 \), be the finite commutative chain ring with unity, where p is a prime number, m is a positive integer and \(\mathbb {F}_{p^m}\) is the finite field with \(p^m\) elements. In this work, we give a simple and short proof of classification of all \( \gamma \)-constacyclic codes of length \(p^
Jamal Laaouine
openaire   +2 more sources

Improvement on Minimum Distance of Symbol-Pair Codes

IMA Conference on Cryptography and Coding, 2017
Symbol-pair codes were first introduced by Cassuto and Blaum (2010). The minimum pair distance of a code is a criterion that characterises the error correcting capability of the code with respect to pair errors. The codes that achieve the optimal minimum pair distance (for given codeword length, code book size and alphabet) are called Maximum Distance ...
Han Zhang
openaire   +2 more sources

Hamming and Symbol-Pair Distances of Repeated-Root Constacyclic Codes of Prime Power Lengths Over <inline-formula> <tex-math notation="LaTeX">$\mathbb F_{p^m}+u\mathbb F_{p^m}$ </tex-math> </inline-formula>

IEEE Communications Letters, 2018
The ring ${\mathcal{ R}}=\mathbb F_{p^{m}}+u\mathbb F_{p^{m}}$ has precisely $p^{m}(p^{m}-1)$ units which are of the forms $\gamma $ and $\alpha +u\beta $ , where $0\neq \alpha,\beta,\gamma \in \mathbb F_{p^{m}}$ .
Hai Q. Dinh, Bac Trong Nguyen, Abhay Kumar Singh, Songsak Sriboonchitta   +3 more
openaire   +2 more sources