Codes with forbidden distances

Discrete Mathematics

Volumn 213, Issue 1-3, 2000, Pages 3-11

  Bassalygo, Leonid ^a   Cohen, Gérard ^b   Zémor, Gilles ^b  

^a INSTITUTE FOR INFORMATION TRANSMISSION PROBLEMS   (Russian Federation)

^b TELECOM PARISTECH   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0042281825     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(99)00161-2     Document Type: Article

References (11)

1. L.A. Bassalygo, New upper bounds for error-correcting codes, Problemy Peredachi Informatsii 1 (4) (1965) 41-45.
2. L.A. Bassalygo, V.A. Zinoviev, V.V. Zyablov, M.S. Pinsker, G.Sh. Poltyrev, Bounds for codes with unequal protection of two message sets, Problemy Peredachi Informatsii 15 (3) (1979) 40-49.
3. L.A. Bassalygo, M.S. Pinsker, in: Kasami, Lin Wei, Yamamura (Eds.), Remark on the paper Coding for binary symmetric broadcast channel with two receivers, Problemy Peredachi Informatsii 24 (3) (1988) 102-106.
4. H. Enomoto, P. Frankl, N. Ito, K. Nomura, Codes with given distances, Graphs Combin. 3 (1987) 25-38.
5. P.G. Farrell, Linear binary anticodes, Electron. Lett. 6 (1970) 419-421.
6. P. Frankl, Orthogonal vectors in the n-dimensional cube and codes with missing distances, Combinatorica 6 (1986) 279-285.
7. P. Frankl, Z. Füredi, Forbidding just one intersection, J. Combin. Theory Ser. A 39 (1985) 160-176.
8. P. Frankl, R.M. Wilson, Intersection theorems with geometric consequences, Combinatorica 1 (1981) 357-368.
9. G.L. Katsman, Bounds on the cardinality of linear codes with unequal protection of information symbols, Problemy Peredachi Informatsii 16 (1980) 25-32.
10. F.J. MacWilliams, N.J.A. Sloane, The theory of error-correcting codes, North-Holland, Amsterdam, 1977.
11. H.N. Ward, Divisible codes, Arch. Math. 36 (1981) 485-494.