Abstract
We introduce and characterize s-sum-sets which are a natural extension of partial-difference-sets and triple-sum-sets. We show that if Ω is the set of coordinate forms of C(n,k) and if X=F*Ω is an s-sum-set then C(n,k) has not more than three non-zero distinct weights.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
CAMION P. “Difference sets in Elementary Abelian Groups”. Les Presses de l'Université de Montréal, Montréal (1979).
COURTEAU B. and WOLFMANN J. “On triple-sum-sets and two or three weights codes”. Discrete Math. 50 (1984).
GRIERA M. “Esquemes d'Associació: aplicació a Teoria de codis”. These: Universitat Autònoma de Barcelona (1984).
SZEGO G. “Orthogonal Polynomials”. Amer. Math. Soc. New York. Colloquium Publications, vol XXIII. (1959).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Griera, M., Rifà, J., Huguet, L. (1986). On s-sum-sets and projective codes. In: Calmet, J. (eds) Algebraic Algorithms and Error-Correcting Codes. AAECC 1985. Lecture Notes in Computer Science, vol 229. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16776-5_716
Download citation
DOI: https://doi.org/10.1007/3-540-16776-5_716
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16776-1
Online ISBN: 978-3-540-39855-4
eBook Packages: Springer Book Archive