Abstract
The (Euclidean) hull of a linear code is defined to be the intersection of the code and its Euclidean dual. It is clear that the hulls are self-orthogonal codes, which are an important type of linear codes due to their wide applications in communication and cryptography. Let C(2,n,δ) be the binary primitive narrow-sense BCH code, where n = 2m −1 and m is a positive integer. In this paper, we will investigate the parameters of the hulls of C(2,n,δ). The dimension of Hull(C(2,n,δ)) will be presented when (Formula Presented). Furthermore, we give an improvement on lower bounds of the minimum distances of Hull(C(2,n,δ)). We also construct a self-orthogonal subcode of Hull(C(2,n,δ)) and investigate the parameters of the self-orthogonal code.
| Original language | English |
|---|---|
| Pages (from-to) | 741-752 |
| Number of pages | 12 |
| Journal | Advances in Mathematics of Communications |
| Volume | 16 |
| Issue number | 4 |
| DOIs | |
| State | Published - Nov 2022 |
Keywords
- BCH code
- hull
- lower bound
- minimum distance
- self-orthogonal code
Fingerprint
Dive into the research topics of 'PARAMETERS OF HULLS OF PRIMITIVE BINARY NARROW-SENSE BCH CODES AND THEIR SUBCODES'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver