Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2404.02471 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916191077924864 |
|---|---|
| author | Zhu, Hongwei Li, Shitao Shi, Minjia Xia, Shu-Tao Sole, Patrick |
| author_facet | Zhu, Hongwei Li, Shitao Shi, Minjia Xia, Shu-Tao Sole, Patrick |
| contents | The size of the Hamming distance spectrum of a code has received great attention in recent research. The main objective of this paper is to extend these significant theories to the $b$-symbol distance spectrum. We examine this question for various types of codes, including unrestricted codes, additive codes, linear codes, and cyclic codes, successively. For the first three cases, we determine the maximum size of the $b$-symbol distance spectra of these codes smoothly. For the case of cyclic codes, we introduce three approaches to characterize the upper bound for the cardinality of the $b$-symbol weight spectrum of cyclic codes, namely the period distribution approach, the primitive idempotent approach, and the $b$-symbol weight formula approach. As two by-products of this paper, the maximum number of symplectic weights of linear codes is determined, and a basic inequality among the parameters $[n,k,d_H(\C)]_q$ of cyclic codes is provided. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2404_02471 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Some bounds on the cardinality of the $b$-symbol weight spectrum of codes Zhu, Hongwei Li, Shitao Shi, Minjia Xia, Shu-Tao Sole, Patrick Information Theory The size of the Hamming distance spectrum of a code has received great attention in recent research. The main objective of this paper is to extend these significant theories to the $b$-symbol distance spectrum. We examine this question for various types of codes, including unrestricted codes, additive codes, linear codes, and cyclic codes, successively. For the first three cases, we determine the maximum size of the $b$-symbol distance spectra of these codes smoothly. For the case of cyclic codes, we introduce three approaches to characterize the upper bound for the cardinality of the $b$-symbol weight spectrum of cyclic codes, namely the period distribution approach, the primitive idempotent approach, and the $b$-symbol weight formula approach. As two by-products of this paper, the maximum number of symplectic weights of linear codes is determined, and a basic inequality among the parameters $[n,k,d_H(\C)]_q$ of cyclic codes is provided. |
| title | Some bounds on the cardinality of the $b$-symbol weight spectrum of codes |
| topic | Information Theory |
| url | https://arxiv.org/abs/2404.02471 |