default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEdward F. Assmus Jr.
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 1992
[b1]Edward F. Assmus Jr., Jennifer D. Key:
Designs and their codes. Cambridge tracts in mathematics 103, Cambridge University Press 1992, ISBN 978-0-521-41361-9, pp. I-IX, 1-392
Journal Articles
- 1998
- [j17]E. F. Assmus Jr.:
Linearly Derived Steiner Triple Systems. Des. Codes Cryptogr. 13(1): 31-49 (1998) - [j16]E. F. Assmus Jr.:
The Category of Linear Codes. IEEE Trans. Inf. Theory 44(2): 612-629 (1998) - 1996
- [j15]E. F. Assmus Jr., Jennifer D. Key:
Designs and Codes: An update. Des. Codes Cryptogr. 9(1): 7-27 (1996) - 1995
- [j14]E. F. Assmus Jr.:
Jr. On 2-ranks of Steiner triple systems. Electron. J. Comb. 2 (1995) - 1992
- [j13]E. F. Assmus Jr.:
On the Reed-Muller codes. Discret. Math. 106-107: 25-33 (1992) - 1990
- [j12]E. F. Assmus Jr., Jennifer D. Key:
Affine and projective planes. Discret. Math. 83(2-3): 161-187 (1990) - 1989
- [j11]Edward F. Assmus Jr., Jennifer D. Key:
Arcs and Ovals in the Hermitian and Ree Unitals. Eur. J. Comb. 10(4): 297-308 (1989) - 1986
- [j10]E. F. Assmus Jr., Jennifer D. Key:
On an infinite class of steiner systems with t = 3 and k = 6. J. Comb. Theory A 42(1): 55-60 (1986) - 1983
- [j9]E. F. Assmus Jr., Vera Pless:
On the coveting radius of extremal self-dual codes. IEEE Trans. Inf. Theory 29(3): 359-363 (1983) - [j8]E. F. Assmus Jr.:
The binary code arising from a 2-design with a nice collection of ovals. IEEE Trans. Inf. Theory 29(3): 367-369 (1983) - 1979
- [j7]E. F. Assmus Jr., Jack H. van Lint:
Ovals in Projective Designs. J. Comb. Theory A 27(3): 307-324 (1979) - 1978
- [j6]Edward F. Assmus Jr., Harold F. Mattson Jr.:
The weight-distribution of a coset of a linear code (Corresp.). IEEE Trans. Inf. Theory 24(4): 497 (1978) - 1976
- [j5]E. F. Assmus Jr., Jean-Marie Goethals, H. F. Mattson Jr.:
Generalized t-Designs and Majority Decoding of Linear Codes. Inf. Control. 32(1): 43-60 (1976) - [j4]E. F. Assmus Jr., H. F. Mattson Jr.:
Some 3-error-correcting BCH codes have covering radius 5 (Corresp.). IEEE Trans. Inf. Theory 22(3): 348-349 (1976) - 1972
- [j3]E. F. Assmus Jr., H. F. Mattson Jr.:
On weights in quadratic-residue codes. Discret. Math. 3(1-3): 1-20 (1972) - [j2]E. F. Assmus Jr., H. F. Mattson Jr.:
Contractions of self-orthogonal codes. Discret. Math. 3(1-3): 21-32 (1972) - 1963
- [j1]E. F. Assmus Jr., H. F. Mattson Jr.:
Error-Correcting Codes: An Axiomatic Approach. Inf. Control. 6(4): 315-330 (1963)
Conference and Workshop Papers
- 1988
- [c2]E. F. Assmus Jr.:
The Coding Theory of Finite Geometries and Designs. AAECC 1988: 1-6 - 1968
- [c1]E. F. Assmus Jr., H. F. Mattson Jr.:
Some (3 p, p) codes. IFIP Congress (1) 1968: 205-209
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 2025-01-07 00:59 CET 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:
