Pub Date : 2015-06-17DOI: 10.1109/IWSDA.2015.7458383
K. Benerjee, M. Gupta
Fractional Repetition (FR) codes are well known class of Distributed Replication-based Simple Storage (Dress) codes for the Distributed Storage Systems (DSSs). In such systems, the replicas of data packets encoded by Maximum Distance Separable (MDS) code, are stored on distributed nodes. Most of the available constructions for the FR codes are based on combinatorial designs and Graph theory. In this work, we propose an elegant sequence based approach for the construction of the FR code. In particular, we propose a beautiful class of codes known as Flower codes and study its basic properties.
{"title":"On Dress codes with Flowers","authors":"K. Benerjee, M. Gupta","doi":"10.1109/IWSDA.2015.7458383","DOIUrl":"https://doi.org/10.1109/IWSDA.2015.7458383","url":null,"abstract":"Fractional Repetition (FR) codes are well known class of Distributed Replication-based Simple Storage (Dress) codes for the Distributed Storage Systems (DSSs). In such systems, the replicas of data packets encoded by Maximum Distance Separable (MDS) code, are stored on distributed nodes. Most of the available constructions for the FR codes are based on combinatorial designs and Graph theory. In this work, we propose an elegant sequence based approach for the construction of the FR code. In particular, we propose a beautiful class of codes known as Flower codes and study its basic properties.","PeriodicalId":371829,"journal":{"name":"2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125683741","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}
Pub Date : 2015-01-28DOI: 10.1109/IWSDA.2015.7458386
Dixita Limbachiya, Vijay Dhameliya, Madhav Khakhar, M. Gupta
DNA based storage systems received attention by many researchers in the last few years. This includes archival and re-writable (random access) DNA based storage systems. In this work, we have developed an efficient technique to encode the data into the DNA sequences using non-linear family of ternary codes. In particular, we propose an algorithm to encode data into DNA with high information storage density for archival storage using the sub-code of the Golay code. Theoretically, 115 exabytes (EB) data can be stored in one gram of DNA using our method.
{"title":"On optimal family of codes for archival DNA storage","authors":"Dixita Limbachiya, Vijay Dhameliya, Madhav Khakhar, M. Gupta","doi":"10.1109/IWSDA.2015.7458386","DOIUrl":"https://doi.org/10.1109/IWSDA.2015.7458386","url":null,"abstract":"DNA based storage systems received attention by many researchers in the last few years. This includes archival and re-writable (random access) DNA based storage systems. In this work, we have developed an efficient technique to encode the data into the DNA sequences using non-linear family of ternary codes. In particular, we propose an algorithm to encode data into DNA with high information storage density for archival storage using the sub-code of the Golay code. Theoretically, 115 exabytes (EB) data can be stored in one gram of DNA using our method.","PeriodicalId":371829,"journal":{"name":"2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115356008","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}
Pub Date : 2013-12-18DOI: 10.1109/IWSDA.2015.7458385
Xiaohu Tang, Bin Yang, Jie Li
To be considered for the Special Session celebrating Prof. Kumar's birthday. The newly presented (k + 2, k) Hadamard minimum storage regenerating (MSR) code is the first class of high rate storage code with optimal repair properly for all single node failures. In this paper, we propose a new simple repair strategy, which can considerably reduce the computation load of the node repair in contrast to the original one.
{"title":"New repair strategy of Hadamard minimum storage regenerating code for distributed storage system","authors":"Xiaohu Tang, Bin Yang, Jie Li","doi":"10.1109/IWSDA.2015.7458385","DOIUrl":"https://doi.org/10.1109/IWSDA.2015.7458385","url":null,"abstract":"To be considered for the Special Session celebrating Prof. Kumar's birthday. The newly presented (k + 2, k) Hadamard minimum storage regenerating (MSR) code is the first class of high rate storage code with optimal repair properly for all single node failures. In this paper, we propose a new simple repair strategy, which can considerably reduce the computation load of the node repair in contrast to the original one.","PeriodicalId":371829,"journal":{"name":"2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122110761","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}
Pub Date : 1900-01-01DOI: 10.1109/IWSDA.2015.7458417
A. Gamachchi, S. Boztaş
Insider threat is one of the most serious information security threats which is growing at an alarming rate leading to a compromise of confidentiality, integrity and availability of information assets in all critical infrastructure sector organizations. This study proposes a hybrid user profile model which is based on technical access patterns, behavioral patterns, psychological factors and organizational position for this complex and unique problem. In this study we have investigated common characteristics among enterprise users based on their web access pattern which is a part of the behavioral analysis of our model. The results of this analysis reveal majority of users have common web access patterns compared to the minority user base who shows individual user behavior.
{"title":"Web access patterns reveal insiders behavior","authors":"A. Gamachchi, S. Boztaş","doi":"10.1109/IWSDA.2015.7458417","DOIUrl":"https://doi.org/10.1109/IWSDA.2015.7458417","url":null,"abstract":"Insider threat is one of the most serious information security threats which is growing at an alarming rate leading to a compromise of confidentiality, integrity and availability of information assets in all critical infrastructure sector organizations. This study proposes a hybrid user profile model which is based on technical access patterns, behavioral patterns, psychological factors and organizational position for this complex and unique problem. In this study we have investigated common characteristics among enterprise users based on their web access pattern which is a part of the behavioral analysis of our model. The results of this analysis reveal majority of users have common web access patterns compared to the minority user base who shows individual user behavior.","PeriodicalId":371829,"journal":{"name":"2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117157692","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：