Results 261 to 270 of about 4,270,277 (317)
Some of the next articles are maybe not open access.
On the minimum weights of binary linear complementary dual codes
Cryptography and Communications, 2018Linear complementary dual codes (or codes with complementary duals) are codes whose intersections with their dual codes are trivial. We study the largest minimum weights d(n,k) among all binary linear complementary dual [n,k] codes.
M. Araya, M. Harada
semanticscholar +1 more source
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
New MDS self-dual codes over finite fields of odd characteristic
Designs, Codes and Cryptography, 2018In this paper, we produce new classes of MDS self-dual codes via (extended) generalized Reed–Solomon codes over finite fields of odd characteristic. Among our constructions, there are many MDS self-dual codes with new parameters which have never been ...
Xiaole Fang +3 more
semanticscholar +1 more source
New MDS Self-Dual Codes From Generalized Reed—Solomon Codes
IEEE Transactions on Information Theory, 2016Both Maximum Distance Separable and Euclidean self-dual codes have theoretical and practical importance and the study of MDS self-dual codes has attracted lots of attention in recent years.
Lingfei Jin, C. Xing
semanticscholar +1 more source
International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings., 2004
In this paper we develop a complete generalization of the building-up method [J.-L. Kim, (2001)] for the Euclidean and Hermitian self-dual codes over finite fields GF(q). Using this method we construct many new Euclidean and Hermitian self-dual MDS (or near MDS) codes of length up to 12 over various finite fields GF(q), where q=8, 9, 16, 25, 32, 41, 49,
null Jon-Lark Kim, null Yoonjin Lee
openaire +1 more source
In this paper we develop a complete generalization of the building-up method [J.-L. Kim, (2001)] for the Euclidean and Hermitian self-dual codes over finite fields GF(q). Using this method we construct many new Euclidean and Hermitian self-dual MDS (or near MDS) codes of length up to 12 over various finite fields GF(q), where q=8, 9, 16, 25, 32, 41, 49,
null Jon-Lark Kim, null Yoonjin Lee
openaire +1 more source
Applicable Algebra in Engineering, Communication and Computing, 2020
In this paper, the authors define a self-dual code over a finite abelian group in terms of an arbitrary duality on the ambient space. They determine when additive self-dual codes exist over abelian groups for any duality and describe various constructions for these codes.
Dougherty, Steven T. +2 more
openaire +2 more sources
In this paper, the authors define a self-dual code over a finite abelian group in terms of an arbitrary duality on the ambient space. They determine when additive self-dual codes exist over abelian groups for any duality and describe various constructions for these codes.
Dougherty, Steven T. +2 more
openaire +2 more sources
Binary extremal self-dual codes of length 60 and related codes
Designs, Codes and Cryptography, 2017We give a classification of four-circulant singly even self-dual [60, 30, d] codes for d=10\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs ...
M. Harada
semanticscholar +1 more source
New constructions of self-dual codes via twisted generalized Reed-Solomon codes
Cryptography and Communications, 2023Junzhen Sui, Qin Yue, Fuqing Sun
semanticscholar +1 more source
On extremal double circulant self-dual codes of lengths 90–96
Applicable Algebra in Engineering, Communication and Computing, 2016A classification of extremal double circulant self-dual codes of lengths up to 88 is known. We extend this classification to length 96. We give a classification of extremal double circulant self-dual codes of lengths 90, 92, 94 and 96.
T. Gulliver, M. Harada
semanticscholar +1 more source
An improved method for constructing formally self-dual codes with small hulls
Designs, Codes and Cryptography, 2023Shitao Li, Minjia Shi, Juan Wang
semanticscholar +1 more source