Results 131 to 140 of about 9,399 (155)
Some of the next articles are maybe not open access.
IEEE Transactions on Information Theory, 2014
In this paper, we extend the concept of maximum-distance separable (MDS) array codes to a larger class of codes, where the array columns contain a variable number of data and parity symbols and the codewords cannot be arranged, in general, in a regular array structure with equal column length.
Filippo Tosato, Magnus Sandell
openaire +1 more source
In this paper, we extend the concept of maximum-distance separable (MDS) array codes to a larger class of codes, where the array columns contain a variable number of data and parity symbols and the codewords cannot be arranged, in general, in a regular array structure with equal column length.
Filippo Tosato, Magnus Sandell
openaire +1 more source
IEEE Transactions on Information Theory, 2011
New quantum maximum-distance-separable (MDS) codes with parameters [[q2 + 1, q2 -2d + 3, d]]q, where q=2t, t ≥ 1 and 3 ≤ d ≤ q+1 is an odd integer, are constructed in this paper.
openaire +1 more source
New quantum maximum-distance-separable (MDS) codes with parameters [[q2 + 1, q2 -2d + 3, d]]q, where q=2t, t ≥ 1 and 3 ≤ d ≤ q+1 is an odd integer, are constructed in this paper.
openaire +1 more source
2008 IEEE International Symposium on Information Theory, 2008
We consider the problem for which lengths a self-dual MDS code over Fq exists.We show that for q = 2m, there are self-dual MDS codes for all even lengths up to 2m. Furthermore, self-dual MDS codes of length q + 1 over Fq exist for all odd prime powers q. Additionally, we present some new self-dual MDS codes.
Markus Grassl, T. Aaron Gulliver
openaire +1 more source
We consider the problem for which lengths a self-dual MDS code over Fq exists.We show that for q = 2m, there are self-dual MDS codes for all even lengths up to 2m. Furthermore, self-dual MDS codes of length q + 1 over Fq exist for all odd prime powers q. Additionally, we present some new self-dual MDS codes.
Markus Grassl, T. Aaron Gulliver
openaire +1 more source
On generator matrices of MDS codes
IEEE Trans. Inf. Theory, 1985It is shown that the family of q-ary generalized Reed-Solomon codes is identical to the family of q-ary linear codes generated by matrices of the form [I\(| A]\), where I is the identity matrix, and A is a generalized Cauchy matrix. Using Cauchy matrices, a construction is shown of maximal triangular arrays over GF(q), which are constant along ...
Ron M. Roth, Gadiel Seroussi
openaire +1 more source
A condition for arcs and MDS codes
Designs, Codes and Cryptography, 2010zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Recursive MDS-Codes and Pseudogeometries
1999In [2,4] the notion of a recursive code was introduced and some constructions of recursive MDS codes were proposed. The main result was that for any q ∉ {2, 6} (except possibly q ∈ {14, 18, 26, 42}) there exists a recursive MDS-code in an alphabet of q elements of length 4 and combinatorial dimension 2 (i.e . a recursive [4, 2, 3]q-code).
Elena Couselo +3 more
openaire +1 more source
MDS, Near-MDS or 2-MDS Self-Dual Codes via Twisted Generalized Reed-Solomon Codes
IEEE Transactions on Information Theory, 2022Xia Li, Qin Yue, Junzhen Sui
exaly
MDS or NMDS self-dual codes from twisted generalized Reed–Solomon codes
Designs, Codes, and Cryptography, 2021Qin Yue
exaly
When Does the Extended Code of an MDS Code Remain MDS?
IEEE Transactions on Information TheoryYansheng Wu +2 more
openaire +1 more source