Universal triple encoding for compression and protecting binary data

The paper is devoted to the actual problem of compression of processed and transmitted data, as well as of the data storage and protection. The analysis and features of data compression methods are presented. The method of universal coding by triples of binary sets (CT) is considered. The method is...
Ausführliche Beschreibung

Gespeichert in:

Autor*in:	Victor A. Shurygin [verfasserIn] Igor M. Yadykin [verfasserIn]

Format:	E-Artikel
Sprache:	Englisch ; Russisch

Erschienen:	2021

Schlagwörter:	data compression, encoding, data storage, data protection, recurrence relation, lossless compression.

Übergeordnetes Werk:	In: Безопасность информационных технологий - Joint Stock Company "Experimental Scientific and Production Association SPELS, 2017, 28(2021), 1, Seite 6-18
Übergeordnetes Werk:	volume:28 ; year:2021 ; number:1 ; pages:6-18

Links:	Link aufrufen Link aufrufen Link aufrufen Journal toc Journal toc

DOI / URN:	10.26583/bit.2021.1.01

Katalog-ID:	DOAJ071891366

Internformat


LEADER	01000caa a22002652 4500
001	DOAJ071891366
003	DE-627
005	20230309103904.0
007	cr uuu---uuuuu
008	230228s2021 xx \|\|\|\|\|o 00\| \|\|eng c
024	7		\|a 10.26583/bit.2021.1.01 \|2 doi
035			\|a (DE-627)DOAJ071891366
035			\|a (DE-599)DOAJ84f0eca9fd274fba8301346dbea10c10
040			\|a DE-627 \|b ger \|c DE-627 \|e rakwb
041			\|a eng \|a rus
050		0	\|a T58.5-58.64
050		0	\|a Q350-390
100	0		\|a Victor A. Shurygin \|e verfasserin \|4 aut
245	1	0	\|a Universal triple encoding for compression and protecting binary data
264		1	\|c 2021
336			\|a Text \|b txt \|2 rdacontent
337			\|a Computermedien \|b c \|2 rdamedia
338			\|a Online-Ressource \|b cr \|2 rdacarrier
520			\|a The paper is devoted to the actual problem of compression of processed and transmitted data, as well as of the data storage and protection. The analysis and features of data compression methods are presented. The method of universal coding by triples of binary sets (CT) is considered. The method is intended for lossless compression of binary data under conditions of unknown message source statistics. The method is based on dividing the original sequence of binary data into blocks of length n. Based on the analysis of the contents of the n–block, three parameters are assigned to each block: the number of units in the block, the sum of the unit position numbers, and the number of this particular combination in the corresponding prefix class. Approaches to reducing the complexity of procedures for calculating the parameters of CT are considered. A tabular algorithm for calculating coefficients and an algorithm for filling table rows using a recursive relation for elements of sets and an estimate of the amount of memory for storing tables as well as the ways to reduce the memory capacity are presented. The dependence of the bit width of the QT codewords on the bit width of n-blocks is considered. The approaches and features of the use of coding by triplets for information protection are analyzed.
650		4	\|a data compression, encoding, data storage, data protection, recurrence relation, lossless compression.
653		0	\|a Information technology
653		0	\|a Information theory
700	0		\|a Igor M. Yadykin \|e verfasserin \|4 aut
773	0	8	\|i In \|t Безопасность информационных технологий \|d Joint Stock Company "Experimental Scientific and Production Association SPELS, 2017 \|g 28(2021), 1, Seite 6-18 \|w (DE-627)81958147X \|w (DE-600)2813556-8 \|x 20747136 \|7 nnns
773	1	8	\|g volume:28 \|g year:2021 \|g number:1 \|g pages:6-18
856	4	0	\|u https://doi.org/10.26583/bit.2021.1.01 \|z kostenfrei
856	4	0	\|u https://doaj.org/article/84f0eca9fd274fba8301346dbea10c10 \|z kostenfrei
856	4	0	\|u https://bit.mephi.ru/index.php/bit/article/view/1315 \|z kostenfrei
856	4	2	\|u https://doaj.org/toc/2074-7128 \|y Journal toc \|z kostenfrei
856	4	2	\|u https://doaj.org/toc/2074-7136 \|y Journal toc \|z kostenfrei
912			\|a GBV_USEFLAG_A
912			\|a SYSFLAG_A
912			\|a GBV_DOAJ
912			\|a GBV_ILN_11
912			\|a GBV_ILN_20
912			\|a GBV_ILN_22
912			\|a GBV_ILN_23
912			\|a GBV_ILN_24
912			\|a GBV_ILN_31
912			\|a GBV_ILN_39
912			\|a GBV_ILN_40
912			\|a GBV_ILN_60
912			\|a GBV_ILN_62
912			\|a GBV_ILN_63
912			\|a GBV_ILN_65
912			\|a GBV_ILN_69
912			\|a GBV_ILN_70
912			\|a GBV_ILN_73
912			\|a GBV_ILN_95
912			\|a GBV_ILN_105
912			\|a GBV_ILN_110
912			\|a GBV_ILN_151
912			\|a GBV_ILN_161
912			\|a GBV_ILN_170
912			\|a GBV_ILN_213
912			\|a GBV_ILN_230
912			\|a GBV_ILN_285
912			\|a GBV_ILN_293
912			\|a GBV_ILN_370
912			\|a GBV_ILN_602
912			\|a GBV_ILN_2014
912			\|a GBV_ILN_4012
912			\|a GBV_ILN_4037
912			\|a GBV_ILN_4112
912			\|a GBV_ILN_4125
912			\|a GBV_ILN_4126
912			\|a GBV_ILN_4249
912			\|a GBV_ILN_4305
912			\|a GBV_ILN_4306
912			\|a GBV_ILN_4307
912			\|a GBV_ILN_4313
912			\|a GBV_ILN_4322
912			\|a GBV_ILN_4323
912			\|a GBV_ILN_4324
912			\|a GBV_ILN_4325
912			\|a GBV_ILN_4326
912			\|a GBV_ILN_4335
912			\|a GBV_ILN_4338
912			\|a GBV_ILN_4367
912			\|a GBV_ILN_4700
951			\|a AR
952			\|d 28 \|j 2021 \|e 1 \|h 6-18

Indexfelder

author_variant	v a s vas i m y imy
matchkey_str	article:20747136:2021----::nvratilecdnfropesoadrt
hierarchy_sort_str	2021
callnumber-subject-code	T
publishDate	2021
allfields	10.26583/bit.2021.1.01 doi (DE-627)DOAJ071891366 (DE-599)DOAJ84f0eca9fd274fba8301346dbea10c10 DE-627 ger DE-627 rakwb eng rus T58.5-58.64 Q350-390 Victor A. Shurygin verfasserin aut Universal triple encoding for compression and protecting binary data 2021 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier The paper is devoted to the actual problem of compression of processed and transmitted data, as well as of the data storage and protection. The analysis and features of data compression methods are presented. The method of universal coding by triples of binary sets (CT) is considered. The method is intended for lossless compression of binary data under conditions of unknown message source statistics. The method is based on dividing the original sequence of binary data into blocks of length n. Based on the analysis of the contents of the n–block, three parameters are assigned to each block: the number of units in the block, the sum of the unit position numbers, and the number of this particular combination in the corresponding prefix class. Approaches to reducing the complexity of procedures for calculating the parameters of CT are considered. A tabular algorithm for calculating coefficients and an algorithm for filling table rows using a recursive relation for elements of sets and an estimate of the amount of memory for storing tables as well as the ways to reduce the memory capacity are presented. The dependence of the bit width of the QT codewords on the bit width of n-blocks is considered. The approaches and features of the use of coding by triplets for information protection are analyzed. data compression, encoding, data storage, data protection, recurrence relation, lossless compression. Information technology Information theory Igor M. Yadykin verfasserin aut In Безопасность информационных технологий Joint Stock Company "Experimental Scientific and Production Association SPELS, 2017 28(2021), 1, Seite 6-18 (DE-627)81958147X (DE-600)2813556-8 20747136 nnns volume:28 year:2021 number:1 pages:6-18 https://doi.org/10.26583/bit.2021.1.01 kostenfrei https://doaj.org/article/84f0eca9fd274fba8301346dbea10c10 kostenfrei https://bit.mephi.ru/index.php/bit/article/view/1315 kostenfrei https://doaj.org/toc/2074-7128 Journal toc kostenfrei https://doaj.org/toc/2074-7136 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 28 2021 1 6-18
spelling	10.26583/bit.2021.1.01 doi (DE-627)DOAJ071891366 (DE-599)DOAJ84f0eca9fd274fba8301346dbea10c10 DE-627 ger DE-627 rakwb eng rus T58.5-58.64 Q350-390 Victor A. Shurygin verfasserin aut Universal triple encoding for compression and protecting binary data 2021 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier The paper is devoted to the actual problem of compression of processed and transmitted data, as well as of the data storage and protection. The analysis and features of data compression methods are presented. The method of universal coding by triples of binary sets (CT) is considered. The method is intended for lossless compression of binary data under conditions of unknown message source statistics. The method is based on dividing the original sequence of binary data into blocks of length n. Based on the analysis of the contents of the n–block, three parameters are assigned to each block: the number of units in the block, the sum of the unit position numbers, and the number of this particular combination in the corresponding prefix class. Approaches to reducing the complexity of procedures for calculating the parameters of CT are considered. A tabular algorithm for calculating coefficients and an algorithm for filling table rows using a recursive relation for elements of sets and an estimate of the amount of memory for storing tables as well as the ways to reduce the memory capacity are presented. The dependence of the bit width of the QT codewords on the bit width of n-blocks is considered. The approaches and features of the use of coding by triplets for information protection are analyzed. data compression, encoding, data storage, data protection, recurrence relation, lossless compression. Information technology Information theory Igor M. Yadykin verfasserin aut In Безопасность информационных технологий Joint Stock Company "Experimental Scientific and Production Association SPELS, 2017 28(2021), 1, Seite 6-18 (DE-627)81958147X (DE-600)2813556-8 20747136 nnns volume:28 year:2021 number:1 pages:6-18 https://doi.org/10.26583/bit.2021.1.01 kostenfrei https://doaj.org/article/84f0eca9fd274fba8301346dbea10c10 kostenfrei https://bit.mephi.ru/index.php/bit/article/view/1315 kostenfrei https://doaj.org/toc/2074-7128 Journal toc kostenfrei https://doaj.org/toc/2074-7136 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 28 2021 1 6-18
allfields_unstemmed	10.26583/bit.2021.1.01 doi (DE-627)DOAJ071891366 (DE-599)DOAJ84f0eca9fd274fba8301346dbea10c10 DE-627 ger DE-627 rakwb eng rus T58.5-58.64 Q350-390 Victor A. Shurygin verfasserin aut Universal triple encoding for compression and protecting binary data 2021 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier The paper is devoted to the actual problem of compression of processed and transmitted data, as well as of the data storage and protection. The analysis and features of data compression methods are presented. The method of universal coding by triples of binary sets (CT) is considered. The method is intended for lossless compression of binary data under conditions of unknown message source statistics. The method is based on dividing the original sequence of binary data into blocks of length n. Based on the analysis of the contents of the n–block, three parameters are assigned to each block: the number of units in the block, the sum of the unit position numbers, and the number of this particular combination in the corresponding prefix class. Approaches to reducing the complexity of procedures for calculating the parameters of CT are considered. A tabular algorithm for calculating coefficients and an algorithm for filling table rows using a recursive relation for elements of sets and an estimate of the amount of memory for storing tables as well as the ways to reduce the memory capacity are presented. The dependence of the bit width of the QT codewords on the bit width of n-blocks is considered. The approaches and features of the use of coding by triplets for information protection are analyzed. data compression, encoding, data storage, data protection, recurrence relation, lossless compression. Information technology Information theory Igor M. Yadykin verfasserin aut In Безопасность информационных технологий Joint Stock Company "Experimental Scientific and Production Association SPELS, 2017 28(2021), 1, Seite 6-18 (DE-627)81958147X (DE-600)2813556-8 20747136 nnns volume:28 year:2021 number:1 pages:6-18 https://doi.org/10.26583/bit.2021.1.01 kostenfrei https://doaj.org/article/84f0eca9fd274fba8301346dbea10c10 kostenfrei https://bit.mephi.ru/index.php/bit/article/view/1315 kostenfrei https://doaj.org/toc/2074-7128 Journal toc kostenfrei https://doaj.org/toc/2074-7136 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 28 2021 1 6-18
allfieldsGer	10.26583/bit.2021.1.01 doi (DE-627)DOAJ071891366 (DE-599)DOAJ84f0eca9fd274fba8301346dbea10c10 DE-627 ger DE-627 rakwb eng rus T58.5-58.64 Q350-390 Victor A. Shurygin verfasserin aut Universal triple encoding for compression and protecting binary data 2021 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier The paper is devoted to the actual problem of compression of processed and transmitted data, as well as of the data storage and protection. The analysis and features of data compression methods are presented. The method of universal coding by triples of binary sets (CT) is considered. The method is intended for lossless compression of binary data under conditions of unknown message source statistics. The method is based on dividing the original sequence of binary data into blocks of length n. Based on the analysis of the contents of the n–block, three parameters are assigned to each block: the number of units in the block, the sum of the unit position numbers, and the number of this particular combination in the corresponding prefix class. Approaches to reducing the complexity of procedures for calculating the parameters of CT are considered. A tabular algorithm for calculating coefficients and an algorithm for filling table rows using a recursive relation for elements of sets and an estimate of the amount of memory for storing tables as well as the ways to reduce the memory capacity are presented. The dependence of the bit width of the QT codewords on the bit width of n-blocks is considered. The approaches and features of the use of coding by triplets for information protection are analyzed. data compression, encoding, data storage, data protection, recurrence relation, lossless compression. Information technology Information theory Igor M. Yadykin verfasserin aut In Безопасность информационных технологий Joint Stock Company "Experimental Scientific and Production Association SPELS, 2017 28(2021), 1, Seite 6-18 (DE-627)81958147X (DE-600)2813556-8 20747136 nnns volume:28 year:2021 number:1 pages:6-18 https://doi.org/10.26583/bit.2021.1.01 kostenfrei https://doaj.org/article/84f0eca9fd274fba8301346dbea10c10 kostenfrei https://bit.mephi.ru/index.php/bit/article/view/1315 kostenfrei https://doaj.org/toc/2074-7128 Journal toc kostenfrei https://doaj.org/toc/2074-7136 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 28 2021 1 6-18
allfieldsSound	10.26583/bit.2021.1.01 doi (DE-627)DOAJ071891366 (DE-599)DOAJ84f0eca9fd274fba8301346dbea10c10 DE-627 ger DE-627 rakwb eng rus T58.5-58.64 Q350-390 Victor A. Shurygin verfasserin aut Universal triple encoding for compression and protecting binary data 2021 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier The paper is devoted to the actual problem of compression of processed and transmitted data, as well as of the data storage and protection. The analysis and features of data compression methods are presented. The method of universal coding by triples of binary sets (CT) is considered. The method is intended for lossless compression of binary data under conditions of unknown message source statistics. The method is based on dividing the original sequence of binary data into blocks of length n. Based on the analysis of the contents of the n–block, three parameters are assigned to each block: the number of units in the block, the sum of the unit position numbers, and the number of this particular combination in the corresponding prefix class. Approaches to reducing the complexity of procedures for calculating the parameters of CT are considered. A tabular algorithm for calculating coefficients and an algorithm for filling table rows using a recursive relation for elements of sets and an estimate of the amount of memory for storing tables as well as the ways to reduce the memory capacity are presented. The dependence of the bit width of the QT codewords on the bit width of n-blocks is considered. The approaches and features of the use of coding by triplets for information protection are analyzed. data compression, encoding, data storage, data protection, recurrence relation, lossless compression. Information technology Information theory Igor M. Yadykin verfasserin aut In Безопасность информационных технологий Joint Stock Company "Experimental Scientific and Production Association SPELS, 2017 28(2021), 1, Seite 6-18 (DE-627)81958147X (DE-600)2813556-8 20747136 nnns volume:28 year:2021 number:1 pages:6-18 https://doi.org/10.26583/bit.2021.1.01 kostenfrei https://doaj.org/article/84f0eca9fd274fba8301346dbea10c10 kostenfrei https://bit.mephi.ru/index.php/bit/article/view/1315 kostenfrei https://doaj.org/toc/2074-7128 Journal toc kostenfrei https://doaj.org/toc/2074-7136 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 28 2021 1 6-18
language	English Russian
source	In Безопасность информационных технологий 28(2021), 1, Seite 6-18 volume:28 year:2021 number:1 pages:6-18
sourceStr	In Безопасность информационных технологий 28(2021), 1, Seite 6-18 volume:28 year:2021 number:1 pages:6-18
format_phy_str_mv	Article
institution	findex.gbv.de
topic_facet	data compression, encoding, data storage, data protection, recurrence relation, lossless compression. Information technology Information theory
isfreeaccess_bool	true
container_title	Безопасность информационных технологий
authorswithroles_txt_mv	Victor A. Shurygin @@aut@@ Igor M. Yadykin @@aut@@
publishDateDaySort_date	2021-01-01T00:00:00Z
hierarchy_top_id	81958147X
id	DOAJ071891366
language_de	englisch russisch
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">DOAJ071891366</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230309103904.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">230228s2021 xx \|\|\|\|\|o 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.26583/bit.2021.1.01</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)DOAJ071891366</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DOAJ84f0eca9fd274fba8301346dbea10c10</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield><subfield code="a">rus</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">T58.5-58.64</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">Q350-390</subfield></datafield><datafield tag="100" ind1="0" ind2=" "><subfield code="a">Victor A. Shurygin</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Universal triple encoding for compression and protecting binary data</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2021</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">The paper is devoted to the actual problem of compression of processed and transmitted data, as well as of the data storage and protection. The analysis and features of data compression methods are presented. The method of universal coding by triples of binary sets (CT) is considered. The method is intended for lossless compression of binary data under conditions of unknown message source statistics. The method is based on dividing the original sequence of binary data into blocks of length n. Based on the analysis of the contents of the n–block, three parameters are assigned to each block: the number of units in the block, the sum of the unit position numbers, and the number of this particular combination in the corresponding prefix class. Approaches to reducing the complexity of procedures for calculating the parameters of CT are considered. A tabular algorithm for calculating coefficients and an algorithm for filling table rows using a recursive relation for elements of sets and an estimate of the amount of memory for storing tables as well as the ways to reduce the memory capacity are presented. The dependence of the bit width of the QT codewords on the bit width of n-blocks is considered. The approaches and features of the use of coding by triplets for information protection are analyzed.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">data compression, encoding, data storage, data protection, recurrence relation, lossless compression.</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Information technology</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Information theory</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Igor M. Yadykin</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">In</subfield><subfield code="t">Безопасность информационных технологий</subfield><subfield code="d">Joint Stock Company "Experimental Scientific and Production Association SPELS, 2017</subfield><subfield code="g">28(2021), 1, Seite 6-18</subfield><subfield code="w">(DE-627)81958147X</subfield><subfield code="w">(DE-600)2813556-8</subfield><subfield code="x">20747136</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:28</subfield><subfield code="g">year:2021</subfield><subfield code="g">number:1</subfield><subfield code="g">pages:6-18</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.26583/bit.2021.1.01</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doaj.org/article/84f0eca9fd274fba8301346dbea10c10</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://bit.mephi.ru/index.php/bit/article/view/1315</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://doaj.org/toc/2074-7128</subfield><subfield code="y">Journal toc</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://doaj.org/toc/2074-7136</subfield><subfield code="y">Journal toc</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_DOAJ</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_11</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_39</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_63</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_170</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_293</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4326</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4335</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4367</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">28</subfield><subfield code="j">2021</subfield><subfield code="e">1</subfield><subfield code="h">6-18</subfield></datafield></record></collection>
callnumber-first	T - Technology
author	Victor A. Shurygin
spellingShingle	Victor A. Shurygin misc T58.5-58.64 misc Q350-390 misc data compression, encoding, data storage, data protection, recurrence relation, lossless compression. misc Information technology misc Information theory Universal triple encoding for compression and protecting binary data
authorStr	Victor A. Shurygin
ppnlink_with_tag_str_mv	@@773@@(DE-627)81958147X
format	electronic Article
delete_txt_mv	keep
author_role	aut aut
collection	DOAJ
remote_str	true
callnumber-label	T58
illustrated	Not Illustrated
issn	20747136
topic_title	T58.5-58.64 Q350-390 Universal triple encoding for compression and protecting binary data data compression, encoding, data storage, data protection, recurrence relation, lossless compression
topic	misc T58.5-58.64 misc Q350-390 misc data compression, encoding, data storage, data protection, recurrence relation, lossless compression. misc Information technology misc Information theory
topic_unstemmed	misc T58.5-58.64 misc Q350-390 misc data compression, encoding, data storage, data protection, recurrence relation, lossless compression. misc Information technology misc Information theory
topic_browse	misc T58.5-58.64 misc Q350-390 misc data compression, encoding, data storage, data protection, recurrence relation, lossless compression. misc Information technology misc Information theory
format_facet	Elektronische Aufsätze Aufsätze Elektronische Ressource
format_main_str_mv	Text Zeitschrift/Artikel
carriertype_str_mv	cr
hierarchy_parent_title	Безопасность информационных технологий
hierarchy_parent_id	81958147X
hierarchy_top_title	Безопасность информационных технологий
isfreeaccess_txt	true
familylinks_str_mv	(DE-627)81958147X (DE-600)2813556-8
title	Universal triple encoding for compression and protecting binary data
ctrlnum	(DE-627)DOAJ071891366 (DE-599)DOAJ84f0eca9fd274fba8301346dbea10c10
title_full	Universal triple encoding for compression and protecting binary data
author_sort	Victor A. Shurygin
journal	Безопасность информационных технологий
journalStr	Безопасность информационных технологий
callnumber-first-code	T
lang_code	eng rus
isOA_bool	true
recordtype	marc
publishDateSort	2021
contenttype_str_mv	txt
container_start_page	6
author_browse	Victor A. Shurygin Igor M. Yadykin
container_volume	28
class	T58.5-58.64 Q350-390
format_se	Elektronische Aufsätze
author-letter	Victor A. Shurygin
doi_str_mv	10.26583/bit.2021.1.01
author2-role	verfasserin
title_sort	universal triple encoding for compression and protecting binary data
callnumber	T58.5-58.64
title_auth	Universal triple encoding for compression and protecting binary data
abstract	The paper is devoted to the actual problem of compression of processed and transmitted data, as well as of the data storage and protection. The analysis and features of data compression methods are presented. The method of universal coding by triples of binary sets (CT) is considered. The method is intended for lossless compression of binary data under conditions of unknown message source statistics. The method is based on dividing the original sequence of binary data into blocks of length n. Based on the analysis of the contents of the n–block, three parameters are assigned to each block: the number of units in the block, the sum of the unit position numbers, and the number of this particular combination in the corresponding prefix class. Approaches to reducing the complexity of procedures for calculating the parameters of CT are considered. A tabular algorithm for calculating coefficients and an algorithm for filling table rows using a recursive relation for elements of sets and an estimate of the amount of memory for storing tables as well as the ways to reduce the memory capacity are presented. The dependence of the bit width of the QT codewords on the bit width of n-blocks is considered. The approaches and features of the use of coding by triplets for information protection are analyzed.
abstractGer	The paper is devoted to the actual problem of compression of processed and transmitted data, as well as of the data storage and protection. The analysis and features of data compression methods are presented. The method of universal coding by triples of binary sets (CT) is considered. The method is intended for lossless compression of binary data under conditions of unknown message source statistics. The method is based on dividing the original sequence of binary data into blocks of length n. Based on the analysis of the contents of the n–block, three parameters are assigned to each block: the number of units in the block, the sum of the unit position numbers, and the number of this particular combination in the corresponding prefix class. Approaches to reducing the complexity of procedures for calculating the parameters of CT are considered. A tabular algorithm for calculating coefficients and an algorithm for filling table rows using a recursive relation for elements of sets and an estimate of the amount of memory for storing tables as well as the ways to reduce the memory capacity are presented. The dependence of the bit width of the QT codewords on the bit width of n-blocks is considered. The approaches and features of the use of coding by triplets for information protection are analyzed.
abstract_unstemmed	The paper is devoted to the actual problem of compression of processed and transmitted data, as well as of the data storage and protection. The analysis and features of data compression methods are presented. The method of universal coding by triples of binary sets (CT) is considered. The method is intended for lossless compression of binary data under conditions of unknown message source statistics. The method is based on dividing the original sequence of binary data into blocks of length n. Based on the analysis of the contents of the n–block, three parameters are assigned to each block: the number of units in the block, the sum of the unit position numbers, and the number of this particular combination in the corresponding prefix class. Approaches to reducing the complexity of procedures for calculating the parameters of CT are considered. A tabular algorithm for calculating coefficients and an algorithm for filling table rows using a recursive relation for elements of sets and an estimate of the amount of memory for storing tables as well as the ways to reduce the memory capacity are presented. The dependence of the bit width of the QT codewords on the bit width of n-blocks is considered. The approaches and features of the use of coding by triplets for information protection are analyzed.
collection_details	GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700
container_issue	1
title_short	Universal triple encoding for compression and protecting binary data
url	https://doi.org/10.26583/bit.2021.1.01 https://doaj.org/article/84f0eca9fd274fba8301346dbea10c10 https://bit.mephi.ru/index.php/bit/article/view/1315 https://doaj.org/toc/2074-7128 https://doaj.org/toc/2074-7136
remote_bool	true
author2	Igor M. Yadykin
author2Str	Igor M. Yadykin
ppnlink	81958147X
callnumber-subject	T - General Technology
mediatype_str_mv	c
isOA_txt	true
hochschulschrift_bool	false
doi_str	10.26583/bit.2021.1.01
callnumber-a	T58.5-58.64
up_date	2024-07-03T22:43:40.812Z
_version_	1803599605466660864
fullrecord_marcxml	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">DOAJ071891366</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230309103904.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">230228s2021 xx \|\|\|\|\|o 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.26583/bit.2021.1.01</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)DOAJ071891366</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DOAJ84f0eca9fd274fba8301346dbea10c10</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield><subfield code="a">rus</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">T58.5-58.64</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">Q350-390</subfield></datafield><datafield tag="100" ind1="0" ind2=" "><subfield code="a">Victor A. Shurygin</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Universal triple encoding for compression and protecting binary data</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2021</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">The paper is devoted to the actual problem of compression of processed and transmitted data, as well as of the data storage and protection. The analysis and features of data compression methods are presented. The method of universal coding by triples of binary sets (CT) is considered. The method is intended for lossless compression of binary data under conditions of unknown message source statistics. The method is based on dividing the original sequence of binary data into blocks of length n. Based on the analysis of the contents of the n–block, three parameters are assigned to each block: the number of units in the block, the sum of the unit position numbers, and the number of this particular combination in the corresponding prefix class. Approaches to reducing the complexity of procedures for calculating the parameters of CT are considered. A tabular algorithm for calculating coefficients and an algorithm for filling table rows using a recursive relation for elements of sets and an estimate of the amount of memory for storing tables as well as the ways to reduce the memory capacity are presented. The dependence of the bit width of the QT codewords on the bit width of n-blocks is considered. The approaches and features of the use of coding by triplets for information protection are analyzed.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">data compression, encoding, data storage, data protection, recurrence relation, lossless compression.</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Information technology</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Information theory</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Igor M. Yadykin</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">In</subfield><subfield code="t">Безопасность информационных технологий</subfield><subfield code="d">Joint Stock Company "Experimental Scientific and Production Association SPELS, 2017</subfield><subfield code="g">28(2021), 1, Seite 6-18</subfield><subfield code="w">(DE-627)81958147X</subfield><subfield code="w">(DE-600)2813556-8</subfield><subfield code="x">20747136</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:28</subfield><subfield code="g">year:2021</subfield><subfield code="g">number:1</subfield><subfield code="g">pages:6-18</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.26583/bit.2021.1.01</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doaj.org/article/84f0eca9fd274fba8301346dbea10c10</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://bit.mephi.ru/index.php/bit/article/view/1315</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://doaj.org/toc/2074-7128</subfield><subfield code="y">Journal toc</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://doaj.org/toc/2074-7136</subfield><subfield code="y">Journal toc</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_DOAJ</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_11</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_39</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_63</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_170</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_293</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4326</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4335</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4367</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">28</subfield><subfield code="j">2021</subfield><subfield code="e">1</subfield><subfield code="h">6-18</subfield></datafield></record></collection>
score	7.3993244

Nicht das Richtige dabei?

Schreiben Sie uns!

Universal triple encoding for compression and protecting binary data

Nicht das Richtige dabei?

Zugang & Verfügbarkeit

Vorhandene Bände

Nicht das Richtige dabei?