Data positioning as an instrument of constructive data compression
A fundamentally new algorithm for data compression is considered. A theoretical basis is provided for the formation, modification, and conversion of data positions aimed at their reversible compression. The specifics are described of a method development based on structure encryption, i.e., reformat...
Uložené v:
| Vydané v: | Automatic control and computer sciences Ročník 46; číslo 5; s. 223 - 231 |
|---|---|
| Hlavný autor: | |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Heidelberg
Allerton Press, Inc
01.09.2012
|
| Predmet: | |
| ISSN: | 0146-4116, 1558-108X |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | A fundamentally new algorithm for data compression is considered. A theoretical basis is provided for the formation, modification, and conversion of data positions aimed at their reversible compression. The specifics are described of a method development based on structure encryption, i.e., reformatting the architecture of the compressed data alphabet based on the positionality and conditionality properties of the compression level and the structural numbering of the reformatted alphabet’s architecture in a positional multilevel space. We substantiate the principle of redundancy reduction due to the following: the simultaneous modification of the positions inhibiting the appearance of noninteger values of new positions and constraints on the digit capacity of the elements in positioning arrays, the identification of the carriers of stabilizing elements in the digital space, and the reduction of the positions with code combinations in the course of the array processing. A particular case of a data conversion protocol is presented. Problems are solved of combining the principles of data reversibility and supercompression both in the modes of single and multiple use of one and the same encryption scenario. The cost of the positioning processes and their influence on the efficiency of the processes of the data encoding and decoding have been determined. |
|---|---|
| AbstractList | A fundamentally new algorithm for data compression is considered. A theoretical basis is provided for the formation, modification, and conversion of data positions aimed at their reversible compression. The specifics are described of a method development based on structure encryption, i.e., reformatting the architecture of the compressed data alphabet based on the positionality and conditionality properties of the compression level and the structural numbering of the reformatted alphabet’s architecture in a positional multilevel space. We substantiate the principle of redundancy reduction due to the following: the simultaneous modification of the positions inhibiting the appearance of noninteger values of new positions and constraints on the digit capacity of the elements in positioning arrays, the identification of the carriers of stabilizing elements in the digital space, and the reduction of the positions with code combinations in the course of the array processing. A particular case of a data conversion protocol is presented. Problems are solved of combining the principles of data reversibility and supercompression both in the modes of single and multiple use of one and the same encryption scenario. The cost of the positioning processes and their influence on the efficiency of the processes of the data encoding and decoding have been determined. |
| Author | Kasumov, N. K. |
| Author_xml | – sequence: 1 givenname: N. K. surname: Kasumov fullname: Kasumov, N. K. email: namik0459@gmail.com organization: Institute of Information Technologies, National Academy of Sciences of Azerbaijan |
| BookMark | eNp9kE1LxDAQhoOsYHf1B3jLH6jOJP1Ij7rqKix4UMFbSdNkyWKTknQF_72p603wNAzPPMPLuyQL550m5BLhiiPw6xfAoioQK2RQAnB-QjIsS5EjiPcFyWacz_yMLGPcAyQmqozc3slJ0tFHO1nvrNtRGal01Lo4hcOg3US9ocr_rGqyn5r2s6H8MAYdY5LOyamRH1Ff_M4VeXu4f10_5tvnzdP6ZpsrVsCUi65pyj7FQMP6BnVVKV5LobjAAk0nOs245qozdceBSZSVYY3mtWJQF7XkfEXw-FcFH2PQph2DHWT4ahHauYT2TwnJYUcnplu306Hd-0NwKeY_0jcHYmAy |
| Cites_doi | 10.1109/MC.1984.1659158 10.1145/103085.103089 10.1002/j.1538-7305.1948.tb00917.x 10.1109/JRPROC.1952.273898 10.3103/S0146411610050056 10.1201/9781420040760 10.1109/TIT.1980.1056237 10.1007/978-1-4757-2361-8 10.17487/rfc1505 10.1109/TIT.1977.1055714 10.1147/rd.232.0149 |
| ContentType | Journal Article |
| Copyright | Allerton Press, Inc. 2012 |
| Copyright_xml | – notice: Allerton Press, Inc. 2012 |
| DBID | AAYXX CITATION |
| DOI | 10.3103/S0146411612050033 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science |
| EISSN | 1558-108X |
| EndPage | 231 |
| ExternalDocumentID | 10_3103_S0146411612050033 |
| GroupedDBID | -59 -5G -BR -EM -Y2 -~C -~X .86 .VR 06D 0R~ 0VY 1N0 23N 2J2 2JN 2JY 2KG 2KM 2LR 2VQ 2~H 30V 4.4 408 40D 40E 5GY 5VS 6NX 8TC 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYZH ABAKF ABDZT ABECU ABFTD ABFTV ABHQN ABJNI ABJOX ABKCH ABMNI ABMQK ABNWP ABQBU ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABWNU ABXPI ACAOD ACBXY ACCUX ACDTI ACGFS ACHSB ACHXU ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACSNA ACZOJ ADHHG ADHIR ADINQ ADKNI ADRFC ADURQ ADYFF ADZKW AEBTG AEFQL AEGAL AEGNC AEJHL AEJRE AEMSY AEOHA AEPYU AETLH AEVLU AEXYK AFBBN AFFNX AFGCZ AFLOW AFQWF AFWTZ AFZKB AGAYW AGDGC AGJBK AGMZJ AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHSBF AI. AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARMRJ AXYYD B-. BA0 BDATZ BGNMA CAG COF CS3 DDRTE DNIVK DPUIP EBLON EBS EIOEI EJD ESBYG FERAY FFXSO FIGPU FINBP FNLPD FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNWQR GQ6 GQ7 H13 HF~ HG6 HLICF HMJXF HRMNR HZ~ IJ- IKXTQ IWAJR I~X I~Z J-C JBSCW JZLTJ KOV LLZTM M4Y MA- NPVJJ NQJWS NU0 O9- O93 O9J P9O PF0 PT4 QOS R89 R9I RNS ROL RPX RSV S16 S1Z S27 S3B SAP SCO SDH SHX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 TN5 TSG TUC U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW VH1 W48 WK8 XU3 YLTOR Z7R Z83 Z88 ZMTXR ~A9 AAPKM AAYXX ABDBE ABFSG ABJCF ABRTQ ACSTC AEZWR AFDZB AFFHD AFHIU AFKRA AFOHR AHPBZ AHWEU AIXLP ARAPS ATHPR BENPR BGLVJ CCPQU CITATION HCIFZ K7- M7S PHGZM PHGZT PQGLB PTHSS |
| ID | FETCH-LOGICAL-c240t-8b995d1461f2d91e66c37a8c38141fb8be23e3cbf7b302a1a6f29e37c20747a33 |
| IEDL.DBID | RSV |
| ISICitedReferencesCount | 1 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000420506000006&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0146-4116 |
| IngestDate | Sat Nov 29 05:52:05 EST 2025 Fri Feb 21 02:36:34 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 5 |
| Keywords | data compression rate data positioning data supercompression data compression algorithm recompression reversible compression of the content encryption apparatus |
| Language | English |
| License | http://www.springer.com/tdm |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c240t-8b995d1461f2d91e66c37a8c38141fb8be23e3cbf7b302a1a6f29e37c20747a33 |
| PageCount | 9 |
| ParticipantIDs | crossref_primary_10_3103_S0146411612050033 springer_journals_10_3103_S0146411612050033 |
| PublicationCentury | 2000 |
| PublicationDate | 20120900 2012-9-00 |
| PublicationDateYYYYMMDD | 2012-09-01 |
| PublicationDate_xml | – month: 9 year: 2012 text: 20120900 |
| PublicationDecade | 2010 |
| PublicationPlace | Heidelberg |
| PublicationPlace_xml | – name: Heidelberg |
| PublicationTitle | Automatic control and computer sciences |
| PublicationTitleAbbrev | Aut. Control Comp. Sci |
| PublicationYear | 2012 |
| Publisher | Allerton Press, Inc |
| Publisher_xml | – name: Allerton Press, Inc |
| References | OliferV.G.OliferN.A.Komp’yuternye seti. Printsipy, tekhnologii, protokoly2006St. PetersburgPiter ZivJ.LempelA.A Universal Algorithm for Sequential Data CompressionIEEE Trans. Inf. Theory1977233373435302150379.9401010.1109/TIT.1977.1055714 WelchT.A.Technique for High-Performance Data CompressionIEEE Computer19841781910.1109/MC.1984.1659158 KouW.K.Digital Image Compression1995WashingtonSpringer-Verlag HuffmanD.A.A Method for the Construction of Minimum-Redundancy CodesProc. IRE1952401098110110.1109/JRPROC.1952.273898 SlobodyanyukA.V.Methodology of Analysis of Approaches According to Reduction of Redundancy of Images with the Different Degree of Reliability in Information-Telecommunication SystemsSist. Upr., Navigats. Zv’yazku2008KievTsNDI NU158160 Wallace, G.K., The JPEG Still Picture Compression Standard, Commun. ACM, 1991, no. 4, pp. 31–34. Kasumov, N.K., Conplex of Cryptographic Systems as Foundation for Loss-Free Data Packing, Sist. Upravl. Inform. Tekhnol., 2006, no. 3(25), pp. 74–79. StoutQ.F.Improved Prefix Encodings of the Natural NumbersIEEE Trans. Inf. Theory1980266076095839440446.9401210.1109/TIT.1980.1056237 Costanzo, A., Robinson, D., and Ullmann, R., Encoding Header Field for Internet Messages, Network Working Group J., 1993, pp. 1–36. http://portal.acm.org/citation.cfm?id=RFC1505 KasumovN.K.SuleimanovA.Sh.DamadaevM.M.New View on Compression of Information FlowsUchenye Zapiski NAA2002411115 KasumovN.K.The Universal Coding Method in the Data Compression AlgorithmAutom. Cont. Comp. Sci.20104427928610.3103/S0146411610050056 RussJ.C.The Image Processing Handbook2002New YorkCRC1204.68249 ShannonC.E.A Mathematic Theory of CommunicationsBell Syst. Techn. J.1948271062365626286 RissanenJ.LangdonG.G.Arithmetic CodingIBM J. Res. Develop.1979231491625241340404.9400510.1147/rd.232.0149 6206_CR2 J. Ziv (6206_CR9) 1977; 23 N.K. Kasumov (6206_CR15) 2010; 44 A.V. Slobodyanyuk (6206_CR3) 2008 T.A. Welch (6206_CR10) 1984; 17 6206_CR6 J. Rissanen (6206_CR11) 1979; 23 C.E. Shannon (6206_CR4) 1948; 27 N.K. Kasumov (6206_CR13) 2002; 4 V.G. Olifer (6206_CR1) 2006 6206_CR14 D.A. Huffman (6206_CR8) 1952; 40 Q.F. Stout (6206_CR12) 1980; 26 J.C. Russ (6206_CR5) 2002 W.K. Kou (6206_CR7) 1995 |
| References_xml | – reference: Costanzo, A., Robinson, D., and Ullmann, R., Encoding Header Field for Internet Messages, Network Working Group J., 1993, pp. 1–36. http://portal.acm.org/citation.cfm?id=RFC1505 – reference: KasumovN.K.The Universal Coding Method in the Data Compression AlgorithmAutom. Cont. Comp. Sci.20104427928610.3103/S0146411610050056 – reference: ZivJ.LempelA.A Universal Algorithm for Sequential Data CompressionIEEE Trans. Inf. Theory1977233373435302150379.9401010.1109/TIT.1977.1055714 – reference: SlobodyanyukA.V.Methodology of Analysis of Approaches According to Reduction of Redundancy of Images with the Different Degree of Reliability in Information-Telecommunication SystemsSist. Upr., Navigats. Zv’yazku2008KievTsNDI NU158160 – reference: RissanenJ.LangdonG.G.Arithmetic CodingIBM J. Res. Develop.1979231491625241340404.9400510.1147/rd.232.0149 – reference: KouW.K.Digital Image Compression1995WashingtonSpringer-Verlag – reference: HuffmanD.A.A Method for the Construction of Minimum-Redundancy CodesProc. IRE1952401098110110.1109/JRPROC.1952.273898 – reference: WelchT.A.Technique for High-Performance Data CompressionIEEE Computer19841781910.1109/MC.1984.1659158 – reference: StoutQ.F.Improved Prefix Encodings of the Natural NumbersIEEE Trans. Inf. Theory1980266076095839440446.9401210.1109/TIT.1980.1056237 – reference: ShannonC.E.A Mathematic Theory of CommunicationsBell Syst. Techn. J.1948271062365626286 – reference: KasumovN.K.SuleimanovA.Sh.DamadaevM.M.New View on Compression of Information FlowsUchenye Zapiski NAA2002411115 – reference: OliferV.G.OliferN.A.Komp’yuternye seti. Printsipy, tekhnologii, protokoly2006St. PetersburgPiter – reference: Wallace, G.K., The JPEG Still Picture Compression Standard, Commun. ACM, 1991, no. 4, pp. 31–34. – reference: Kasumov, N.K., Conplex of Cryptographic Systems as Foundation for Loss-Free Data Packing, Sist. Upravl. Inform. Tekhnol., 2006, no. 3(25), pp. 74–79. – reference: RussJ.C.The Image Processing Handbook2002New YorkCRC1204.68249 – ident: 6206_CR14 – volume: 4 start-page: 11 issue: 1 year: 2002 ident: 6206_CR13 publication-title: Uchenye Zapiski NAA – start-page: 158 volume-title: Sist. Upr., Navigats. Zv’yazku year: 2008 ident: 6206_CR3 – volume: 17 start-page: 8 year: 1984 ident: 6206_CR10 publication-title: IEEE Computer doi: 10.1109/MC.1984.1659158 – ident: 6206_CR2 doi: 10.1145/103085.103089 – volume: 27 start-page: 623 issue: 10 year: 1948 ident: 6206_CR4 publication-title: Bell Syst. Techn. J. doi: 10.1002/j.1538-7305.1948.tb00917.x – volume: 40 start-page: 1098 year: 1952 ident: 6206_CR8 publication-title: Proc. IRE doi: 10.1109/JRPROC.1952.273898 – volume-title: Komp’yuternye seti. Printsipy, tekhnologii, protokoly year: 2006 ident: 6206_CR1 – volume: 44 start-page: 279 year: 2010 ident: 6206_CR15 publication-title: Autom. Cont. Comp. Sci. doi: 10.3103/S0146411610050056 – volume-title: The Image Processing Handbook year: 2002 ident: 6206_CR5 doi: 10.1201/9781420040760 – volume: 26 start-page: 607 year: 1980 ident: 6206_CR12 publication-title: IEEE Trans. Inf. Theory doi: 10.1109/TIT.1980.1056237 – volume-title: Digital Image Compression year: 1995 ident: 6206_CR7 doi: 10.1007/978-1-4757-2361-8 – ident: 6206_CR6 doi: 10.17487/rfc1505 – volume: 23 start-page: 337 year: 1977 ident: 6206_CR9 publication-title: IEEE Trans. Inf. Theory doi: 10.1109/TIT.1977.1055714 – volume: 23 start-page: 149 year: 1979 ident: 6206_CR11 publication-title: IBM J. Res. Develop. doi: 10.1147/rd.232.0149 |
| SSID | ssj0055886 |
| Score | 1.8353676 |
| Snippet | A fundamentally new algorithm for data compression is considered. A theoretical basis is provided for the formation, modification, and conversion of data... |
| SourceID | crossref springer |
| SourceType | Index Database Publisher |
| StartPage | 223 |
| SubjectTerms | Computer Science Control Structures and Microprogramming |
| Title | Data positioning as an instrument of constructive data compression |
| URI | https://link.springer.com/article/10.3103/S0146411612050033 |
| Volume | 46 |
| WOSCitedRecordID | wos000420506000006&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAVX databaseName: Springer LINK customDbUrl: eissn: 1558-108X dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0055886 issn: 0146-4116 databaseCode: RSV dateStart: 20070201 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LS8QwEB509aAHV1fF9UUOnpRgm7RpcvS1eJBFfCx7K0magJeu2GV_v0nagIt60GsYQhky-WYyX78BOFNcGCUtx9bl1v61SmMhM4m1FdYBUsGrIFY9eSjGYz6disfuP-4mst1jSzLc1KGuTOilpyGxLHUZCklyP4JsFdYc2nEfjU_Pk3j95jkP4x29NfbmbSvz5y2WwWi5ExoAZtT_16dtw1aXT6Kr9gDswIqpB9CPsxpQF7oD2PwiPLgL17dyLlEkbLklJBska_QW9GT9gyGaWaRnUV52YZCnkiJPQG-Js_UevI7uXm7ucTdNAWuH2nPMlRB55cd4W1KJ1DCmaSG5dpCdpVZxZQg1VCtbKJoQmUpmiTC00MRr7EtK96FXz2pzAIhppk1OfSlksypnUjMqjUikcMVeIvQQzqNby_dWNKN0xYb3VfnNV0O4iE4tu_hpfrc-_JP1EWy4BIe0nLBj6DmfmRNY14v5W_NxGs7NJ3n8upE |
| linkProvider | Springer Nature |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3PS8MwFH7oFNSD06k4f-bgSSm2TZsmR3-NiXOIzrFbSdIEdunEjv39JmkDinrQa3mU8kjyvZf39fsAzgRlSnBNA21qa3tbJQPGEx5IzbQBpIwWTqx6PMiGQzqZsKfmP-7Ks939SNKd1K6vDPGlpSGRJDIVShym1oJsGVYSA1iWx_f8MvbHb5pSZ-9oowMbXo8yf37FVzD6Ogl1ANNr_-vTtmCzqSfRVb0AtmFJlR1oe68G1GzdDmx8Eh7cgetbPufIE7bMI8QrxEs0dXqy9sIQzTSSMy8vu1DIUkmRJaDXxNlyF157d6ObftC4KQTSoPY8oIKxtLA23jouWKQIkTjjVBrITiItqFAxVlgKnQkcxjziRMdM4UzGVmOfY7wHrXJWqn1ARBKpUmxbIZ0UKeGSYK5YyJlp9kImu3Du05q_1aIZuWk2bK7yb7nqwoVPat7sn-r36IM_RZ_CWn_0OMgH98OHQ1g3xU5c88OOoGXyp45hVS7m0-r9xK2hD0PAvXU |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3PS8MwFH7oFNGD8yfOnzl4Usrapk2TozqH4hgDdexW0jSBXbphx_5-89oGHOpBvJZHKY8k33t5X78P4DrjQmfScM_Y2hpvq5QnZCQ9ZYSxgJTwvBKrHg-S4ZBPJmLU-JyWju3uRpL1Pw2o0lQsuvPcdKse06ddpCSxKLDVSujHaEe2DhsRegZhu_46dkdxHPPK6hGjPQyvx5o_v2IVmFanohXY9Nv__sw92G3qTHJXL4x9WNPFAbSdhwNptvQB7HwRJDyE-55cSOKIXPYRkSWRBZlWOrN4kUhmhqiZk51daoIUU4LE9JpQWxzBe__x7eHJa1wWPGXRfOHxTIg4R3tvE-Yi0IwpmkiuLJRHgcl4pkOqqcpMklE_lIFkJhSaJipE7X1J6TG0ilmhT4AwxZSOKbZIJspjJhWjUgtfCtsE-kJ14MalOJ3XYhqpbUIwV-m3XHXg1iU4bfZV-Xv06Z-ir2Br1Oung-fhyxls2xoorGlj59Cy6dMXsKmWi2n5cVktp09FDcZZ |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Data+positioning+as+an+instrument+of+constructive+data+compression&rft.jtitle=Automatic+control+and+computer+sciences&rft.au=Kasumov%2C+N.+K.&rft.date=2012-09-01&rft.pub=Allerton+Press%2C+Inc&rft.issn=0146-4116&rft.eissn=1558-108X&rft.volume=46&rft.issue=5&rft.spage=223&rft.epage=231&rft_id=info:doi/10.3103%2FS0146411612050033&rft.externalDocID=10_3103_S0146411612050033 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0146-4116&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0146-4116&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0146-4116&client=summon |