Results 221 to 230 of about 178,102 (268)

Distinct roles of hippocampus and neocortex in symbolic compositional generalization

Liang Z, Glitz L, Hefner MB, Lan D, Klein-Flugge M, Summerfield C.   +5 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Self-Orthogonality Matrix and Reed-Muller Codes

IEEE Transactions on Information Theory, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jon-Lark Kim, Whan-Hyuk Choi
openaire   +2 more sources

Construction of binary self-orthogonal codes

Cryptography and Communications, 2023
A family \(\Delta\subseteq \mathbb{F}_2^m\) is called a simplicial complex if \(u\in\Delta\) and \(v\in \mathbb{F}_2^m\) with \(\operatorname{supp}(v) \subseteq \operatorname{supp}(u)\) imply \(v\in\Delta.\) When \(D = \{g_1, g_2,\ldots, g_n\} \subseteq \mathbb{F}_2^m,\) let \(G\) be the \(m\times n\) matrix \(G = [g_1^T g_2^T \ldots g_n^T],\) then the
Kai, Xiaoshan, Zhang, Jiayuan, Li, Ping, Zhu, Shixin   +3 more
openaire   +2 more sources

Hybrid block- self-orthogonal convolutional codes

IEEE Transactions on Information Theory, 1972
Summary: Two convolutional-code construction schemes that utilize block codes are given. In the first method the generators of a self-orthogonal convolutional code (SOCC) are expanded. The generators of a block code whose block length is longer than that of the SOCC code replace the nonzero blocks of the convolutional code. The zero blocks are extended
Reddy, Sudhakar M., Robinson, John P.
openaire   +1 more source

Weakly -self-orthogonal designs and self- orthogonal codes

2022
A 1-design is weakly -self-orthogonal if all the block intersection numbers gives the same residue modulo . We analyze extensions of the incidence matrix, orbit matrix, and submatrices of orbit matrix of a weakly -self-orthogonal 1-design in order to construct self-orthogonal codes over the field F, ∈ N.
Mikulić Crnković, Vedrana, Traunkar, Ivona   +1 more
openaire   +2 more sources

Self-orthogonal quasi-cyclic codes

IEEE Transactions on Information Theory, 1967
A new class of linear block codes, called self-orthogonal quasi-cyclic codes, is defined. It is shown that the problem of designing these codes is equivalent to the problem of designing disjoint difference sets. As a result, several classes of optimal and near-optimal codes can be constructed analytically and other codes can be found by a computer ...
Townsend, Richard L., Weldon, Edward J. jun.   +1 more
openaire   +2 more sources

Self-orthogonal greedy codes

Designs, Codes and Cryptography, 1996
Greedy codes are obtained by arranging the binary vectors of length \(n\) in some ordering, selecting the first vector for the code and then, preceeding once through the ordering, selecting a vector if it differs in at least \(d\) positions from all previously selected vectors.
openaire   +1 more source

LCD Codes and Self-orthogonal Codes in Finite Dihedral Group Algebras

Chinese Annals of Mathematics, Series B, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gao, Yanyan, Yue, Qin, Wu, Yansheng
openaire   +1 more source