Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/ ZENODOarrow_drop_down
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
ZENODO
Article . 2021
License: CC BY
Data sources: Datacite
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
ZENODO
Conference object . 2021
License: CC BY
Data sources: ZENODO
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
ZENODO
Article . 2021
License: CC BY
Data sources: Datacite
versions View all 2 versions
addClaim

The method of reducing data redundancy using a randomization procedure

Authors: Lazarovych, Ihor; Kuz, Mykola; Kozlenko, Mykola; Tkachuk, Valerii; Dutchak, Mariia;

The method of reducing data redundancy using a randomization procedure

Abstract

{"references": ["A. Hanumanthaiah, A. Gopinath, C. Arun, B. Hariharan and R. Murugan, \"Comparison of Lossless Data Compression Techniques in Low-Cost Low-Power (LCLP) IoT Systems,\" 2019 9th International Symposium on Embedded Computing and System Design (ISED), Kollam, India, 2019, pp. 1-5, doi: 10.1109/ISED48680.2019.9096229", "Gopinath, Athira, \u0456 M. Ravisankar. \"Comparison of Lossless Data Compression Techniques\". 2020 International Conference on Inventive Computation Technologies (ICICT), IEEE, 2020, \u0441. 628\u201333. DOI.org (Crossref), doi:10.1109/ICICT48043.2020.9112516", "Lazarowych \u0406.\u041c. \"Randomization \u2013 perspective direction of digital data processing development and constructing of special processors in computer systems\". Proc. of the International Conf. TCSET'2004., Lviv-Slavsko, Ukraine.-2004., P.403-404", "M. Kozlenko and M. Kuz, \"Joint capturing of readouts of household power supply meters,\" 2016 13th International Conference on Modern Problems of Radio Engineering, Telecommunications and Computer Science (TCSET), Lviv, Ukraine, 2016, pp. 755-757, doi: 10.1109/TCSET.2016.7452172", "John Edward Crosbie, Anoop Balakrishnan and others. \"System and method for adaptive compression\" Patent: US8949466B1, License USPTO TOS. 2015", "K. Hua, H. Wang, W. Wang and S. Wu, \"Adaptive Data Compression in Wireless Body Sensor Networks,\" 2010 13th IEEE International Conference on Computational Science and Engineering, Hong Kong, China, 2010, pp. 1-5, doi: 10.1109/CSE.2010.65", "S. Melnychuk, I. Lazarovych and M. Kozlenko, \"Optimization of entropy estimation computing algorithm for random signals in digital communication devices,\" 2018 14th International Conference on Advanced Trends in Radioelecrtronics, Telecommunications and Computer Engineering (TCSET), Slavske, 2018, pp. 1073-1077, doi: 10.1109/TCSET.2018.8336380"]}

I. Lazarovych, M. Kuz, M. Kozlenko, V. Tkachuk, and M. Dutchak, "The method of reducing data redundancy using a randomization procedure," in Proc. 5th International Scientific and Practical Conference on Applied Scientific and Technical Research, Academy of Technical Sciences of Ukraine, Ivano-Frankivsk, Ukraine, Apr. 5-7, 2021, pp. 40-42, doi: 10.5281/zenodo.5733149

This paper proposes a method for reducing data redundancy using a randomization procedure. The method can be effectively applied before transmitting or storing information in automation systems in various fields of communication systems and networks.

Keywords

data redundancy, digital communications, randomization, data compression

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    0
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
    OpenAIRE UsageCounts
    Usage byUsageCounts
    visibility views 9
    download downloads 8
  • 9
    views
    8
    downloads
    Powered byOpenAIRE UsageCounts
Powered by OpenAIRE graph
Found an issue? Give us feedback
visibility
download
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
views
OpenAIRE UsageCountsViews provided by UsageCounts
downloads
OpenAIRE UsageCountsDownloads provided by UsageCounts
0
Average
Average
Average
9
8
Green