{"title":"On jamming-proof signal-code constructions for a multiple access system","authors":"D. Osipov","doi":"10.1109/RED.2014.7016710","DOIUrl":"https://doi.org/10.1109/RED.2014.7016710","url":null,"abstract":"In what follows signal-code constructions employing block and convolutional nonbinary inner codes that can perform under severe jamming are proposed. Robustness of the proposed signal-code constructions to jamming is verified by means of simulation.","PeriodicalId":270689,"journal":{"name":"2014 XIV International Symposium on Problems of Redundancy in Information and Control Systems","volume":"1 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":"134130470","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":"The error-correcting capabilities of low-complexity decoded H-LDPC code as irregular LDPC code","authors":"P. Rybin","doi":"10.1109/RED.2014.7016711","DOIUrl":"https://doi.org/10.1109/RED.2014.7016711","url":null,"abstract":"This paper deals with the Low-Density Parity-Check codes with the constituent Hamming codes (H-LDPC codes) and two different iterative hard-decision low-complexity decoding algorithms. Both algorithms are based on the same main idea: the decreasing of the syndrome weight on each step of the decoding algorithm. The first decoding algorithm uses the properties of the constituent Hamming code. The best known lower-bound on the guaranteed corrected errors fraction for the H-LDPC codes under the first decoding algorithm was obtained in 2011. The second decoding algorithm considers H-LDPC as the irregular LDPC code and uses the well-known majority decoding algorithm. The lower-bound on the guaranteed corrected errors fraction for H-LDPC code under the second decoding algorithm is introduced for the first time in this paper. Numerical results for the lower-bound, obtained in this paper for H-LDPC code under the second decoding algorithm, significantly exceed the numerical results for the best known lower-bounds, obtained previously for H-LDPC code under the first decoding algorithm.","PeriodicalId":270689,"journal":{"name":"2014 XIV International Symposium on Problems of Redundancy in Information and Control Systems","volume":"50 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":"115822893","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":"Generalized supercodes decoding","authors":"A. Abramov, E. Krouk","doi":"10.1109/RED.2014.7016692","DOIUrl":"https://doi.org/10.1109/RED.2014.7016692","url":null,"abstract":"Decoding random linear codes is one of the central problems in coding theory and code-based cryptography. In this paper a generalized supercodes decoding algorithm is proposed. The idea of the new algorithm is to keep a list of candidate vectors having an exponential size instead of tending to zero size as it was organized in the original algorithm proposed by Barg, Krouk and van Tilborg.","PeriodicalId":270689,"journal":{"name":"2014 XIV International Symposium on Problems of Redundancy in Information and Control Systems","volume":"80 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":"122963179","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":"Analysis of exemplar based inpainting techniques for error concealment","authors":"V. Yastrebov, A. Veselov, B. Filippov","doi":"10.1109/RED.2014.7016715","DOIUrl":"https://doi.org/10.1109/RED.2014.7016715","url":null,"abstract":"In this paper the problem of decoder side error concealment is considered. A comparison of several restoration methods is presented. All the compared methods belong to the class of exemplar based inpainting algorithms. It is shown that patch based methods are effective for restoration of small macroblocks while block based methods are effective for restoration of large macroblocks.","PeriodicalId":270689,"journal":{"name":"2014 XIV International Symposium on Problems of Redundancy in Information and Control Systems","volume":"11 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":"121144934","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":"New iterative turbo code list decoder","authors":"Akmal Akmalkhodzhaev, Alexander Kozlov","doi":"10.1109/RED.2014.7016695","DOIUrl":"https://doi.org/10.1109/RED.2014.7016695","url":null,"abstract":"Turbo decoder performance improvement is considered in the work. While on the first iteration of the conventional turbo decoder a priori reliabilities are supposed to be zero in the new scheme it is proposed to estimate and set these values. Algorithm for generation of a list of a priori LLRs is described, where each list sequence is used as an input to independent turbo decoder. As a result list of decoded sequences is obtained from independent turbo decoding processes. Thus new turbo code list decoding algorithm is proposed and parallel turbo decoding technique is introduced. FER simulation results for 3GPP LTE turbo code show 0.4 dB gain for short information sequences and 0.15 dB gain for longer ones. As a criterion of choosing of correct sequence in the list CRC is used.","PeriodicalId":270689,"journal":{"name":"2014 XIV International Symposium on Problems of Redundancy in Information and Control Systems","volume":"9 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":"114976845","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":"One subclass of cyclic generalized (L,G) codes with separable Goppa polynomial","authors":"S. Bezzateev","doi":"10.1109/RED.2014.7016699","DOIUrl":"https://doi.org/10.1109/RED.2014.7016699","url":null,"abstract":"A new subclass of cyclic generalized (L,G) codes with separable Goppa polynomial is constructed.","PeriodicalId":270689,"journal":{"name":"2014 XIV International Symposium on Problems of Redundancy in Information and Control Systems","volume":"29 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":"115371823","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":"Numerical and simulation method to estimate metastability time interval for slotted ALOHA","authors":"Dmitriy Kim, Dmitriy Purgin","doi":"10.1109/RED.2014.7016706","DOIUrl":"https://doi.org/10.1109/RED.2014.7016706","url":null,"abstract":"We consider the classical synchronised multiple access system with a single transmission channel and a randomised transmission protocol (ALOHA). It is well known that this algorithm is not stable, but under some conditions metastability effect is observed (i.e. the algorithm provides the required quality of service on finite but long-term time intervals). We study a method to estimate the metastability time interval for an input stream of i.i.d. sequence of random values.","PeriodicalId":270689,"journal":{"name":"2014 XIV International Symposium on Problems of Redundancy in Information and Control Systems","volume":"18 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":"126737465","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":"Iterative known interference cancellation in OFDM systems","authors":"E. Pustovalov, A. Turlikov","doi":"10.1109/RED.2014.7016718","DOIUrl":"https://doi.org/10.1109/RED.2014.7016718","url":null,"abstract":"Collision resolution via interference cancellation (IC) in packet-based random multiple access (RMA) systems is a promising technique to decrease number of retransmissions and increase overall throughput. This paper proposes novel iterative algorithm of IC in OFDM systems for the case when one of the interfering packets is known to the receiver. Comparing to well-known successive interference cancellation (SIC) methods, proposed algorithm works when there is no significant power imbalance in received signals and receiver could not decode the strongest one. The algorithm exploits the property, that duration of channel response in time domain is constrained while residual interference is widespread over the frequency and time.","PeriodicalId":270689,"journal":{"name":"2014 XIV International Symposium on Problems of Redundancy in Information and Control Systems","volume":"1 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":"129285558","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}