title: Extending the applicability of the Zipf’s laws to the sequences of byte data. Vestnik of Saint Petersburg University
metadata.name: dc.contributor.author
metadata.value: Sergeev, Sergey L.
metadata.lang: -
metadata.name: dc.contributor.author
metadata.value: Blekanov, Ivan S.
metadata.lang: -
metadata.name: dc.contributor.author
metadata.value: Ezhov, Fedor V.
metadata.lang: -
metadata.name: dc.contributor.author
metadata.value: Tarasov, Nikita A.
metadata.lang: -
metadata.name: dc.date.accessioned
metadata.value: 2024-11-22T17:18:32Z
metadata.lang: -
metadata.name: dc.date.available
metadata.value: 2024-11-22T17:18:32Z
metadata.lang: -
metadata.name: dc.date.issued
metadata.value: 2024-09
metadata.lang: -
metadata.name: dc.identifier.citation
metadata.value: Sergeev S. L., Blekanov I. S., Ezhov F. V., Tarasov N. A. Extending the applicability of the Zipf’s laws to the sequences of byte data. Vestnik of Saint Petersburg University. Applied Mathematics. Computer Science. Control Processes, 2024, vol. 20, iss. 3, pp. 391–403. https://doi.org/10.21638/spbu10.2024.307
metadata.lang: en_GB
metadata.name: dc.identifier.other
metadata.value: https://doi.org/10.21638/spbu10.2024.307
metadata.lang: -
metadata.name: dc.identifier.uri
metadata.value: http://hdl.handle.net/11701/47984
metadata.lang: -
metadata.name: dc.description.abstract
metadata.value: Zipf’s law have been shown to hold true in many places. From it’s first idea of a statistical
  phenomenon related to natural language to it’s later adaptations for economical, social and
  many other fields, it has been shown to work almost universally. In all of these cases authors
  discuss the applicability of the Zipf’s law in terms of semantically complex structures. We
  take this notion a step further and show how this law can work for data analysis, in particular
  for the sequences of byte data, obtained from various sources. We show that, using the basic
  chunking methodology, the Zipf’s law can be shown to hold true for many different types of
  raw sequences of byte data. In particular, the law holds true in all caes for the “middle point”
  of data, where it is present with a degree of certainty of more than 90 %. We conclude by
  discussing the implications and potential use cases of these findings.
metadata.lang: en_GB
metadata.name: dc.language.iso
metadata.value: en
metadata.lang: en_GB
metadata.name: dc.publisher
metadata.value: St Petersburg State University
metadata.lang: en_GB
metadata.name: dc.relation.ispartofseries
metadata.value: Vestnik of St Petersburg University. Applied Mathematics. Computer Science. Control Processes;Volume 20; Issue 3
metadata.lang: -
metadata.name: dc.subject
metadata.value: Zipf’s laws
metadata.lang: en_GB
metadata.name: dc.subject
metadata.value: byte data
metadata.lang: en_GB
metadata.name: dc.subject
metadata.value: chunking
metadata.lang: en_GB
metadata.name: dc.subject
metadata.value: frequency analysis
metadata.lang: en_GB
metadata.name: dc.title
metadata.value: Extending the applicability of the Zipf’s laws to the sequences of byte data. Vestnik of Saint Petersburg University
metadata.lang: en_GB
metadata.name: dc.type
metadata.value: Article
metadata.lang: en_GB
resources.filename: vestnik_spbu10_2024_391.pdf
resources.url: https://dspace.spbu.ru/bitstream/11701/47984/1/vestnik_spbu10_2024_391.pdf
resources.format: Adobe PDF
resources.size: 1,08 MB