default search action
W. Wesley Peterson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2010
- [j18]W. Wesley Peterson, James B. Nation, Marc P. C. Fossorier:
Reflection Group Codes and Their Decoding. IEEE Trans. Inf. Theory 56(12): 6273-6293 (2010)
2000 – 2009
- 2007
- [j17]Marc P. C. Fossorier, James B. Nation, W. Wesley Peterson:
A Note on the Optimality of Variant-I Permutation Modulation Codes. IEEE Trans. Inf. Theory 53(8): 2878-2879 (2007)
1990 – 1999
- 1997
- [j16]W. Wesley Peterson:
A note on permutation modulation. IEEE Trans. Inf. Theory 43(1): 359-360 (1997) - 1995
- [j15]W. Wesley Peterson:
Variance of Storage Requirements for B+-trees. Acta Informatica 32(7): 611-625 (1995)
1970 – 1979
- 1973
- [j14]W. Wesley Peterson, Tadao Kasami, Nobuki Tokura:
On the Capabilities of While, Repeat, and Exit Statements. Commun. ACM 16(8): 503-512 (1973)
1960 – 1969
- 1969
- [j13]C. L. Chen, W. Wesley Peterson, E. J. Weldon Jr.:
Some Results on Quasi-Cyclic Codes. Inf. Control. 15(5): 407-423 (1969) - 1968
- [j12]Tadao Kasami, Shu Lin, W. Wesley Peterson:
New generalizations of the Reed-Muller codes-I: Primitive codes. IEEE Trans. Inf. Theory 14(2): 189-199 (1968) - [j11]Tadao Kasami, Shu Lin, W. Wesley Peterson:
Polynomial codes. IEEE Trans. Inf. Theory 14(6): 807-814 (1968) - 1967
- [j10]Tadao Kasami, Shu Lin, W. Wesley Peterson:
Some Results on Cyclic Codes which Are Invariant under the Affine Group and Their Application. Inf. Control. 11(5/6): 475-496 (1967) - 1963
- [j9]W. Wesley Peterson, James L. Massey:
Coding theory. IEEE Trans. Inf. Theory 9(4): 223-229 (1963) - 1962
- [j8]W. Wesley Peterson:
Bounds for error-correcting codes (Corresp.). IRE Trans. Inf. Theory 8(1): 60 (1962) - 1960
- [j7]Daniel Gorenstein, W. Wesley Peterson, Neal Zierler:
Two-Error Correcting Bose-Chaudhuri Codes are Quasi-Perfect. Inf. Control. 3(3): 291-294 (1960) - [j6]W. Wesley Peterson:
Encoding and error-correction procedures for the Bose-Chaudhuri codes. IRE Trans. Inf. Theory 6(4): 459-470 (1960)
1950 – 1959
- 1959
- [j5]W. Wesley Peterson, Michael O. Rabin:
On Codes for Checking Logical Operations. IBM J. Res. Dev. 3(2): 163-168 (1959) - [j4]A. B. Fontaine, W. Wesley Peterson:
Group code equivalence and optimum codes. IRE Trans. Inf. Theory 5(5): 60-70 (1959) - 1958
- [j3]W. Wesley Peterson:
On Checking an Adder. IBM J. Res. Dev. 2(2): 166-168 (1958) - 1957
- [j2]W. Wesley Peterson:
Addressing for Random-Access Storage. IBM J. Res. Dev. 1(2): 130-146 (1957) - 1954
- [j1]W. Wesley Peterson, Theodore G. Birdsall, William C. Fox:
The theory of signal detectability. Trans. IRE Prof. Group Inf. Theory 4: 171-212 (1954)
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-05-02 20:59 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: