It was shown by Massey that linear complementary dual (LCD) codes are asymptotically good. In 2004, Sendrier proved that LCD codes meet the asymptotic Gilbert-Varshamov (GV) bound. Until now, the GV bound still remains to be the best asymptotical lower bound for LCD codes. In this paper, we show that an algebraic geometry code over a finite field of even characteristic is equivalent to an LCD code and consequently there exists a family of LCD codes that are equivalent to algebraic geometry codes and exceed the asymptotical GV bound.MOE (Min. of Education, S’pore
Survey chapter to appear in "A Concise Encyclopedia of Coding Theory", W.C. Huffman, J.-L. Kim, and ...
AbstractThe paper discusses some ways to strengthen (nonasymptotically) the Gilbert–Varshamov bound ...
Linear complementary dual (LCD) codes and linear complementary pairs (LCP) of codes have been propos...
It was shown by Massey that linear complementary dual (LCD) codes are asymptotically good. In 2004, ...
Since the proof in 1982, by Tsfasman Vladut and Zink of the existence of algebraic-geometric (AG) co...
We show that every self-orthogonal code over Fq of length n can be extended to a self-dual code, if ...
AbstractThis is an attempt to analyze the present state of affairs concerning asymptotic bounds in c...
The Gilbert-Varshamov bound guarantees the existence of families of codes over the finite field Fℓ w...
Linear codes with complementary-duals (LCD) are linear codes that intersect with their dual trivial...
Linear codes with complementary duals (LCD) are linear codes whose intersection with their dual are ...
Linear codes with complementary-duals (LCD) are linear codes that intersect with their dual trivial...
Algebraic geometric codes were first introduced by V.D.Goppa . They were well recognized and develop...
Linear codes with complementary duals (LCD) are linear codes whose intersection with their dual are ...
AbstractUsing the hull dimension spectra of linear codes, we show that linear codes with complementa...
When information is transmitted, errors are likely to occur. Coding theory examines efficient ways o...
Survey chapter to appear in "A Concise Encyclopedia of Coding Theory", W.C. Huffman, J.-L. Kim, and ...
AbstractThe paper discusses some ways to strengthen (nonasymptotically) the Gilbert–Varshamov bound ...
Linear complementary dual (LCD) codes and linear complementary pairs (LCP) of codes have been propos...
It was shown by Massey that linear complementary dual (LCD) codes are asymptotically good. In 2004, ...
Since the proof in 1982, by Tsfasman Vladut and Zink of the existence of algebraic-geometric (AG) co...
We show that every self-orthogonal code over Fq of length n can be extended to a self-dual code, if ...
AbstractThis is an attempt to analyze the present state of affairs concerning asymptotic bounds in c...
The Gilbert-Varshamov bound guarantees the existence of families of codes over the finite field Fℓ w...
Linear codes with complementary-duals (LCD) are linear codes that intersect with their dual trivial...
Linear codes with complementary duals (LCD) are linear codes whose intersection with their dual are ...
Linear codes with complementary-duals (LCD) are linear codes that intersect with their dual trivial...
Algebraic geometric codes were first introduced by V.D.Goppa . They were well recognized and develop...
Linear codes with complementary duals (LCD) are linear codes whose intersection with their dual are ...
AbstractUsing the hull dimension spectra of linear codes, we show that linear codes with complementa...
When information is transmitted, errors are likely to occur. Coding theory examines efficient ways o...
Survey chapter to appear in "A Concise Encyclopedia of Coding Theory", W.C. Huffman, J.-L. Kim, and ...
AbstractThe paper discusses some ways to strengthen (nonasymptotically) the Gilbert–Varshamov bound ...
Linear complementary dual (LCD) codes and linear complementary pairs (LCP) of codes have been propos...