Forbidden (0,1)-vectors in hyperplanes of R-n: The restricted case

Ahlswede R, Aydinian H, Khachatrian LH (2003)
Designs, Codes and Cryptography 29(1-3): 17-28.

Journal Article | Published | English

No fulltext has been uploaded

Author
Publishing Year
ISSN
PUB-ID

Cite this

Ahlswede R, Aydinian H, Khachatrian LH. Forbidden (0,1)-vectors in hyperplanes of R-n: The restricted case. Designs, Codes and Cryptography. 2003;29(1-3):17-28.
Ahlswede, R., Aydinian, H., & Khachatrian, L. H. (2003). Forbidden (0,1)-vectors in hyperplanes of R-n: The restricted case. Designs, Codes and Cryptography, 29(1-3), 17-28.
Ahlswede, R., Aydinian, H., and Khachatrian, L. H. (2003). Forbidden (0,1)-vectors in hyperplanes of R-n: The restricted case. Designs, Codes and Cryptography 29, 17-28.
Ahlswede, R., Aydinian, H., & Khachatrian, L.H., 2003. Forbidden (0,1)-vectors in hyperplanes of R-n: The restricted case. Designs, Codes and Cryptography, 29(1-3), p 17-28.
R. Ahlswede, H. Aydinian, and L.H. Khachatrian, “Forbidden (0,1)-vectors in hyperplanes of R-n: The restricted case”, Designs, Codes and Cryptography, vol. 29, 2003, pp. 17-28.
Ahlswede, R., Aydinian, H., Khachatrian, L.H.: Forbidden (0,1)-vectors in hyperplanes of R-n: The restricted case. Designs, Codes and Cryptography. 29, 17-28 (2003).
Ahlswede, Rudolf, Aydinian, Haratyun, and Khachatrian, L. H. “Forbidden (0,1)-vectors in hyperplanes of R-n: The restricted case”. Designs, Codes and Cryptography 29.1-3 (2003): 17-28.
This data publication is cited in the following publications:
This publication cites the following data publications:

Export

0 Marked Publications

Open Data PUB

Web of Science

View record in Web of Science®

Search this title in

Google Scholar