Three Families of Projective Binary Linear Codes of at Most Four Weights
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911120894197760 |
|---|---|
| author | Zhang, Tonghui Ke, Pinhui Chang, Zuling |
| author_facet | Zhang, Tonghui Ke, Pinhui Chang, Zuling |
| contents | Three classes of binary linear codes with at most four nonzero weights were constructed in this paper, in which two of them are projective three-weight codes. As applications, $s$-sum sets for any odd $ s > 1$ were constructed. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_18030 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Three Families of Projective Binary Linear Codes of at Most Four Weights Zhang, Tonghui Ke, Pinhui Chang, Zuling Information Theory Three classes of binary linear codes with at most four nonzero weights were constructed in this paper, in which two of them are projective three-weight codes. As applications, $s$-sum sets for any odd $ s > 1$ were constructed. |
| title | Three Families of Projective Binary Linear Codes of at Most Four Weights |
| topic | Information Theory |
| url | https://arxiv.org/abs/2508.18030 |