Results 21 to 30 of about 1,592,361 (298)
Strongly-MDS convolutional codes [PDF]
IEEE Transactions on Information Theory, 2006 33 ...
Heide Gluesing-Luerssen +2 more
openaire +4 more sources
Infinite families of MDS and almost MDS codes from BCH codes
CoRR, 2023 In this paper, the sufficient and necessary condition for the minimum distance of the BCH codes over $\mathbb{F}_q$ with length $q+1$ and designed distance 3 to be 3 and 4 are provided. Let $d$ be the minimum distance of the BCH code $\mathcal{C}_{(q,q+1,3,h)}$. We prove that (1) for any $q$, $d=3$ if and only if $\gcd(2h+1,q+1)>1$; (2) for $q$ odd,
Haojie Xu +3 more
openaire +2 more sources
Generalized Concatenated Codes over Gaussian and Eisenstein Integers for Code-Based Cryptography
Cryptography, 2021 The code-based McEliece and Niederreiter cryptosystems are promising candidates for post-quantum public-key encryption. Recently, q-ary concatenated codes over Gaussian integers were proposed for the McEliece cryptosystem, together with the one-Mannheim ...
Johann-Philipp Thiers +1 more
doaj +1 more source
Application of Constacyclic Codes to Quantum MDS Codes [PDF]
IEEE Transactions on Information Theory, 2015 Quantum maximal-distance-separable (MDS) codes form an important class of quantum codes. To get $q$-ary quantum MDS codes, it suffices to find linear MDS codes $C$ over $\mathbb{F}_{q^2}$ satisfying $C^{\perp_H}\subseteq C$ by the Hermitian construction and the quantum Singleton bound. If $C^{\perp_{H}}\subseteq C$, we say that $C$ is a dual-containing
Bocong Chen, San Ling, Guanghui Zhang
openaire +3 more sources
IEEE Access, 2020 Let p ≠ 3 be any prime. The structures of all λ-constacyclic codes of length 3ps over the finite commutative chain ring Fpm + uFpm (u2 = 0) are established in the term of their generator polynomials.
Hai Q. Dinh +2 more
doaj +1 more source
MDS codes in Doob graphs [PDF]
Problems of Information Transmission, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Evgeny Bespalov, Denis S. Krotov
openaire +4 more sources
Application of Classical Hermitian Self-Orthogonal MDS Codes to Quantum MDS Codes [PDF]
IEEE Transactions on Information Theory, 2010 In this paper, we first construct several classes of classical Hermitian self-orthogonal maximum distance separable (MDS) codes. Through these classical codes, we are able to obtain various quantum MDS codes. It turns out that many of our quantum codes are new in the sense that the parameters of our quantum codes cannot be obtained from all previous ...
Lingfei Jin +3 more
openaire +3 more sources
On nearly-MDS expander codes [PDF]
International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings., 2004 A construction of graph codes is presented that approaches the singleton bound as the alphabet size goes to infinity. These codes can be decoded by a combined error-erasure decoder whose time complexity grows linearly with the code length.
Ron M. Roth, Vitaly Skachek
openaire +1 more source
On Grid Quorums for Erasure Coded Data
Entropy, 2021 We consider the problem of designing grid quorum systems for maximum distance separable (MDS) erasure code based distributed storage systems. Quorums are used as a mechanism to maintain consistency in replication based storage systems, for which grid ...
Frédérique Oggier, Anwitaman Datta
doaj +1 more source
Advances in Cancer Biology - Metastasis, 2022 DEAD-box RNA helicase 3 (DDX3) is a versatile target that is elevated in several cancer cases besides being a validated target for viral infections. RK-33 is a well-known compound that has been used to target DDX3.
Shailima Rampogu +2 more
doaj +1 more source