z-logo
open-access-imgOpen Access
Some classes of LCD codes and self-orthogonal codes over finite fields
Author(s) -
Xia Li,
Feng Cheng,
Chunming Tang,
Zhengchun Zhou
Publication year - 2019
Publication title -
advances in mathematics of communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.601
H-Index - 26
eISSN - 1930-5346
pISSN - 1930-5338
DOI - 10.3934/amc.2019018
Subject(s) - dual polyhedron , mathematics , linear code , block code , expander code , prime (order theory) , discrete mathematics , group code , combinatorics , algorithm , decoding methods
Due to their important applications in theory and practice, linear complementary dual (LCD) codes and self-orthogonal codes have received much attention in the last decade. The objective of this paper is to extend a recent construction of binary LCD codes and self-orthogonal codes to the general begin{document}$ p $end{document} -ary case, where begin{document}$ p $end{document} is an odd prime. Based on the extended construction, several classes of begin{document}$ p $end{document} -ary linear codes are obtained. The characterizations of these linear codes to be LCD or self-orthogonal are derived. The duals of these linear codes are also studied. It turns out that the proposed linear codes are optimal in many cases in the sense that their parameters meet certain bounds on linear codes. The weight distributions of these linear codes are settled.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom