The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
This paper proposes a cyclic steganographic scheme based on cyclic codes for embedding secret message. This scheme is capable of achieving low complexity and fast embedding time. These are two attractive reasons for this method: first, embedding and secret message extraction can be implemented easily by employing shift registers with feedback connections, and second, because they are rich in coding...
This study proposes a novel coding method, called geometry permutation decoding (GPD). The GPD algorithm provides a two dimension geometry construction and decodes information sequence based on this construction. Majority logic decoding (MLD) algorithm can be used for some specially coding scheme, especially finite geometry codes. MLD algorithms are simple and fast owing to the finite geometry construction,...
This work presented not only a modified verifiable secret sharing (VSS) system but also a high security halftone image with low distortion. Reliability of sequence transmission is required in the design of VSS systems. Another major topic of VSS systems for transmission is the control of binary errors so that the VSS sequence can be reliably reproduced. The modified VSS systems differ from original...
In this paper, a steganographic system for VQ codebooks using section-based informed embedding (SBIE) is presented. The goal is to offer a stego-image for secure communication. In the proposed scheme, the secret image is first compressed by a unsupervised fuzzy competitive learning network clustering technology (named FCLN) based on VQ, then a section-based informed embedding algorithms are presented...
A matrix embedding (ME) code was developed as a commonly used steganographic technique by using a parity check matrix to perform embedding. In this paper, we propose a new approach to embedding algorithm using convolutional codes to improve the embedding efficiency. Higher embedding efficiency brings to better steganographic security. The proposed algorithm uses the time-varying convolutional codes...
Brain-computer interfaces provide a communication channel between human neurons and machines using electroencephalography (EEG) signals. In this paper, an analysis system is presented for single-trial electroencephalogram (EEG) classification. Combined with event-related synchronization (ERS) and event-related desynchronization (ERD), the Competitive Hopfield Clustering Network (CHCN) is applied to...
A novel steganographic algorithm for ternay data based on ZZW construction over F_3 is proposed to improve the embedding efficiency. Contrast to the conventional ZZW construction using binary Hamming codes in the second channel, the proposed method employs ternary Hamming codes to embed the message at the second channel. For the first channel, a low rate convolutional codes is presented to enhance...
A matrix embedding (ME) code is a commonly used steganographic technique that used linear block codes to perform the embedding process. However, a lack of low-complexity maximum-likelihood decoding schemes in linear block codes limited the embedding efficiency for sufficiently large lengths. This paper proposes a novel and practical hiding algorithm for binary data based on convolutional codes. Compared...
A novel sub optimal hiding algorithm for binary data based on iterative searching embedding, ISE, is proposed. In most cases, an ML algorithm is criticized for being extremely sensitive to the dimension (n-m), due to the fact that the operation complexity varies exponentially with (n-m). Rather the complexity exhibits a linear dependence on (n-m) when performing ISE, making it applicable to a long...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.