Harry H. Tan

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▷ joint publications with Kung Yao

> Home > Persons > Harry H. Tan

Publications

1978
[j8]
- view
  authority control:
- export record
  dblp key:
  - journals/tit/YaoT78
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tit/YaoT78
Kung Yao, Harry H. Tan:
Absolute error rate-distortion functions for sources with constrained magnitudes (Corresp.). IEEE Trans. Inf. Theory 24(4): 499-503 (1978)
1975
[j5]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/iandc/TanY75
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iandc/TanY75
Harry H. Tan, Kung Yao:
Rate Distortion Functions of Countably Infinite Alphabet Memoryless Sources. Inf. Control. 27(3): 272-288 (1975)
[j3]
- view
  authority control:
- export record
  dblp key:
  - journals/tit/TanY75
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tit/TanY75
Harry H. Tan, Kung Yao:
Evaluation of rate-distortion functions for a class of independent identically distributed sources under an absolute-magnitude criterion. IEEE Trans. Inf. Theory 21(1): 59-64 (1975)
1973
[j1]
- view
  authority control:
- export record
  dblp key:
  - journals/tit/YaoT73
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tit/YaoT73
Kung Yao, Harry H. Tan:
Some comments on the generalized Shannon lower bound for stationary finite-alphabet sources with memory (Corresp.). IEEE Trans. Inf. Theory 19(6): 815-817 (1973)

a service of

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.