Binary Compression / Decompression Method

A binary data compression/decompression method is disclosed, where any input binary data string (IFDS) is uniquely and reversibly compressed/decompressed without any data loss, by first transforming the IFDS in well defined variable length binary constructs using well defined criteria and procedure,...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Secareanu, Radu Mircea
Format: Patent
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Secareanu, Radu Mircea
description A binary data compression/decompression method is disclosed, where any input binary data string (IFDS) is uniquely and reversibly compressed/decompressed without any data loss, by first transforming the IFDS in well defined variable length binary constructs using well defined criteria and procedure, followed by partitioning the IFDS in IFDS slices of optimal sizes based on well defined criteria, where each IFDS slice is individually compressed according to three independent schemes and several extensions that are all based on mathematical description of well defined relationships noted within the content of such an IFDS slice in term of specific binary constructs, leading to unique identifiable binary entities that are used to generate compression gain by reassignment of specific well defined parts of the data constructs within the subject IFDS slice, where such compressed IFDS slices are assembled in the same original slice order as found in the original uncompressed IFDS, creating the full compressed IFDS, where an unlimited but defined number of such compression cycles are executed until the desired final file size is achieved.
format Patent
fullrecord <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US2023253982A1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US2023253982A1</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US2023253982A13</originalsourceid><addsrcrecordid>eNrjZNB0ysxLLKpUcM7PLShKLS7OzM9T0FdwSU1G4vumlmTkp_AwsKYl5hSn8kJpbgZlN9cQZw_d1IL8-NTigsTk1LzUkvjQYCMDI2MjU2NLCyNHQ2PiVAEAiuspbg</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Binary Compression / Decompression Method</title><source>esp@cenet</source><creator>Secareanu, Radu Mircea</creator><creatorcontrib>Secareanu, Radu Mircea</creatorcontrib><description>A binary data compression/decompression method is disclosed, where any input binary data string (IFDS) is uniquely and reversibly compressed/decompressed without any data loss, by first transforming the IFDS in well defined variable length binary constructs using well defined criteria and procedure, followed by partitioning the IFDS in IFDS slices of optimal sizes based on well defined criteria, where each IFDS slice is individually compressed according to three independent schemes and several extensions that are all based on mathematical description of well defined relationships noted within the content of such an IFDS slice in term of specific binary constructs, leading to unique identifiable binary entities that are used to generate compression gain by reassignment of specific well defined parts of the data constructs within the subject IFDS slice, where such compressed IFDS slices are assembled in the same original slice order as found in the original uncompressed IFDS, creating the full compressed IFDS, where an unlimited but defined number of such compression cycles are executed until the desired final file size is achieved.</description><language>eng</language><subject>BASIC ELECTRONIC CIRCUITRY ; CODE CONVERSION IN GENERAL ; CODING ; DECODING ; ELECTRIC COMMUNICATION TECHNIQUE ; ELECTRICITY ; TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</subject><creationdate>2023</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20230810&amp;DB=EPODOC&amp;CC=US&amp;NR=2023253982A1$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,776,881,25542,76290</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20230810&amp;DB=EPODOC&amp;CC=US&amp;NR=2023253982A1$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>Secareanu, Radu Mircea</creatorcontrib><title>Binary Compression / Decompression Method</title><description>A binary data compression/decompression method is disclosed, where any input binary data string (IFDS) is uniquely and reversibly compressed/decompressed without any data loss, by first transforming the IFDS in well defined variable length binary constructs using well defined criteria and procedure, followed by partitioning the IFDS in IFDS slices of optimal sizes based on well defined criteria, where each IFDS slice is individually compressed according to three independent schemes and several extensions that are all based on mathematical description of well defined relationships noted within the content of such an IFDS slice in term of specific binary constructs, leading to unique identifiable binary entities that are used to generate compression gain by reassignment of specific well defined parts of the data constructs within the subject IFDS slice, where such compressed IFDS slices are assembled in the same original slice order as found in the original uncompressed IFDS, creating the full compressed IFDS, where an unlimited but defined number of such compression cycles are executed until the desired final file size is achieved.</description><subject>BASIC ELECTRONIC CIRCUITRY</subject><subject>CODE CONVERSION IN GENERAL</subject><subject>CODING</subject><subject>DECODING</subject><subject>ELECTRIC COMMUNICATION TECHNIQUE</subject><subject>ELECTRICITY</subject><subject>TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2023</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZNB0ysxLLKpUcM7PLShKLS7OzM9T0FdwSU1G4vumlmTkp_AwsKYl5hSn8kJpbgZlN9cQZw_d1IL8-NTigsTk1LzUkvjQYCMDI2MjU2NLCyNHQ2PiVAEAiuspbg</recordid><startdate>20230810</startdate><enddate>20230810</enddate><creator>Secareanu, Radu Mircea</creator><scope>EVB</scope></search><sort><creationdate>20230810</creationdate><title>Binary Compression / Decompression Method</title><author>Secareanu, Radu Mircea</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US2023253982A13</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2023</creationdate><topic>BASIC ELECTRONIC CIRCUITRY</topic><topic>CODE CONVERSION IN GENERAL</topic><topic>CODING</topic><topic>DECODING</topic><topic>ELECTRIC COMMUNICATION TECHNIQUE</topic><topic>ELECTRICITY</topic><topic>TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</topic><toplevel>online_resources</toplevel><creatorcontrib>Secareanu, Radu Mircea</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Secareanu, Radu Mircea</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Binary Compression / Decompression Method</title><date>2023-08-10</date><risdate>2023</risdate><abstract>A binary data compression/decompression method is disclosed, where any input binary data string (IFDS) is uniquely and reversibly compressed/decompressed without any data loss, by first transforming the IFDS in well defined variable length binary constructs using well defined criteria and procedure, followed by partitioning the IFDS in IFDS slices of optimal sizes based on well defined criteria, where each IFDS slice is individually compressed according to three independent schemes and several extensions that are all based on mathematical description of well defined relationships noted within the content of such an IFDS slice in term of specific binary constructs, leading to unique identifiable binary entities that are used to generate compression gain by reassignment of specific well defined parts of the data constructs within the subject IFDS slice, where such compressed IFDS slices are assembled in the same original slice order as found in the original uncompressed IFDS, creating the full compressed IFDS, where an unlimited but defined number of such compression cycles are executed until the desired final file size is achieved.</abstract><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language eng
recordid cdi_epo_espacenet_US2023253982A1
source esp@cenet
subjects BASIC ELECTRONIC CIRCUITRY
CODE CONVERSION IN GENERAL
CODING
DECODING
ELECTRIC COMMUNICATION TECHNIQUE
ELECTRICITY
TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION
title Binary Compression / Decompression Method
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-03T01%3A52%3A44IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-epo_EVB&rft_val_fmt=info:ofi/fmt:kev:mtx:patent&rft.genre=patent&rft.au=Secareanu,%20Radu%20Mircea&rft.date=2023-08-10&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS2023253982A1%3C/epo_EVB%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true