default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAiden A. Bruen
Person information
- affiliation: University of Calgary, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[i1]Aiden A. Bruen:
New identities for the Shannon function and applications. CoRR abs/2102.12692 (2021)
2000 – 2009
- 2008
- [j27]T. L. Alderson
, Aiden A. Bruen:
Maximal AMDS codes. Appl. Algebra Eng. Commun. Comput. 19(2): 87-98 (2008) - [j26]T. L. Alderson, Aiden A. Bruen:
Codes from Cubic Curves and their Extensions. Electron. J. Comb. 15(1) (2008) - [j25]T. L. Alderson, Aiden A. Bruen:
Coprimitive sets and inextendable codes. Des. Codes Cryptogr. 47(1-3): 113-124 (2008) - 2007
- [j24]T. L. Alderson, Aiden A. Bruen, Robert Silverman:
Maximum distance separable codes and arcs in projective spaces. J. Comb. Theory A 114(6): 1101-1117 (2007) - 2005
- [b1]Aiden A. Bruen, Mario A. Forcinito:
Cryptography, information theory, and error-correction - a handbook for the 21st century. Wiley-Interscience series in discrete mathematics and optimization, Wiley 2005, ISBN 978-0-471-65317-2, pp. I-XXIII, 1-468 - 2002
- [j23]Robert E. Mercer, John L. Barron, Aiden A. Bruen, David Cheng:
Fuzzy points: algebra and application. Pattern Recognit. 35(5): 1153-1166 (2002) - 2001
- [j22]Aiden A. Bruen, David L. Wehlau:
New Codes from Old; A New Geometric Construction. J. Comb. Theory A 94(1): 196-202 (2001) - 2000
- [j21]Aiden A. Bruen, Charles J. Colbourn:
Transversal Designs in Classical Planes and Spaces. J. Comb. Theory A 92(1): 88-94 (2000)
1990 – 1999
- 1999
- [j20]Aiden A. Bruen, David L. Wehlau:
Long Binary Linear Codes and Large Caps in Projective Space. Des. Codes Cryptogr. 17(1-3): 37-60 (1999) - [j19]Aiden A. Bruen, Keldon Drudge:
The Return of the Baer Subplane. J. Comb. Theory A 85(2): 228-231 (1999) - 1998
- [j18]Aiden A. Bruen, Lucien Haddad, David L. Wehlau:
Caps and Colouring Steiner Triple Systems. Des. Codes Cryptogr. 13(1): 51-55 (1998) - [j17]Aiden A. Bruen, Keldon Drudge:
On the Non-Existence of Certain Cameron-Liebler Line Classes in PG(3, q). Des. Codes Cryptogr. 14(2): 127-132 (1998) - 1997
- [j16]Aiden A. Bruen, David L. Wehlau:
Partitioning Quadrics, Symmetric Group Divisible Designs and Caps. Des. Codes Cryptogr. 10(2): 145-155 (1997) - 1996
- [j15]Andries E. Brouwer, Aiden A. Bruen, David L. Wehlau:
There Exist Caps Which Block All Spaces of Fixed Codimension in G (n, 2). J. Comb. Theory A 73(1): 168-169 (1996) - [j14]Aiden A. Bruen, David L. Wehlau, Zhang Zhaoji:
Unimodular Matrices and Parsons Numbers. J. Comb. Theory A 74(2): 333-336 (1996) - 1994
- [j13]Aiden A. Bruen:
Solution to a question of A. Beutelspacher on finite linear spaces. Discret. Math. 129(1-3): 219-220 (1994) - 1992
- [j12]Aiden A. Bruen, J. Chris Fisher:
An observation on certain point-line configurations in classical planes. Discret. Math. 106-107: 93-96 (1992) - [j11]Aiden A. Bruen:
Polynomial Multiplicties over Finite Fields and Intersection Sets. J. Comb. Theory A 60(1): 19-33 (1992) - 1991
- [j10]Aiden A. Bruen, J. Chris Fisher:
The Jamison Method in Galois Geometries. Des. Codes Cryptogr. 1(3): 199-205 (1991) - 1990
- [j9]Aiden A. Bruen:
Nuclei of sets of q + 1 points in PG(2, q) and blocking sets of Redei type. J. Comb. Theory A 55(1): 130-132 (1990)
1980 – 1989
- 1989
- [j8]Aart Blokhuis, Aiden A. Bruen:
The minimal number of lines intersected by a set of q + 2 points, blocking sets, and intersecting circles. J. Comb. Theory A 50(2): 308-315 (1989) - [j7]Aiden A. Bruen:
Kummer configurations and designs embedded in planes. J. Comb. Theory A 52(1): 154-157 (1989) - 1988
- [j6]Aiden A. Bruen, James W. P. Hirschfeld:
Intersections in Projective Space II: Pencils of Quadrics. Eur. J. Comb. 9(3): 255-270 (1988) - 1987
- [j5]Aiden A. Bruen, Robert Silverman:
Arcs and Blocking Sets II. Eur. J. Comb. 8(4): 351-356 (1987) - 1982
- [j4]Aiden A. Bruen:
Arcs in Planes of Even Order. Eur. J. Comb. 3(1): 17-18 (1982) - [j3]Aiden A. Bruen:
Lower Bounds for Complete {k; n}-ARCS. J. Comb. Theory A 33(1): 109-111 (1982) - 1980
- [j2]Aiden A. Bruen, B. L. Rothschild, Jack H. van Lint:
On Characterizing Subspaces. J. Comb. Theory A 29(2): 257-260 (1980)
1970 – 1979
- 1973
- [j1]Aiden A. Bruen:
The Number of Lines Determined by n2 Points. J. Comb. Theory A 15(2): 225-241 (1973)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
