Forbidden (0,1)-vectors in hyperplanes of R-n: The unrestricted case
Ahlswede R, Aydinian H, Khachatrian LH (2005)
Designs, Codes and Cryptography 37(1): 151-167.
Zeitschriftenaufsatz
| Veröffentlicht | Englisch
Download
Es wurden keine Dateien hochgeladen. Nur Publikationsnachweis!
Autor*in
Ahlswede, RudolfUniBi;
Aydinian, HaratyunUniBi;
Khachatrian, Levon H.
Einrichtung
Stichworte
dimension constraints;
forbidden weights;
combinatorial extremal theory;
1)-vectors;
(0
Erscheinungsjahr
2005
Zeitschriftentitel
Designs, Codes and Cryptography
Band
37
Ausgabe
1
Seite(n)
151-167
ISSN
0925-1022
eISSN
1573-7586
Page URI
https://pub.uni-bielefeld.de/record/1602477
Zitieren
Ahlswede R, Aydinian H, Khachatrian LH. Forbidden (0,1)-vectors in hyperplanes of R-n: The unrestricted case. Designs, Codes and Cryptography. 2005;37(1):151-167.
Ahlswede, R., Aydinian, H., & Khachatrian, L. H. (2005). Forbidden (0,1)-vectors in hyperplanes of R-n: The unrestricted case. Designs, Codes and Cryptography, 37(1), 151-167. https://doi.org/10.1007/s10623-004-3811-9
Ahlswede, Rudolf, Aydinian, Haratyun, and Khachatrian, Levon H. 2005. “Forbidden (0,1)-vectors in hyperplanes of R-n: The unrestricted case”. Designs, Codes and Cryptography 37 (1): 151-167.
Ahlswede, R., Aydinian, H., and Khachatrian, L. H. (2005). Forbidden (0,1)-vectors in hyperplanes of R-n: The unrestricted case. Designs, Codes and Cryptography 37, 151-167.
Ahlswede, R., Aydinian, H., & Khachatrian, L.H., 2005. Forbidden (0,1)-vectors in hyperplanes of R-n: The unrestricted case. Designs, Codes and Cryptography, 37(1), p 151-167.
R. Ahlswede, H. Aydinian, and L.H. Khachatrian, “Forbidden (0,1)-vectors in hyperplanes of R-n: The unrestricted case”, Designs, Codes and Cryptography, vol. 37, 2005, pp. 151-167.
Ahlswede, R., Aydinian, H., Khachatrian, L.H.: Forbidden (0,1)-vectors in hyperplanes of R-n: The unrestricted case. Designs, Codes and Cryptography. 37, 151-167 (2005).
Ahlswede, Rudolf, Aydinian, Haratyun, and Khachatrian, Levon H. “Forbidden (0,1)-vectors in hyperplanes of R-n: The unrestricted case”. Designs, Codes and Cryptography 37.1 (2005): 151-167.
Export
Markieren/ Markierung löschen
Markierte Publikationen
Web of Science
Dieser Datensatz im Web of Science®Suchen in
Google Scholar