On triple-sum-sets and two or three weights codes
The authors introduce and characterize triple-sum-sets which are a natural generalization of partial difference sets (which in turn are connected to binary uniformly packed codes and two-weight codes [\textit{J. Wolfmann}, J. Comb. Theory, Ser. A 23, 208-222 (1977; Zbl 0364.94020); \textit{P. Camion}, Difference sets in elementary Abelian groups (1979; Zbl 0455.94018)]). They also obtain a characterization of the perfect 3-error- correcting Golay code and of strongly uniformly packed linear 2-error- correcting binary codes in terms of triple-sum-sets. The transposed codes of a given projective code are also defined and the possible weights of these codes are given with some applications. Finally the authors give a construction of a triple-sum-set in the binary case. They use this construction to prove that there exists a triple-sum-set whose characteristic function is a coset leader of the first order Reed-Muller code R(1,k) of length \(2^ k\) and whose cardinality attains the lower bound given by \textit{T. Helleseth}, \textit{T. Kløve} and \textit{J. Mykkeltveit} [IEEE Trans. Inf. Theory IT-24, 627-628 (1978; Zbl 0379.94017)] for the covering radius of R(1,k).
- Three-weight codes, triple sum sets, and strongly walk regular graphs
- scientific article; zbMATH DE number 4079325
- Tri-weight codes and generalized hadamard matrices
- Three-weight linear codes from Weil sums
- Two-weight and three-weight linear codes based on Weil sums
- scientific article; zbMATH DE number 3871188
- Two and three weight codes over \(\mathbb {F}_p+u\mathbb {F}_p\)
- A class of two-weight and two classes of three-weight codes
- Three-weight cyclic codes and their weight distributions
- On three weights in cyclic codes with two zeros.
- A characterization of N-weight projective codes (Corresp.)
- Codes projectifs à deux ou trois poids associes aux hyperquadriques d'une géométrie finie
- Codes projectifs à deux poids, caps complets et ensembles de différences
- Etude De Certains Paramètres Associés à Un Code Linéaire
- scientific article; zbMATH DE number 3695090 (Why is no real title available?)
- scientific article; zbMATH DE number 3713627 (Why is no real title available?)
- scientific article; zbMATH DE number 3539225 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- On ``bent functions
- On the covering radius of binary codes (Corresp.)
- Partial difference sets and partially balanced weighing designs for calibration and tournaments
- Power moment identities on weight distributions in error correcting codes
- All \(s\)-sum sets of type 2 or 3 are triple-sum sets
- Few-weight codes from trace codes over a local ring
- Complete weight enumerators of a class of three-weight linear codes
- Two-weight and three-weight codes from trace codes over \(\mathbb{F}_p + u \mathbb{F}_p + v \mathbb{F}_p + u v \mathbb{F}_p\)
- The structure of Schur rings over cyclic groups
- More constructions of 3-weight linear codes
- Linear codes with eight weights over \(\mathbb{F}_p+u\mathbb{F}_p\)
- Three-weight codes over rings and strongly walk regular graphs
- Three-weight minimal linear codes
- Three-weight codes, triple sum sets, and strongly walk regular graphs
- A class of three-weight and five-weight linear codes
- Several classes of binary linear codes and their weight enumerators
- On strongly walk regular graphs, triple sum sets and their codes
- A construction of binary linear codes from Boolean functions
- scientific article; zbMATH DE number 4016770 (Why is no real title available?)
- scientific article; zbMATH DE number 4016771 (Why is no real title available?)
- scientific article; zbMATH DE number 4079325 (Why is no real title available?)
- Linear codes with few weights from weakly regular bent functions based on a generic construction
- A kind of three-weight linear codes
- Two and three weight codes over \(\mathbb {F}_p+u\mathbb {F}_p\)
- A unified construction of optimal and distance optimal two or three-weight codes
- Difference sets and three-weight linear codes from trinomials
- Constructions for several classes of few-weight linear codes and their applications
- Several classes of new projective three-weight or four-weight linear codes and their applications in s-sum sets
- Construction of three class of at most four-weight binary linear codes and their applications
- A class of codes admitting at most three nonzero dual distances
This page was built for publication: On triple-sum-sets and two or three weights codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q795016)
