Subset sums and coding theory

Asterisque

Volumn 258, Issue , 1999, Pages 327-339

  Cohen, Gérard ^a   Zémor, Gilles ^a  

^a TELECOM PARISTECH   (France)

Author keywords

Additive theory; Coding theory

Indexed keywords

EID: 0000102783     PISSN: 03031179     EISSN: None     Source Type: Book Series    
DOI: None     Document Type: Article

References (13)

1. Bassalygo L.A., New bounds for error-correcting codes., Problemy Peredachi Informatsii, 1, 1965, 41-45.
2. Cohen G. and Zémor G., Intersecting codes and independent families, IEEE Trans. on Inf. Theory, 40, 1994, 1872-1881.
3. Cohen G.D., Karpovsky M., Mattson H.F. Jr. and Schatz J., Covering radius - survey and recent results, IEEE Trans. Inf. Theory, 31, 1985, 328-344.
4. Delsarte P., Four fundamental parameters of a code and their combinatorial significance, Info. and control, 23, 1973, 407-438.
5. Enomoto H., Frankl P., Ito N. and Nomura K., Codes with given distances, Graphs and Combinatorics, 3, 1987, 25-38.
6. Farrell P.G., Linear binary anticodes, Electronics Letters, 6, 1970, 419-421.
7. Frankl P. and Füredi Z., Forbidding just one intersection, J.C.T. A, 39, 1985, 160-176.
8. Frankl P. and Wilson R.M., Intersection theorems with geometric consequences, Combinatorica, 1, 1981, 357-368.
9. Godlewski P., WOM-codes construits à partir des codes de Hamming, Discrete Math., 65, 1987, 237-243.
10. MacWilliams F.J. and Sloane N.J.A., The theory of error-correcting codes, North-Holland, 1977.
11. Miklós D., Linear binary codes with intersection properties, Discrete Applied Math., 9, 1984, 187-196.
12. Olson J.E., A combinatorial problem on finite abelian groups, J. Number Theory, 1, 1969, 195-199.
13. Zémor G., Subset sums in binary spaces, Europ. J. of Combinatorics, 13, 1992, 221-230.