Results 251 to 258 of about 35,611 (258)
Some of the next articles are maybe not open access.
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
MDS, Near-MDS or 2-MDS Self-Dual Codes via Twisted Generalized Reed-Solomon Codes
IEEE Transactions on Information Theory, 2022Junzhen Sui +3 more
openaire +1 more source
2000
We investigate the question when a cyclic code is maximum distance separable (MDS). For codes of (co-)dimension 3, this question is related to permutation properties of the polynomial (x b -1)/(x-1) for a certain b. Using results on these polynomials we prove that over fields of odd characteristic the only MDS cyclic codes of dimension 3 are the Reed ...
openaire +1 more source
We investigate the question when a cyclic code is maximum distance separable (MDS). For codes of (co-)dimension 3, this question is related to permutation properties of the polynomial (x b -1)/(x-1) for a certain b. Using results on these polynomials we prove that over fields of odd characteristic the only MDS cyclic codes of dimension 3 are the Reed ...
openaire +1 more source
When Does the Extended Code of an MDS Code Remain MDS?
IEEE Transactions on Information TheoryYansheng Wu +2 more
openaire +1 more source