Subset sums and coding theory
Structure theory of set addition, Astérisque, no. 258 (1999), pp. 327-339. 
@incollection{AST_1999__258__327_0,
     author = {Cohen, G\'erard and Z\'emor, Gilles},
     title = {Subset sums and coding theory},
     booktitle = {Structure theory of set addition},
     editor = {Deshouilliers Jean-Marc and Landreau Bernard and Yudin Alexander A.},
     series = {Ast\'erisque},
     pages = {327--339},
     publisher = {Soci\'et\'e math\'ematique de France},
     number = {258},
     year = {1999},
     mrnumber = {1701208},
     zbl = {1044.94016},
     language = {en},
     url = {http://www.numdam.org/item/AST_1999__258__327_0/}
}
TY  - CHAP
AU  - Cohen, Gérard
AU  - Zémor, Gilles
TI  - Subset sums and coding theory
BT  - Structure theory of set addition
AU  - Collectif
ED  - Deshouilliers Jean-Marc
ED  - Landreau Bernard
ED  - Yudin Alexander A.
T3  - Astérisque
PY  - 1999
SP  - 327
EP  - 339
IS  - 258
PB  - Société mathématique de France
UR  - http://www.numdam.org/item/AST_1999__258__327_0/
LA  - en
ID  - AST_1999__258__327_0
ER  - 
%0 Book Section
%A Cohen, Gérard
%A Zémor, Gilles
%T Subset sums and coding theory
%B Structure theory of set addition
%A Collectif
%E Deshouilliers Jean-Marc
%E Landreau Bernard
%E Yudin Alexander A.
%S Astérisque
%D 1999
%P 327-339
%N 258
%I Société mathématique de France
%U http://www.numdam.org/item/AST_1999__258__327_0/
%G en
%F AST_1999__258__327_0
Cohen, Gérard; Zémor, Gilles. Subset sums and coding theory, dans Structure theory of set addition, Astérisque, no. 258 (1999), pp. 327-339. http://www.numdam.org/item/AST_1999__258__327_0/

[1] Bassalygo L. A., New bounds for error-correcting codes., Problemy Peredachi Informat-sii, 1 , 1965, 41-45. | MR | Zbl

[2] Cohen G. and Zémor G., Intersecting codes and independent families, IEEE Trans, on Inf. Theory, 40, 1994, 1872-1881. | DOI | Zbl

[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. | DOI | MR | Zbl

[4] Delsarte P., Four fundamental parameters of a code and their combinatorial significance, Info, and control, 23, 1973, 407-438. | DOI | MR | Zbl

[5] Enomoto H., Frankl P., Ito N. and Nomura K., Codes with given distances, Graphs and Combinatorics, 3, 1987, 25-38. | DOI | MR | Zbl

[6] Farrell P. G., Linear binary anticodes, Electronics Letters, 6 , 1970, 419-421. | DOI

[7] Frankl P. and Füredi Z., Forbidding just one intersection, J.C.T. A, 39, 1985, 160-176. | DOI | MR | Zbl

[8] Frankl P. and Wilson R. M., Intersection theorems with geometric consequences, Combinatorica, 1, 1981, 357-368. | DOI | MR | Zbl

[9] Godlewski P., WOM-codes construits à partir des codes de Hamming, Discrete Math., 65, 1987, 237-243. | DOI | MR | Zbl

[10] Macwilliams F.J. and Sloane N. J. A., The theory of error-correcting codes, North-Holland, 1977. | MR | Zbl

[11] Miklós D., Linear binary codes with intersection properties, Discrete Applied Math., 9, 1984, 187-196. | DOI | MR | Zbl

[12] Olson J. E., A combinatorial problem on finite abelian groups, J. Number Theory, 1, 1969, 195-199. | DOI | MR | Zbl

[13] Zémor G., Subset sums in binary spaces, Europ. J. of Combinatorics, 13, 1992, 221-230. | DOI | MR | Zbl