{"title":"Scheduling algorithms for tree-based convergecast networks with a random number of messages","authors":"E. Bakin, G. Evseev","doi":"10.1109/RED.2014.7016696","DOIUrl":"https://doi.org/10.1109/RED.2014.7016696","url":null,"abstract":"In the paper we consider tree-based L-level convergecast networks, in which leaf nodes correspond to data sources (DS), a root node - to a base station (BS), and other nodes - to intermediate repeaters (IR). At a startup phase each DS generates a random number of messages for transmission to a BS. For such a model a lower bound for an average duration of collision-free convergecast is given. Also we propose a collision-free messages transmission scheduling algorithms for which the lower bound is achieved at L → ∞.","PeriodicalId":270689,"journal":{"name":"2014 XIV International Symposium on Problems of Redundancy in Information and Control Systems","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116421167","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Transport layer coding with variable coding rate","authors":"D. Malichenko","doi":"10.1109/RED.2014.7016709","DOIUrl":"https://doi.org/10.1109/RED.2014.7016709","url":null,"abstract":"This work considers message coding on a transport layer of data network using error correcting codes. Initially transport coding was presented with constant coding rate [1]. This work suggests usage of variable coding rate by recoding messages on some intermediate nodes of data network. The work contains analysis of recoding efficiency based on analytical model and simulation of Kleinrock network model.","PeriodicalId":270689,"journal":{"name":"2014 XIV International Symposium on Problems of Redundancy in Information and Control Systems","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124108463","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"On the equivalence of different variants of the GPT cryptosystem","authors":"A. Urivskiy, E. Gabidulin","doi":"10.1109/RED.2014.7016713","DOIUrl":"https://doi.org/10.1109/RED.2014.7016713","url":null,"abstract":"We consider different variants of the modified GPT cryptosystem. The main approach for increasing the security of GPT is randomizing the public key. Randomization is done through addition or concatenation of a distortion matrix to the generator matrix of the rank code or to the column scrambler.We show that all techniques are somewhat equivalent. In particular, public keys of different variants can be transformed to one another in some superextension field. This allows applying known attacks to the variants of GPT and analyzing their security.","PeriodicalId":270689,"journal":{"name":"2014 XIV International Symposium on Problems of Redundancy in Information and Control Systems","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117071786","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Lossless image compression scheme with binary layers scanning","authors":"M. Gilmutdinov, N. Egorov, D. Novikov","doi":"10.1109/RED.2014.7016703","DOIUrl":"https://doi.org/10.1109/RED.2014.7016703","url":null,"abstract":"In this work a novel lossless coding approach for color images is considered. It is based on local-adaptive combination of inter- and intra-component prediction. New context modeling method based on decomposition to binary layers is used for prediction errors. Compression performance of proposed algorithm is proved by experimental results obtained for popular public benchmarks.","PeriodicalId":270689,"journal":{"name":"2014 XIV International Symposium on Problems of Redundancy in Information and Control Systems","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124321344","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Embedded space-time block codes for concatenated systems","authors":"A. Kreshchuk, V. Zyablov","doi":"10.1109/RED.2014.7016707","DOIUrl":"https://doi.org/10.1109/RED.2014.7016707","url":null,"abstract":"In this paper we propose new coded modulation for multiple-input and multiple-output (MIMO) communication systems. This coded modulation is a generalised concatenated code. Its inner code is embedded Golden code which we introduce in this paper with a decoding algorithm. Its outer code is a product code with component Reed-Solomon code. We use iterative decoding algorithm for this product code. The performance of the proposed system is estimated with a computer simulation.","PeriodicalId":270689,"journal":{"name":"2014 XIV International Symposium on Problems of Redundancy in Information and Control Systems","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115687858","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Practical evaluation of combined approach for collusion-secure video fingerprinting","authors":"A. Afanasyeva, E. Linsky, D. Ryzhov, D. Ivanov","doi":"10.1109/RED.2014.7016693","DOIUrl":"https://doi.org/10.1109/RED.2014.7016693","url":null,"abstract":"A new combined video content protection approach is proposed and experimentally evaluated. In this approach reliability information obtained during watermark extraction process is used for improving the accuracy of traitor tracing procedure.","PeriodicalId":270689,"journal":{"name":"2014 XIV International Symposium on Problems of Redundancy in Information and Control Systems","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121280938","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"On existence of Mersenne and Hadamard matrices","authors":"N. A. Balonin, M. Sergeev","doi":"10.1109/RED.2014.7016697","DOIUrl":"https://doi.org/10.1109/RED.2014.7016697","url":null,"abstract":"There have been considered conditions of existence of Mersenne matrices. Analyzing conditions of existence of Belevitch matrices it has been shown that restrictions characteristic for integer matrices do not influence on matrices with rational and irrational values of elements to which Mersenne matrices belong. There has been given a dependency of elements values of an order of Mersenne matrices, the absence of critical points in the graph of this dependency has been shown. There has been commented a connection of conjectures of existence of Hadamard and Mersenne matrices.","PeriodicalId":270689,"journal":{"name":"2014 XIV International Symposium on Problems of Redundancy in Information and Control Systems","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123706168","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Model for analysis of Machine-Type Communications","authors":"M. Grankin, M. Rybakowski","doi":"10.1109/RED.2014.7016704","DOIUrl":"https://doi.org/10.1109/RED.2014.7016704","url":null,"abstract":"In this paper we propose a new model of random multiple access for Machine-Type Communication which is based on last generation wireless networks. The proposed model takes into account that preamble detection probability decreases with growth of transmitting devices number due to SINR degradation even if they are transmitting in orthogonal channels. For analysis of this model the technique of diffusion approximation is used. This technique allows to analyze such characteristics of the system as an average number of active devices.","PeriodicalId":270689,"journal":{"name":"2014 XIV International Symposium on Problems of Redundancy in Information and Control Systems","volume":"214 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114414279","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Preface of 2014 XIV international symposium on problems of redundancy in information and control systems","authors":"E. Krouk","doi":"10.1109/RED.2014.7016719","DOIUrl":"https://doi.org/10.1109/RED.2014.7016719","url":null,"abstract":"International symposium on problems of redundancy in information and control systems is being held fourteenth time at Saint-Petersburg, the city of white nights and big scientific traditions.","PeriodicalId":270689,"journal":{"name":"2014 XIV International Symposium on Problems of Redundancy in Information and Control Systems","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122282302","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"LDPC code construction as a generalized concatenated code","authors":"I. Zhilin, V. Zyablov","doi":"10.1109/RED.2014.7016716","DOIUrl":"https://doi.org/10.1109/RED.2014.7016716","url":null,"abstract":"We propose a construction of general concatenated code that uses low-density parity check codes as component codes. This construction itself can also be considered as low-density parity-check code and decoded using Belief Propagation algorithm. Performances of several decoders are compared; it's shown that this code can be efficiently decoded by proposed soft decoding algorithm or combining BP and proposed algorithm.","PeriodicalId":270689,"journal":{"name":"2014 XIV International Symposium on Problems of Redundancy in Information and Control Systems","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122301348","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}