default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDF. Jessie MacWilliams
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1980 – 1989
- 1981
[j17]F. Jessie MacWilliams, Judith B. Seery:
The weight distributions of some minimal cyclic codes. IEEE Trans. Inf. Theory 27(6): 796-806 (1981)
1970 – 1979
- 1979
- [j16]F. Jessie MacWilliams:
Decomposition of cyclic codes of block lengths 3p, 5p, 7p (Corresp.). IEEE Trans. Inf. Theory 25(1): 112-118 (1979) - [j15]F. Jessie MacWilliams:
A table of primitive binary idempotents of odd length n, 7≤n≤511 (Corresp.). IEEE Trans. Inf. Theory 25(1): 118-121 (1979) - 1978
- [j14]F. Jessie MacWilliams, Andrew M. Odlyzko, Neil J. A. Sloane, Harold N. Ward:
Self-Dual Codes over GF(4). J. Comb. Theory A 25(3): 288-318 (1978) - [j13]Marc R. Best, Andries E. Brouwer, F. Jessie MacWilliams, Andrew M. Odlyzko, Neil J. A. Sloane:
Bounds for binary codes of length less than 25. IEEE Trans. Inf. Theory 24(1): 81-93 (1978) - [j12]Jacobus H. van Lint, F. Jessie MacWilliams:
Generalized quadratic residue codes. IEEE Trans. Inf. Theory 24(6): 730-737 (1978) - 1977
- [j11]F. Jessie MacWilliams, Andrew M. Odlyzko:
Pelikán's Conjecture Cyclotomic Cosets. J. Comb. Theory A 22(1): 110-114 (1977) - 1974
- [j10]Anthony M. Kerdock, F. Jessie MacWilliams, Andrew M. Odlyzko:
A new theorem about the Mattson-Solomon polynomial, and some applications. IEEE Trans. Inf. Theory 20(1): 85-89 (1974) - 1973
- [j9]F. Jessie MacWilliams, Neil J. A. Sloane, John G. Thompson:
On the Existence of a Projective Plane of Order 10. J. Comb. Theory A 14(1): 66-78 (1973) - 1972
- [j8]F. Jessie MacWilliams:
Cyclotomic numbers, coding theory and orthogonal polynomials. Discret. Math. 3(1-3): 133-151 (1972) - [j7]F. Jessie MacWilliams, Neil J. A. Sloane, John G. Thompson:
Good self dual codes exist. Discret. Math. 3(1-3): 153-162 (1972) - [j6]Elwyn R. Berlekamp, F. Jessie MacWilliams, Neil J. A. Sloane:
Gleason's theorem on self-dual codes. IEEE Trans. Inf. Theory 18(3): 409-414 (1972) - [j5]F. Jessie MacWilliams, Colin L. Mallows, Neil J. A. Sloane:
Generalizations of Gleason's theorem on weight enumerators of self-dual codes. IEEE Trans. Inf. Theory 18(6): 794-805 (1972) - 1970
- [j4]F. Jessie MacWilliams:
Binary codes which are ideals in the group algebra of an abelian group. Bell Syst. Tech. J. 49(6): 987-1011 (1970) - [j3]Philippe Delsarte, Jean-Marie Goethals, F. Jessie MacWilliams:
On Generalized Reed-Muller Codes and Their Relatives. Inf. Control. 16(5): 403-442 (1970)
1960 – 1969
- 1968
- [j2]F. Jessie MacWilliams, H. B. Mann:
On the p-Rank of the Design Matrix of a Difference Set. Inf. Control. 12(5/6): 474-488 (1968) - 1967
- [j1]F. Jessie MacWilliams:
An example of two cyclically orthogonal sequences with maximum period (Corresp.). IEEE Trans. Inf. Theory 13(2): 338-339 (1967)
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:25 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:
