Score: 0
Three Families of Projective Binary Linear Codes of at Most Four Weights
Published: August 25, 2025 |
arXiv ID: 2508.18030v1
By: Tonghui Zhang, Pinhui Ke, Zuling Chang
Potential Business Impact:
Finds new math codes for secret messages.
Business Areas:
Telecommunications
Hardware
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.
Similar Papers
94%
Several classes of three-weight or four-weight linear codes
Information Theory
Makes secret messages harder to steal.
3 Nov 2025
0
90%
Several classes of $p$-ary linear codes with few-weights derived from Weil sums
Information Theory
Creates secret codes for sharing information safely.
29 Oct 2025
0
88%
Linear codes over $\frac{\mathbb{F}_q[u]}{\langle u^2 \rangle}$ with mixed-alphabet defining sets and their Gray images: Constructions of projective few-weight, distance-optimal and minimal codes
Information Theory
Creates better codes for secret messages and sharing.
8 Dec 2025
0
Country of Origin
🇨🇳
China
Page Count
19 pages
Category
Computer Science:
Information Theory