
Maximal three-independent subsets of {0, 1, 2}n
Publication
, Journal Article
Calderbank, AR; Fishburn, PC
Published in: Designs Codes and Cryptography
October 1, 1994
We consider a variant of the classical problem of finding the size of the largest cap in the r-dimensional projective geometry PG(r, 3) over the field IF
Duke Scholars
Published In
Designs Codes and Cryptography
DOI
EISSN
1573-7586
ISSN
0925-1022
Publication Date
October 1, 1994
Volume
4
Issue
4
Start / End Page
203 / 211
Related Subject Headings
- Computation Theory & Mathematics
- 49 Mathematical sciences
- 46 Information and computing sciences
- 40 Engineering
- 0804 Data Format
- 0802 Computation Theory and Mathematics
- 0101 Pure Mathematics
Citation
APA
Chicago
ICMJE
MLA
NLM
Calderbank, A. R., & Fishburn, P. C. (1994). Maximal three-independent subsets of {0, 1, 2}n. Designs Codes and Cryptography, 4(4), 203–211. https://doi.org/10.1007/BF01388452
Calderbank, A. R., and P. C. Fishburn. “Maximal three-independent subsets of {0, 1, 2}n.” Designs Codes and Cryptography 4, no. 4 (October 1, 1994): 203–11. https://doi.org/10.1007/BF01388452.
Calderbank AR, Fishburn PC. Maximal three-independent subsets of {0, 1, 2}n. Designs Codes and Cryptography. 1994 Oct 1;4(4):203–11.
Calderbank, A. R., and P. C. Fishburn. “Maximal three-independent subsets of {0, 1, 2}n.” Designs Codes and Cryptography, vol. 4, no. 4, Oct. 1994, pp. 203–11. Scopus, doi:10.1007/BF01388452.
Calderbank AR, Fishburn PC. Maximal three-independent subsets of {0, 1, 2}n. Designs Codes and Cryptography. 1994 Oct 1;4(4):203–211.

Published In
Designs Codes and Cryptography
DOI
EISSN
1573-7586
ISSN
0925-1022
Publication Date
October 1, 1994
Volume
4
Issue
4
Start / End Page
203 / 211
Related Subject Headings
- Computation Theory & Mathematics
- 49 Mathematical sciences
- 46 Information and computing sciences
- 40 Engineering
- 0804 Data Format
- 0802 Computation Theory and Mathematics
- 0101 Pure Mathematics