Results 251 to 260 of about 533,291 (281)
Some of the next articles are maybe not open access.
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 group codes with complementary duals
Designs, Codes and Cryptography, 2017zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Javier de la Cruz, Wolfgang Willems
openaire +1 more source
On the Classification of Self-dual -Codes
2009A classification of self-dual -codes of modest lengths is known for small k . For k = 4,6,8,9 and 10, the classification of self-dual -codes is extended to lengths 19,12,12,12 and 10, respectively, by considering k -frames of unimodular lattices.
Masaaki Harada, Akihiro Munemasa
openaire +1 more source
Constructions of self-dual codes and formally self-dual codes over rings
Applicable Algebra in Engineering, Communication and Computing, 2016zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Steven T. Dougherty +2 more
openaire +1 more source
The Dual Code of some Reed-Muller type Codes
Applicable Algebra in Engineering, Communication and Computing, 2004zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Manuel González Sarabia +1 more
openaire +2 more sources
On the duals of binary BCH codes
IEEE Transactions on Information Theory, 2001Summary: We give bounds for the minimal distance of duals of binary Bose-Chaudhuri-Hocquenghem (BCH) codes in a range where the Carlitz-Uchiyama bound is trivial. This is done by estimating the number of points on certain curves over finite fields.
openaire +1 more source
2016
The authors investigate the existence of new extremal self dual codes. In orderto construct such codes, they present general methods for constructing self-dual codes and they obtain extremal self-dual codes having weight enumerators for which extremal codes were not previously known to exist, using some matrices.
Harada, Masaaki, Kimura, Hiroshi
openaire +2 more sources
The authors investigate the existence of new extremal self dual codes. In orderto construct such codes, they present general methods for constructing self-dual codes and they obtain extremal self-dual codes having weight enumerators for which extremal codes were not previously known to exist, using some matrices.
Harada, Masaaki, Kimura, Hiroshi
openaire +2 more sources
1988
A linear code C is called self-dual if C = C⊥. Clearly the rate of such a code is 1/2. Many authors have studied such codes and discovered interesting connections with invariant theory and with lattice sphere packings (cf. Mac Williams and Sloane, 1977, Ch. 19). Recently there has been interest in geometric Goppa codes that are self-dual.
Jacobus H. van Lint, Gerard van der Geer
openaire +1 more source
A linear code C is called self-dual if C = C⊥. Clearly the rate of such a code is 1/2. Many authors have studied such codes and discovered interesting connections with invariant theory and with lattice sphere packings (cf. Mac Williams and Sloane, 1977, Ch. 19). Recently there has been interest in geometric Goppa codes that are self-dual.
Jacobus H. van Lint, Gerard van der Geer
openaire +1 more source
MDS or NMDS self-dual codes from twisted generalized Reed–Solomon codes
Designs, Codes, and Cryptography, 2021Qin Yue, Yongfeng Niu
exaly
A Unified Approach to Construct MDS Self-Dual Codes via Reed-Solomon Codes
IEEE Transactions on Information Theory, 2020Aixian Zhang, Keqin Feng
exaly