default search action
David J. Sakrison
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1980 – 1989
- 1982
- [j19]Dimitris Anastassiou, David J. Sakrison:
Some results regarding the entropy rate of random fields. IEEE Trans. Inf. Theory 28(2): 340-343 (1982) - 1981
- [j18]Dimitris Anastassiou, David J. Sakrison:
A probability model for simple closed random curves. IEEE Trans. Inf. Theory 27(3): 376-381 (1981)
1970 – 1979
- 1979
- [j17]Dimitris Anastassiou, David J. Sakrison:
New bounds to R(D) for additive sources and applications to image encoding. IEEE Trans. Inf. Theory 25(2): 145-155 (1979) - 1977
- [j16]David J. Sakrison:
On the Role of the Observer and a Distortion Measure in Image Transmission. IEEE Trans. Commun. 25(11): 1251-1267 (1977) - [j15]Johnson K. Yan, David J. Sakrison:
Encoding of Images Based on a Two-Component Source Model. IEEE Trans. Commun. 25(11): 1315-1322 (1977) - 1975
- [j14]David J. Sakrison:
Worst sources and robust codes for difference distortion measures. IEEE Trans. Inf. Theory 21(3): 301-309 (1975) - 1974
- [j13]James L. Mannos, David J. Sakrison:
The effects of a visual fidelity criterion of the encoding of images. IEEE Trans. Inf. Theory 20(4): 525-536 (1974) - 1971
- [j12]David J. Sakrison, V. Ralph Algazi:
Comparison of line-by-line and two-dimensional encoding of random images. IEEE Trans. Inf. Theory 17(4): 386-398 (1971) - 1970
- [j11]Warren Y. Dere, David J. Sakrison:
Berkeley Array Processor. IEEE Trans. Computers 19(5): 444-447 (1970) - [j10]David J. Sakrison:
The rate of a class of random processes. IEEE Trans. Inf. Theory 16(1): 10-16 (1970)
1960 – 1969
- 1969
- [j9]David J. Sakrison:
The Rate Distortion Function for a Class of Sources. Inf. Control. 15(2): 165-195 (1969) - [j8]V. Ralph Algazi, David J. Sakrison:
On the optimality of the Karhunen-Loève expansion (Corresp.). IEEE Trans. Inf. Theory 15(2): 319-321 (1969) - [j7]David J. Sakrison:
An extension of the theorem of Kac, Murdock and Szegö to N dimensions (Corresp.). IEEE Trans. Inf. Theory 15(5): 608-610 (1969) - [j6]David J. Sakrison:
Addendum to 'The Rate Distortion Function of a Gaussian Process with a weighted-square Error Criterion'. IEEE Trans. Inf. Theory 15(5): 610-611 (1969) - 1968
- [j5]David J. Sakrison:
Source encoding in the presence of random disturbance (Corresp.). IEEE Trans. Inf. Theory 14(1): 165-167 (1968) - [j4]David J. Sakrison:
A geometric treatment of the source encoding of a Gaussian random variable. IEEE Trans. Inf. Theory 14(3): 481-486 (1968) - [j3]David J. Sakrison:
The rate distortion function of a Gaussian process with a weighted square error criterion (Corresp.). IEEE Trans. Inf. Theory 14(3): 506-508 (1968) - 1966
- [j2]David J. Sakrison:
Efficient recursive estimation of the parameters of a radar or radio astronomy target. IEEE Trans. Inf. Theory 12(1): 35-41 (1966) - 1963
- [j1]David J. Sakrison:
Iterative design of optimum filters for non mean-square-error performance criteria. IEEE Trans. Inf. Theory 9(3): 161-167 (1963)
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-04-25 05:41 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: