default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJ. Pieter M. Schalkwijk
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1992
[j18]J. Pieter M. Schalkwijk:
Some aspects of the information theoretic dialogue. Discret. Math. 106-107: 407-413 (1992)
1980 – 1989
- 1986
- [j17]Zhen Zhang, Toby Berger, J. Pieter M. Schalkwijk:
New outer bounds to capacity regions of two-way channels. IEEE Trans. Inf. Theory 32(3): 383-386 (1986) - 1983
- [j16]J. Pieter M. Schalkwijk:
On an extension of an achievable rate region for the binary multiplying channel. IEEE Trans. Inf. Theory 29(3): 445-448 (1983) - 1982
- [j15]J. Pieter M. Schalkwijk:
The binary multiplying channel--A coding scheme that operates beyond Shannon's inner bound region. IEEE Trans. Inf. Theory 28(1): 107-110 (1982)
1970 – 1979
- 1979
- [j14]J. Pieter M. Schalkwijk, Karel A. Post, J. Aarts:
On a method of calculating the event error probability of convolutional codes with maximum likelihood decoding (Corresp.). IEEE Trans. Inf. Theory 25(6): 737-743 (1979) - 1976
- [j13]J. Pieter M. Schalkwijk, A. J. Vinck:
Syndrome Decoding of Binary Rate-1/2 Convolutional Codes. IEEE Trans. Commun. 24(9): 977-985 (1976) - 1974
- [j12]J. Pieter M. Schalkwijk:
A Coding Scheme for Duplex Channels. IEEE Trans. Commun. 22(9): 1369-1373 (1974) - [j11]J. Pieter M. Schalkwijk, Karel A. Post:
Correction to 'On the Error Probability for a class of Binary Recursive Feedback Strategies'. IEEE Trans. Inf. Theory 20(2): 284 (1974) - [j10]James C. Tiernan, J. Pieter M. Schalkwijk:
An upper bound to the capacity of the band-limited Gaussian autoregressive channel with noiseless feedback. IEEE Trans. Inf. Theory 20(3): 311-316 (1974) - 1973
- [j9]J. Pieter M. Schalkwijk, Karel A. Post:
On the error probability for a class of binary recursive feedback strategies. IEEE Trans. Inf. Theory 19(4): 498-511 (1973) - 1972
- [j8]J. Pieter M. Schalkwijk:
An algorithm for source coding. IEEE Trans. Inf. Theory 18(3): 395-399 (1972) - 1971
- [j7]J. Pieter M. Schalkwijk, Mark E. Barron:
Sequential signalling under a peak power constraint. IEEE Trans. Inf. Theory 17(3): 278-282 (1971) - [j6]J. Pieter M. Schalkwijk:
A class of simple and optimal strategies for block coding on the binary symmetric channel with noiseless feedback. IEEE Trans. Inf. Theory 17(3): 283-287 (1971) - 1970
- [j5]J. Pieter M. Schalkwijk:
Review of 'Notes on Digital Communication' (Turin, G. L.; 1969). IEEE Trans. Inf. Theory 16(4): 515 (1970)
1960 – 1969
- 1968
- [j4]J. Pieter M. Schalkwijk:
Center-of-gravity information feedback. IEEE Trans. Inf. Theory 14(2): 324-331 (1968) - 1967
- [j3]J. Pieter M. Schalkwijk, Leo I. Bluestein:
Transmission of analog waveforms through channels with feedback (Corresp.). IEEE Trans. Inf. Theory 13(4): 617-619 (1967) - 1966
- [j2]J. Pieter M. Schalkwijk, Thomas Kailath:
A coding scheme for additive noise channels with feedback-I: No bandwidth constraint. IEEE Trans. Inf. Theory 12(2): 172-182 (1966) - [j1]J. Pieter M. Schalkwijk:
A coding scheme for additive noise channels with feedback-II: Band-limited signals. IEEE Trans. Inf. Theory 12(2): 183-189 (1966)
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-09 13:07 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:
