检索结果-内蒙古大学图书馆

Gaussian channel transmission of images and audio files using cryptcoding

IET COMMUNICATIONS 2019年第11期13卷 1625-1632页

作者： Bakeva, Verica Popovska-Mitrovikj, Aleksandra Mechkaroska, Daniela Dimitrova, Vesna Jakimovski, Boro Ilievski, Vladimir Ss Cyril & Methodius Univ Skopje Fac Comp Sci & Engn POB 393 Skopje North Macedonia Ecole Polytech Fed Lausanne Lausanne Switzerland

Random codes based on quasigroups (RCBQ) are cryptcodes, i.e. they are error-correcting codes, which provide information security. Cut-Decoding and 4-Sets-Cut-Decoding algorithms for these codes are defined elsewhere. Also, the performance of these codes for the transmission of text messages is investigated elsewhere. In this study, the authors investigate the RCBQ's performance with Cut-Decoding and 4-Sets-Cut-Decoding algorithms for transmission of images and audio files through a Gaussian channel. They compare experimental results for both coding/decoding algorithms and for different values of signal-to-noise ratio. In all experiments, the differences between the transmitted and decoded image or audio file are considered. Experimentally obtained values for bit-error rate and packet error rate and the decoding speed of both algorithms are compared. Also, two filters for enhancing the quality of the images decoded using RCBQ are proposed.

关键词： random codes decoding Gaussian channels error correction codes channel coding error statistics cryptography image coding audio coding 4-sets-cut-decoding algorithms audio files decoded image bit-error rate packet error rate decoding speed Gaussian channel transmission random codes error-correcting codes coding algorithm cryptcoding information security cut-decoding algorithm RCBQ performance quasigroups image files

来源：评论

学校读者我要写书评

暂无评论

Enhanced cryptcoding: Joint Security and Advanced Dual-Step Quasi-Cyclic LDPC Coding 58

Enhanced Cryptcoding: Joint Security and Advanced Dual-Step ...

引用

IEEE Global Telecommunications Conference (GLOBECOM)

作者： Pisek, Eran Abu-Surra, Shadi Taori, Rakesh Dunham, James Rajan, Dinesh Samsung Res Amer Richardson TX 75082 USA Southern Methodist Univ Dallas TX USA

ISBN: (纸本)9781479959525

Data security has always been a major concern and a huge challenge for governments and individuals throughout the world since early times. Recent advances in technology, such as the introduction of cloud computing, make it even a bigger challenge to keep data secure. In parallel, high throughput mobile devices such as smartphones and tablets are designed to support these new technologies. The high throughput requires power-efficient designs to maintain the battery-life. In this paper, we propose a novel Joint Security and Advanced Low Density Parity Check (LDPC) Coding (JSALC) method. The JSALC is composed of two parts: the Joint Security and Advanced LDPC-based Encryption (JSALE) and the dual-step Secure LDPC code for Channel Coding (SLCC). The JSALE is obtained by interlacing Advanced Encryption System (AES)-like rounds and Quasi-Cyclic (QC)-LDPC rows into a single primitive. Both the JSALE code and the SLCC code share the same base quasi-cyclic parity check matrix (PCM) which retains the power efficiency compared to conventional systems. We show that the overall JSALC Frame-Error-Rate (FER) performance outperforms other cryptcoding methods by over 1.5 dB while maintaining the AES-128 security level. Moreover, the JSALC enables error resilience and has higher diffusion than AES-128.

关键词： AES Encryption Decryption LDPC Coding Wireless Communication Wired Communication cryptcoding

来源：评论

学校读者我要写书评

暂无评论

Enhanced cryptcoding: Joint Security and Advanced Dual-Step Quasi-Cyclic LDPC Coding

Enhanced Cryptcoding: Joint Security and Advanced Dual-Step ...

引用

IEEE Global Communications Conference

作者： Eran Pisek Shadi Abu-Surra Rakesh Taori James Dunham Dinesh Rajan Samsung Research America Southern Methodist University

ISBN: (纸本)9781479959532

关键词： AES Encryption Decryption LDPC Coding Wireless Communication Wired Communication cryptcoding low density parity check codes Decryption cryptography CARRIER SYSTEM AES gene Auger electron spectroscopy Wireless networks dynamic efficiency coding error-resilience Security level Data Security

来源：评论

学校读者我要写书评

暂无评论

Fast Decoding of Images With Cryptcodes for Burst Channels

引用

IEEE ACCESS 2023年 11卷 50823-50829页

作者： Popovska-Mitrovikj, Aleksandra Mechkaroska, Daniela Bakeva, Verica Ss Cyril & Methodius Univ Skopje Fac Comp Sci & Engn Skopje 1000 North Macedonia Univ Informat Sci & Technol St Paul Apostle Fac Commun Networks & Secur Ohrid 6000 North Macedonia

The concept of cryptcoding arises from the need to obtain secure and accurate transmission. This has led to an intensive development of coding theory and cryptography as scientific fields dealing with these problems. To ensure efficient and secure data transmission at the same time, the concept of cryptcoding is being developed, in which the coding and encryption processes are merged into one process. Cryptcodes provide correction of a certain number of errors in the transmitted message and data confidentiality, using only one algorithm. In this paper, we consider cryptcodes based on quasigroups, proposed elsewhere. Also, Burst-Cut-Decoding, Burst-4-Sets-Cut-Decoding, FastB-Cut-Decoding and FastB-4-Sets-Cut-Decoding algorithms for transmission of messages through burst channels have been defined and investigated elsewhere. Here, we investigate performances of these algorithms for transmission of images through burst channels. We made experiments for different channel parameters and compared the results obtained with different decoding algorithms of these cryptcodes. In all experiments, we considered the bit-error probability and the differences between the transmitted and decoded images. From the results presented in this paper we can conclude that Fast algorithms improve the performances of these cryptcodes for transmission of images over a burst channel. The best results are obtained by FastB-4-Sets-Cut-Decoding algorithm. In addition, to enhance the quality of the decoded images, we examined the application of a filter for visual correction of unsuccessfully decoded pixels using the surrounding pixels. The considered cryptcodes and presented results can be useful for application in satellite digital video broadcasting (DVB-S) coding and encryption schemes.

关键词： Encryption Cryptography Noise measurement Error correction Computer science Visualization Read only memory cryptcoding error-correcting codes burst channel image quasigroups

来源：评论

学校读者我要写书评

暂无评论

Performances of Random Codes Based on Quasigroups for transmission of audio files 23

Performances of Random Codes Based on Quasigroups for transm...

引用

20th Telecommunications Forum (TELFOR)

作者： Popovska-Mitrovikj, Aleksandra Ilievski, Vladimir Bakeva, Verica Univ Ss Cyril & Methodius Skopje Fac Comp Sci & Engn POB 393 Skopje Macedonia

ISBN: (纸本)9781509000555

Error-correcting codes can be applied for transmission of images and audio files through a noise channel. Application of Random Codes Based on Quasigroups (RCBQ) for image transmission is considered elsewhere. In this paper we investigate performances of these codes for transmission of audio files through a binary-symmetric channel. We present and analyze several experimental results obtained using Cut-Decoding and 4-Sets-Cut-Decoding algorithms defined for RCBQ. In the experiments we use code (72, 576) with rate 1/8. We made experiments with Beethoven's "Ode to Joy".

关键词： random code cryptcoding error-correcting code packet-error probability bit-error probability audio file

来源：评论

学校读者我要写书评

暂无评论

New Cryptcodes for Burst Channels 8th

New Cryptcodes for Burst Channels

引用

8th International Conference on Algebraic Informatics (CAI)

作者： Mechkaroska, Daniela Popovska-Mitrovikj, Aleksandra Bakeva, Verica Ss Cyril & Methodius Univ Fac Comp Sci & Engn Skopje North Macedonia

ISBN: (纸本)9783030213633;9783030213626

RCBQ are cryptcodes proposed in 2007. After that, several papers for performances of these codes for transmission through a binary-symmetric and Gaussian channels, have been published. Also, for improving the performances of these codes several new algorithms have been defined. In this paper we proposed a new modification of existing cryptcodes obtaining new cryptcodes suitable for transmission in burst channels. For generating burst errors we use the model of Gilbert-Elliott burst channel. Experimental results for bit-error and packet-error probabilities obtained for different channel and code parameters are presented. Also, we made comparison of the results obtained with the old and the new algorithms for RCBQ.

关键词： cryptcoding Gilbert-Elliott channel SNR Bit-error probability Burst errors Quasigroup

来源：评论

学校读者我要写书评

暂无评论

Performances of Fast Algorithms for Random Codes Based on Quasigroups for Transmission of Audio Files in Gaussian Channel 10th

Performances of Fast Algorithms for Random Codes Based on Qu...

引用

10th International Conference on ICT Innovations (ICT Innovations) - Engineering and Life Sciences

作者： Mechkaroska, Daniela Popovska-Mitrovikj, Aleksandra Smiljkova, Verica Bakeva Ss Cyril & Methodius Univ Fac Comp Sci & Engn Skopje North Macedonia

ISBN: (纸本)9783030008253;9783030008246

RCBQ are cryptcodes proposed in 2007. Since then, for improving performance of these codes for data transmission through a binary-symmetric and Gaussian channels, several new algorithms have been proposed. The last proposed Fast-Cut-Decoding and Fast-4-Sets-Cut-Decoding algorithm give the best results for transmission of ordinary messages. In this paper we consider performances of these codes for transmission of audio files in Gaussian channel for different values of signal-to-noise ratio (SNR). We present and compare experimental results for bit-error and packet-error probabilities obtained using fast algorithms of RCBQ. In all experiments differences between sent and decoded audio files are considered. Also, a filter for enhancing the quality of the decoded audio files is proposed. The proposed filter makes additional cleaning of the noise in the decoded files, enabling clearer listening to the original sound even after transmission through a channel with lower values of SNR.

关键词： cryptcoding Gaussian channel Audio file Filter Quasigroup

来源：评论

学校读者我要写书评

暂无评论

Error-Correcting Codes with Cryptographic Algorithms

Error-Correcting Codes with Cryptographic Algorithms

引用

21st Telecommunications Forum (TELFOR)

作者： Popovska-Mitrovikj, Aleksandra Markovski, Smile Bakeva, Verica Univ Ss Cyril & Methodius Skopje Fac Comp Sci & Engn Skopje Macedonia

ISBN: (纸本)9781479914203

Error-correcting codes based on quasigroups are defined elsewhere. These codes are a combination of cryptographic algorithms and error correcting codes. In a paper of ours we succeed to improve the speed of the decoding process by defining new algorithm for coding and decoding, named "cut-decoding algorithm". Here, a new modification of the cut-decoding algorithm is considered in order to obtain further improvements of the code performances. We present several experimental results obtained with different decoding algorithms for these codes.

关键词： bit-error probability cryptcoding error-correcting code packet-error probability quasigroup quasigroup transformation random code

来源：评论

学校读者我要写书评

暂无评论

New Decoding Algorithm for Cryptcodes Based on Quasigroups for Transmission Through a Low Noise Channel 1

引用

9th International Conference on ICT Innovations - Data-Driven Innovation

作者： Popovska-Mitrovikj, Aleksandra Bakeva, Verica Mechkaroska, Daniela Ss Cyril & Methodius Univ Fac Comp Sci & Engn Skopje North Macedonia

ISBN: (数字)9783319675978

ISBN: (纸本)9783319675978;9783319675961

Random Codes Based on Quasigroups (RCBQ) are cryptcodes, so they provide (in one algorithm) a correction of certain amount of errors in the input data and an information security. Cut-Decoding and 4-Sets-Cut-Decoding algorithms are proposed elsewhere and they improve decoding of these codes. In the decoding process of these codes, three types of errors appear: more-candidate-error, null-error and undetected-error. More-candidate-errors can occur even all bits in the message are correctly transmitted. So, the packet-error (and bit-error) probability can be positive for very small bit-error probability in the noise channel. In order to eliminate this problem, here we define new decoding algorithms (called Fast-Cut-Decoding and Fast-4-Sets-Cut-Decoding algorithms) that enable more efficient and faster decoding, especially for transmission through a low noise channel. We present several experimental results obtained with these new algorithms. Also, we analyze the results for bit-error and packet-error probabilities and decoding speed when messages are transmitted through Gaussian channel with different values of signal-to-noise ratio (SNR).

关键词： cryptcoding Low noise channel Bit-error probability Packet-error probability Quasigroup

来源：评论

学校读者我要写书评

暂无评论

Error-Correcting Codes with Cryptographic Algorithms

Error-Correcting Codes with Cryptographic Algorithms

引用

Telecommunications Forum Telfor

作者： Aleksandra Popovska-Mitrovikj Smile Markovski Verica Bakeva Faculty of Computer Science and Engineering University "Ss Cyril and Methodius" - Skopje

ISBN: (纸本)9781479914180

关键词： Bit-error probability cryptcoding Error-correcting code Packet-error probability Quasigroup Quasigroup transformation Random code

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：