A new class of self-orthogonal linear codes and their applications
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912112432906240 |
|---|---|
| author | Zhang, Yaozong Zheng, Dabin Wang, Xiaoqiang |
| author_facet | Zhang, Yaozong Zheng, Dabin Wang, Xiaoqiang |
| contents | Self-orthogonal codes are a subclass of linear codes that are contained within their dual codes. Since self-orthogonal codes are widely used in quantum codes, lattice theory and linear complementary dual (LCD) codes, they have received continuous attention and research. In this paper, we construct a class of self-orthogonal codes by using the defining-set approach, and determine their explicit weight distributions and the parameters of their duals. Some considered codes are optimal according to the tables of best codes known maintained at \cite{Grassl} and a class of almost maximum distance separable (AMDS) codes from their duals are obtained. As applications, we obtain a class of new quantum codes, which are MDS or AMDS according to the quantum Singleton bound under certain conditions. Some examples show that the constructed quantum codes have the better parameters than known ones maintained at \cite{Bierbrauer}. Furthermore, a new class of LCD codes are given, which are almost optimal according to the sphere packing bound. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2311_18432 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | A new class of self-orthogonal linear codes and their applications Zhang, Yaozong Zheng, Dabin Wang, Xiaoqiang Information Theory Self-orthogonal codes are a subclass of linear codes that are contained within their dual codes. Since self-orthogonal codes are widely used in quantum codes, lattice theory and linear complementary dual (LCD) codes, they have received continuous attention and research. In this paper, we construct a class of self-orthogonal codes by using the defining-set approach, and determine their explicit weight distributions and the parameters of their duals. Some considered codes are optimal according to the tables of best codes known maintained at \cite{Grassl} and a class of almost maximum distance separable (AMDS) codes from their duals are obtained. As applications, we obtain a class of new quantum codes, which are MDS or AMDS according to the quantum Singleton bound under certain conditions. Some examples show that the constructed quantum codes have the better parameters than known ones maintained at \cite{Bierbrauer}. Furthermore, a new class of LCD codes are given, which are almost optimal according to the sphere packing bound. |
| title | A new class of self-orthogonal linear codes and their applications |
| topic | Information Theory |
| url | https://arxiv.org/abs/2311.18432 |