Dissertation · 1998

Universal Data Compression Algorithms for Stationary Ergodic Sources Based on the Complexity of Sequences

純 村松

Published 1 January 1998 · DOI 10.11501/3137943

View at the publisherCite this paper

In brief

“Universal Data Compression Algorithms for Stationary Ergodic Sources Based on the Complexity of Sequences” is a 1998 dissertation by 純 村松. OpenAlex counts 8 citations as of 16 November 2026. The publisher's version is not open access, and OpenAlex records no free legal copy.

Citations
8
Authors
1

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

村松, 純. (1998). Universal Data Compression Algorithms for Stationary Ergodic Sources Based on the Complexity of Sequences. https://doi.org/10.11501/3137943

MLA 9

村松, 純. “Universal Data Compression Algorithms for Stationary Ergodic Sources Based on the Complexity of Sequences.” 1998. https://doi.org/10.11501/3137943.

Chicago

村松, 純. 1998. “Universal Data Compression Algorithms for Stationary Ergodic Sources Based on the Complexity of Sequences.” https://doi.org/10.11501/3137943.

Harvard

村松, 純. (1998) ‘Universal Data Compression Algorithms for Stationary Ergodic Sources Based on the Complexity of Sequences’. doi:10.11501/3137943.

IEEE

純. 村松, “Universal Data Compression Algorithms for Stationary Ergodic Sources Based on the Complexity of Sequences,” 1998, doi: 10.11501/3137943.

BibTeX

@phdthesis{1998universal,
  title     = {{Universal Data Compression Algorithms for Stationary Ergodic Sources Based on the Complexity of Sequences}},
  author    = {村松, 純},
  year      = {1998},
  doi       = {10.11501/3137943},
  url       = {https://doi.org/10.11501/3137943}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Topic and keywords

Physical Sciences › Mathematics › Theoretical Computer Science › Algorithms and Data Compression

  • universal compression
  • stationary ergodic sources
  • sequence complexity
  • source coding
  • information theory

Work with this paper

Most-cited papers in Mathematics

All highly cited Mathematics papers

Questions about this paper

How do I cite this paper in APA style?

村松, 純. (1998). Universal Data Compression Algorithms for Stationary Ergodic Sources Based on the Complexity of Sequences. https://doi.org/10.11501/3137943

How many times has this paper been cited?

8 times, according to OpenAlex on 16 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.

Is this paper free to read?

OpenAlex records no free legal copy. Check your library's access, the authors' pages or a repository, or ask the corresponding author for a copy.

Who wrote this paper?

純 村松.

What is the DOI of this paper?

10.11501/3137943. The permanent link is https://doi.org/10.11501/3137943.

Bibliographic data from OpenAlex (CC0), last checked 16 November 2026. ResearchGuru does not host this paper; the links go to the publisher or the repository that does.