Pub Date : 2017-03-01DOI: 10.1109/ICSCN.2017.8085663
Modigari Narendra, D. Ben, C. P. Jetlin, L. Anbarasi
Secret image is converted into meaningful shares using a technique called visual sharing. Information is not disclosed by any single share except for all shares. Printing the encrypted secret on transparencies and stacking them will reveal the secret. More than one secret is encrypted by the visual sharing of multiple secrets and thus encryption capacity is increased when compared to a single secret. A code book resulting in at least two times of pixel expansion is followed by visual cryptography thus creating a poor contrast level. This proposed visual secret sharing scheme share two color images on rectangular shares with no pixel expansion. The originality of secret is verified by watermark which is embedded into the secret image followed by the sharing process. The secret is reconstructed and watermarks are retrieved from the original secret to perform authenticity. The experimental results shows that the proposed scheme has tremendous reconstruction quality resulting in 50.06dB of PSNR value.
{"title":"An efficient retrieval of watermarked multiple color images using secret sharing","authors":"Modigari Narendra, D. Ben, C. P. Jetlin, L. Anbarasi","doi":"10.1109/ICSCN.2017.8085663","DOIUrl":"https://doi.org/10.1109/ICSCN.2017.8085663","url":null,"abstract":"Secret image is converted into meaningful shares using a technique called visual sharing. Information is not disclosed by any single share except for all shares. Printing the encrypted secret on transparencies and stacking them will reveal the secret. More than one secret is encrypted by the visual sharing of multiple secrets and thus encryption capacity is increased when compared to a single secret. A code book resulting in at least two times of pixel expansion is followed by visual cryptography thus creating a poor contrast level. This proposed visual secret sharing scheme share two color images on rectangular shares with no pixel expansion. The originality of secret is verified by watermark which is embedded into the secret image followed by the sharing process. The secret is reconstructed and watermarks are retrieved from the original secret to perform authenticity. The experimental results shows that the proposed scheme has tremendous reconstruction quality resulting in 50.06dB of PSNR value.","PeriodicalId":383458,"journal":{"name":"2017 Fourth International Conference on Signal Processing, Communication and Networking (ICSCN)","volume":"117 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121016022","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 : 2017-03-01DOI: 10.1109/ICSCN.2017.8085653
J. Badmapriyadharisiny, K. Anusudha
A proficient technique to distinguish changes in the geometry of an urban environment is proposed in this paper. Generally, many of the change detection techniques involve a pixel to pixel comparison by using an algebraic or a transform method of change detection. This technique profoundly depends on the optimum choice of threshold value to separate the real altered pixels. Moreover all these techniques are capable of calculating only the two dimensionality change in the environment, whereas in the proposed technique a differential geometry approach is used to detect changes from images which are done by involving the geometric property of the pixels with respect to its environment. Finally the quality of image is measured using various performance parameters like PSNR and MSE.
{"title":"Geometric image change detection in urban environment","authors":"J. Badmapriyadharisiny, K. Anusudha","doi":"10.1109/ICSCN.2017.8085653","DOIUrl":"https://doi.org/10.1109/ICSCN.2017.8085653","url":null,"abstract":"A proficient technique to distinguish changes in the geometry of an urban environment is proposed in this paper. Generally, many of the change detection techniques involve a pixel to pixel comparison by using an algebraic or a transform method of change detection. This technique profoundly depends on the optimum choice of threshold value to separate the real altered pixels. Moreover all these techniques are capable of calculating only the two dimensionality change in the environment, whereas in the proposed technique a differential geometry approach is used to detect changes from images which are done by involving the geometric property of the pixels with respect to its environment. Finally the quality of image is measured using various performance parameters like PSNR and MSE.","PeriodicalId":383458,"journal":{"name":"2017 Fourth International Conference on Signal Processing, Communication and Networking (ICSCN)","volume":"174 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124256567","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 : 2017-03-01DOI: 10.1109/ICSCN.2017.8085725
M. Jayashree, C. Ranjith, S. Rani
A genetic algorithm (GA) is a powerful heuristic method of selection based on natural living process. Because of larger size of the scheduling, implementing GA in software was tiresome and highly time complex. GA processor parallelizes the work in order to reduce the processing time and increases the speed, but still the efficiency of the GA is maintained through quality solutions. This work proposes a fast Adaptive Genetic Algorithm Processor (AGAP) for the implementation of Adaptive Noise Cancelation (ANC) filters in VLSI. The AGAP updates the coefficients of the ANC filter nullifying the effect of noise at the output end. The coefficients are optimized at every stage of the algorithm and are adaptively changed in order to meet the constraints of active noise canceller. AGAP processor is modeled using Verilog HDL in Xilinx ISE 14.6 platform. The functional performance of each module and the processor are simulated for their correctness to be synthesized using Spartan 6 XC6SLX45-3CSG324I FPGA.
遗传算法是一种基于自然生命过程的强大的启发式选择方法。由于调度规模较大，在软件中实现遗传算法非常繁琐，且时间复杂度高。遗传算法处理器将工作并行化，以减少处理时间和提高速度，但仍然通过高质量的解来保持遗传算法的效率。本工作提出了一种快速自适应遗传算法处理器(AGAP)，用于在VLSI中实现自适应噪声消除(ANC)滤波器。AGAP更新ANC滤波器的系数，消除输出端噪声的影响。在算法的每个阶段都对系数进行了优化，并自适应地改变，以满足主动降噪的约束。AGAP处理器在Xilinx ISE 14.6平台上使用Verilog HDL进行建模。利用Spartan 6 XC6SLX45-3CSG324I FPGA对各模块和处理器的功能性能进行了仿真，验证了其合成正确性。
{"title":"A VLSI implementation of an adaptive genetic algorithm processor","authors":"M. Jayashree, C. Ranjith, S. Rani","doi":"10.1109/ICSCN.2017.8085725","DOIUrl":"https://doi.org/10.1109/ICSCN.2017.8085725","url":null,"abstract":"A genetic algorithm (GA) is a powerful heuristic method of selection based on natural living process. Because of larger size of the scheduling, implementing GA in software was tiresome and highly time complex. GA processor parallelizes the work in order to reduce the processing time and increases the speed, but still the efficiency of the GA is maintained through quality solutions. This work proposes a fast Adaptive Genetic Algorithm Processor (AGAP) for the implementation of Adaptive Noise Cancelation (ANC) filters in VLSI. The AGAP updates the coefficients of the ANC filter nullifying the effect of noise at the output end. The coefficients are optimized at every stage of the algorithm and are adaptively changed in order to meet the constraints of active noise canceller. AGAP processor is modeled using Verilog HDL in Xilinx ISE 14.6 platform. The functional performance of each module and the processor are simulated for their correctness to be synthesized using Spartan 6 XC6SLX45-3CSG324I FPGA.","PeriodicalId":383458,"journal":{"name":"2017 Fourth International Conference on Signal Processing, Communication and Networking (ICSCN)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130989293","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 : 2017-03-01DOI: 10.1109/ICSCN.2017.8085660
Siyuan Shen, Xu Han, Xingru Zhou
The avalanche effect is an important security property that any Integrity algorithm must have. With implementing integrity algorithm f9 in C++ program, we test and analyze the avalanche effect of algorithm f9 by means of giving the respectively changed MAC-I bit numbers when changing one bit of the key or message in turn. The result shows that the f9 algorithm has very good avalanche effect property.
{"title":"Research of avalanche effect of the 3GPP integrity algorithm f9","authors":"Siyuan Shen, Xu Han, Xingru Zhou","doi":"10.1109/ICSCN.2017.8085660","DOIUrl":"https://doi.org/10.1109/ICSCN.2017.8085660","url":null,"abstract":"The avalanche effect is an important security property that any Integrity algorithm must have. With implementing integrity algorithm f9 in C++ program, we test and analyze the avalanche effect of algorithm f9 by means of giving the respectively changed MAC-I bit numbers when changing one bit of the key or message in turn. The result shows that the f9 algorithm has very good avalanche effect property.","PeriodicalId":383458,"journal":{"name":"2017 Fourth International Conference on Signal Processing, Communication and Networking (ICSCN)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134061129","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 : 2017-03-01DOI: 10.1109/ICSCN.2017.8085692
A. Bindhu, O. Maheswari
The obstacles for images that are taken under the water are haze, low contrast, loss of color, etc. The quality of images that are taken under the water is not clear due to the impurities present in the water and some properties of water. This paper proposes methods to improve the quality of the underwater images. The proposed work in the paper consist of two methods they are Interpolation based Enhancement and Limited Image Enhancer. The First method is based on increasing the resolution of the image and the second method is based on increasing the contrast of the images. The main aim of the paper is to enhance the image that are taken under water. The qualitative for both the algorithms compared with the previous image enhancement techniques.
{"title":"Under water image enhancement based on linear image interpolation and limited image enhancer techniques","authors":"A. Bindhu, O. Maheswari","doi":"10.1109/ICSCN.2017.8085692","DOIUrl":"https://doi.org/10.1109/ICSCN.2017.8085692","url":null,"abstract":"The obstacles for images that are taken under the water are haze, low contrast, loss of color, etc. The quality of images that are taken under the water is not clear due to the impurities present in the water and some properties of water. This paper proposes methods to improve the quality of the underwater images. The proposed work in the paper consist of two methods they are Interpolation based Enhancement and Limited Image Enhancer. The First method is based on increasing the resolution of the image and the second method is based on increasing the contrast of the images. The main aim of the paper is to enhance the image that are taken under water. The qualitative for both the algorithms compared with the previous image enhancement techniques.","PeriodicalId":383458,"journal":{"name":"2017 Fourth International Conference on Signal Processing, Communication and Networking (ICSCN)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133098469","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 : 2017-03-01DOI: 10.1109/ICSCN.2017.8085661
M. Aravind, V. Kalaiselvi
This paper focuses on designing an Intrusion Detection System(IDS), which detects the family of attack in a dataset. An IDS detects various types of malicious traffic and computer usage which cannot be detected by a conventional firewall. In this proposed work, the data is extracted from UNSW_NB15 dataset. To identify the data cluster centers, the k means algorithm is used. A new and one dimensional distance based feature is used to represent each data sample. Following this, an ensemble classifier is used to classify the data. Our algorithm would classify five families of attack viz., Normal, Probe, DOS, U2R and R2L. For each and every classifier output, Training state, Performance, Error histogram, Regression Fit are plotted.
{"title":"Design of an intrusion detection system based on distance feature using ensemble classifier","authors":"M. Aravind, V. Kalaiselvi","doi":"10.1109/ICSCN.2017.8085661","DOIUrl":"https://doi.org/10.1109/ICSCN.2017.8085661","url":null,"abstract":"This paper focuses on designing an Intrusion Detection System(IDS), which detects the family of attack in a dataset. An IDS detects various types of malicious traffic and computer usage which cannot be detected by a conventional firewall. In this proposed work, the data is extracted from UNSW_NB15 dataset. To identify the data cluster centers, the k means algorithm is used. A new and one dimensional distance based feature is used to represent each data sample. Following this, an ensemble classifier is used to classify the data. Our algorithm would classify five families of attack viz., Normal, Probe, DOS, U2R and R2L. For each and every classifier output, Training state, Performance, Error histogram, Regression Fit are plotted.","PeriodicalId":383458,"journal":{"name":"2017 Fourth International Conference on Signal Processing, Communication and Networking (ICSCN)","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133182370","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 : 2017-03-01DOI: 10.1109/ICSCN.2017.8085718
P. Rani, S. Shalinie
Hash-routing is an ingenious technique, which is deployed in client-server environment to forward requested content to the corresponding server playing role of origin and disseminate the requested content. Our proposed approach hash based-routing is novel technique which is more suitable to ICN, in which in-network content caches cater for content as a storage that is momentary. Especially, edge-routers forward further content request to in-network caches as per to the hash placement function. Despite this, off-path cache having some notable benefits such that as cache-hit ratio with minimum cluster co-ordination overhead, the above mentioned technique suffers from some shortcomings. One of them is, in the event of dealing with greater domains, the off-path caching detour the content request and so it could intensify latency, to exorbitant magnitude. It is critical for us. To delve into domain clustering, so as to tackle bumper detour delays. In accordance with this technique, we divide huge domains into clusters, subsequently we employ hash based-routing technique in the subcategory of each cluster, we devise and appraise the characteristics of domain clustering and intimate substantial enhancement in delivering the latency. In order to this achieve enhancement we need to forfeit something in cache hit ratio.
{"title":"Efficient cache distribution using hash-routing schemes and nodal clustering for information centric network","authors":"P. Rani, S. Shalinie","doi":"10.1109/ICSCN.2017.8085718","DOIUrl":"https://doi.org/10.1109/ICSCN.2017.8085718","url":null,"abstract":"Hash-routing is an ingenious technique, which is deployed in client-server environment to forward requested content to the corresponding server playing role of origin and disseminate the requested content. Our proposed approach hash based-routing is novel technique which is more suitable to ICN, in which in-network content caches cater for content as a storage that is momentary. Especially, edge-routers forward further content request to in-network caches as per to the hash placement function. Despite this, off-path cache having some notable benefits such that as cache-hit ratio with minimum cluster co-ordination overhead, the above mentioned technique suffers from some shortcomings. One of them is, in the event of dealing with greater domains, the off-path caching detour the content request and so it could intensify latency, to exorbitant magnitude. It is critical for us. To delve into domain clustering, so as to tackle bumper detour delays. In accordance with this technique, we divide huge domains into clusters, subsequently we employ hash based-routing technique in the subcategory of each cluster, we devise and appraise the characteristics of domain clustering and intimate substantial enhancement in delivering the latency. In order to this achieve enhancement we need to forfeit something in cache hit ratio.","PeriodicalId":383458,"journal":{"name":"2017 Fourth International Conference on Signal Processing, Communication and Networking (ICSCN)","volume":"470 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133247518","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 : 2017-03-01DOI: 10.1109/ICSCN.2017.8085735
M. Latha, G. Kavitha
Schizophrenia (SZ) is a neurological disorder, which affects linguistic, memory, consciousness and executive functions of the brain. Magnetic resonance imaging (MRI) is used to capture structural abnormalities in human brain regions. In this work, segmentation of ventricle region from Schizophrenic MR brain images was carried out using optimized energy minimization framework. The images considered in this work are obtained from Centers of Biomedical Research Excellence (COBRE) database. Initially, the original images are subjected to simultaneous bias correction and segmentation using multiplicative intrinsic component optimization. The ventricles are extracted from other internal brain structures using this method. The obtained results are validated against the ground truth images. Results show that, multiplicative intrinsic component optimization method is able to segment ventricle from normal and SZ images. The correlation of ventricle area with ground truth is high (R = 0.99). It is noticed that SZ subjects have increased ventricle area compared to that of normal subjects. The high value of rand index (0.98) along with low value of global consistency error and variation of information shows the efficiency of the proposed method. The feature area extracted from the ventricle seems to be significant; hence it may be clinically supportive in the diagnosis of Schizophrenic subjects.
{"title":"Segmentation and analysis of ventricles in Schizophrenic MR brain images using optimal region based energy minimization framework","authors":"M. Latha, G. Kavitha","doi":"10.1109/ICSCN.2017.8085735","DOIUrl":"https://doi.org/10.1109/ICSCN.2017.8085735","url":null,"abstract":"Schizophrenia (SZ) is a neurological disorder, which affects linguistic, memory, consciousness and executive functions of the brain. Magnetic resonance imaging (MRI) is used to capture structural abnormalities in human brain regions. In this work, segmentation of ventricle region from Schizophrenic MR brain images was carried out using optimized energy minimization framework. The images considered in this work are obtained from Centers of Biomedical Research Excellence (COBRE) database. Initially, the original images are subjected to simultaneous bias correction and segmentation using multiplicative intrinsic component optimization. The ventricles are extracted from other internal brain structures using this method. The obtained results are validated against the ground truth images. Results show that, multiplicative intrinsic component optimization method is able to segment ventricle from normal and SZ images. The correlation of ventricle area with ground truth is high (R = 0.99). It is noticed that SZ subjects have increased ventricle area compared to that of normal subjects. The high value of rand index (0.98) along with low value of global consistency error and variation of information shows the efficiency of the proposed method. The feature area extracted from the ventricle seems to be significant; hence it may be clinically supportive in the diagnosis of Schizophrenic subjects.","PeriodicalId":383458,"journal":{"name":"2017 Fourth International Conference on Signal Processing, Communication and Networking (ICSCN)","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133458299","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 : 2017-03-01DOI: 10.1109/ICSCN.2017.8085714
S. Prabavathy, K. Sundarakantham, S. Shalinie
The Social-Collaborative Internet of Things (SCIoT) provides the ability for objects to autonomously establish social relationship among them based on the rules imposed by its owners'. This paper proposes a new secure framework for SCIoTto tackle the issues related to security and privacy. The proposed framework adopts a decentralized architecture to handle the problems of large-scale deployment and management of heterogeneous objects in different Internet of Things platforms. The proposed framework consists Relationship Based Dynamic Trust Management Protocol to ensure trustworthiness among objects in the dynamic environment of SCIoT.
{"title":"Decentralized secure framework for social collaborative Internet of Things","authors":"S. Prabavathy, K. Sundarakantham, S. Shalinie","doi":"10.1109/ICSCN.2017.8085714","DOIUrl":"https://doi.org/10.1109/ICSCN.2017.8085714","url":null,"abstract":"The Social-Collaborative Internet of Things (SCIoT) provides the ability for objects to autonomously establish social relationship among them based on the rules imposed by its owners'. This paper proposes a new secure framework for SCIoTto tackle the issues related to security and privacy. The proposed framework adopts a decentralized architecture to handle the problems of large-scale deployment and management of heterogeneous objects in different Internet of Things platforms. The proposed framework consists Relationship Based Dynamic Trust Management Protocol to ensure trustworthiness among objects in the dynamic environment of SCIoT.","PeriodicalId":383458,"journal":{"name":"2017 Fourth International Conference on Signal Processing, Communication and Networking (ICSCN)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130294473","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 : 2017-03-01DOI: 10.1109/ICSCN.2017.8085667
C. P. Kumar, R. Selvakumar
Concatenated codes proposed by Forney are used extensively in digital communication. In this paper, concatenated kernel codes, a class of group codes is constructed with inner code and outer code. Binary and non — binary variants of concatenated kernel code is discussed with example. Constructed concatenated kernel code is represented over trellis. Minimal trellis representation is given for the concatenated kernel code and its state complexity profile is discussed. Performance evaluation of concatenated kernel code is derived in terms of BER. It is observed that the concatenated kernel codes with random selection of groups perform better than kernel codes with random selection of homomorphisms with coding gain.
{"title":"Performance evaluation of concatenated kernel codes","authors":"C. P. Kumar, R. Selvakumar","doi":"10.1109/ICSCN.2017.8085667","DOIUrl":"https://doi.org/10.1109/ICSCN.2017.8085667","url":null,"abstract":"Concatenated codes proposed by Forney are used extensively in digital communication. In this paper, concatenated kernel codes, a class of group codes is constructed with inner code and outer code. Binary and non — binary variants of concatenated kernel code is discussed with example. Constructed concatenated kernel code is represented over trellis. Minimal trellis representation is given for the concatenated kernel code and its state complexity profile is discussed. Performance evaluation of concatenated kernel code is derived in terms of BER. It is observed that the concatenated kernel codes with random selection of groups perform better than kernel codes with random selection of homomorphisms with coding gain.","PeriodicalId":383458,"journal":{"name":"2017 Fourth International Conference on Signal Processing, Communication and Networking (ICSCN)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127679466","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
扫码关注我们
求助内容：
应助结果提醒方式：