Results 11 to 20 of about 42,243 (288)
Constructions of maximum distance separable symbol-pair codes using cyclic and constacyclic codes [PDF]
Designs, Codes and Cryptography, 2016 Symbol-pair code is a new coding framework which is proposed to correct errors in the symbol-pair read channel. In particular, maximum distance separable (MDS) symbol-pair codes are a kind of symbol-pair codes with the best possible error-correction ...
Shuxing Li, G. Ge
semanticscholar +3 more sources
Skew Constacyclic Codes over a Non-Chain Ring [PDF]
Entropy, 2023 In this paper, we investigate the algebraic structure of the non-local ring Rq=Fq[v]/⟨v2+1⟩ and identify the automorphisms of this ring to study the algebraic structure of the skew constacyclic codes and their duals over this ring. Furthermore, we give a
Mehmet Emin Köroğlu, Mustafa Sarı
doaj +2 more sources
Maximum Distance Separable Codes in the ρ Metric over Arbitrary Alphabets [PDF]
Journal of Algebraic Combinatorics, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
S. Dougherty, M. Skriganov
semanticscholar +2 more sources
Maximum distance separable symbol-pair codes
2012 IEEE International Symposium on Information Theory Proceedings, 2012 We study (symbol-pair) codes for symbol-pair read channels introduced recently by Cassuto and Blaum (2010). A Singleton-type bound on symbol-pair codes is established and infinite families of optimal symbol-pair codes are constructed. These codes are maximum distance separable (MDS) in the sense that they meet the Singleton-type bound.
Y. Chee, Han Mao Kiah, Chengmin Wang
semanticscholar +3 more sources
Punctured maximum distance separable codes
Electronics Letters, 1993 To puncture a block code means to delete some of the parity symbols after encoding and let the decoder work only on the remaining symbols. For MDS codes to which the Reed–Solomon codes belong, puncturing yields an MDS code with the same good properties.
C. Feyling
semanticscholar +2 more sources
Quantum Codes of Maximal Distance and Highly Entangled Subspaces [PDF]
Quantum, 2020 We present new bounds on the existence of general quantum maximum distance separable codes (QMDS): the length $n$ of all QMDS codes with local dimension $D$ and distance $d \geq 3$ is bounded by $n \leq D^2 + d - 2$.
Felix Huber, Markus Grassl
doaj +1 more source
A New Class of Q-Ary Codes for the McEliece Cryptosystem
Cryptography, 2021 The McEliece cryptosystem is a promising candidate for post-quantum public-key encryption. In this work, we propose q-ary codes over Gaussian integers for the McEliece system and a new channel model.
Jürgen Freudenberger +1 more
doaj +1 more source
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
Projective MDS Codes Over GF(27)
مجلة بغداد للعلوم, 2021 MDS code is a linear code that achieves equality in the Singleton bound, and projective MDS (PG-MDS) is MDS code with independents property of any two columns of its generator matrix.
Emad Bakr Abdulkareem Al-Zangana
doaj +1 more source
Research on the Construction of Maximum Distance Separable Codes via Arbitrary Twisted Generalized Reed-Solomon Codes [PDF]
IEEE Transactions on Information TheoryMaximum distance separable (MDS) codes have significant combinatorial and cryptographic applications due to their certain optimality. Generalized Reed-Solomon (GRS) codes are the most prominent MDS codes. Twisted generalized Reed-Solomon (TGRS) codes may
Chun-e Zhao +3 more
semanticscholar +1 more source