Results 231 to 240 of about 90,302 (257)
MDS, Hermitian almost MDS, and Gilbert-Varshamov quantum codes from generalized monomial-Cartesian codes. [PDF]
Quantum Inf ProcessBarbero-Lucas B +3 more
europepmc +1 more source
Denoising pediatric cardiac photon-counting CT data with sparse coding and data-adaptive, self-supervised deep learning. [PDF]
Med PhysClark DP, Cao JY, Badea CT.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Self-Orthogonality Matrix and Reed-Muller Codes
IEEE Transactions on Information Theory, 2022zbMATH 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, 2023A 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 +3 more
openaire +2 more sources
Hybrid block- self-orthogonal convolutional codes
IEEE Transactions on Information Theory, 1972Summary: 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
2022A 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 +1 more
openaire +2 more sources
Self-orthogonal quasi-cyclic codes
IEEE Transactions on Information Theory, 1967A 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. +1 more
openaire +2 more sources
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
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, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gao, Yanyan, Yue, Qin, Wu, Yansheng
openaire +1 more source
Extended maximal self-orthogonal codes
Discrete Mathematics, Algorithms and Applications, 2019Self-dual and maximal self-orthogonal codes over [Formula: see text], where [Formula: see text] is even or [Formula: see text](mod 4), are extensively studied in this paper. We prove that every maximal self-orthogonal code can be extended to a self-dual code as in the case of binary Golay code.
openaire +1 more source