Sign inSubmit
Tips: “quotes” for a phrase · author:Lee · a DOI goes straight to its article

25 results for “permutation”
Set a search alert
Research ArticleOpen accessEvery word in the titleEfficient Decoding Algorithm for Binary Quadratic Residue Codes Using Reduced Permutation SetsHamza Boualame, Mostafa Belkasmi, Idriss ChanaThe Quadratic Residue (QR) codes have a rich mathematic structure. Unfortunately, their Algebraic Decoding (AD) is not generalizable for all QR codes. In this study, an efficient hard decoding algorithm is proposed to generalize the decoding of the binary systematic Quadratic Residue (QR) codes. The proposed decoder corrects t erroneous bits or less, in the received word, based on a … …Journal of Computer Science, Vol. 19, Issue 4 · 3 Apr 2023 · 6,015 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleA Permutation Test for Comparing Two Correlated Receiver Operating Characteristic CurvesOkeh Uchechukwu Marius, Onyeagu SidneyThe area under the Receiver Operating Characteristic (ROC) curve (AUC) is a summary measure when comparing two ROC curves. However, this summary measure is less informative when two ROC curves cross and have the same AUCs. In order to detect differences between ROC curves and to be able to tackle the problem of exchangeability of the labels between two diagnostic … …Journal of Mathematics and Statistics, Vol. 16, Issue 1 · 24 May 2020 · 8,129 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleExact Permutation Algorithm for Paired Observations: A General and Efficient VersionDavid T. MorseFor the better part of a century, methods have been illustrated for the enumeration of all possible permutations of cases from which an exact characterization of the likelihood of obtaining results as or more extreme as that observed may be determined without having to rely on parametric assumptions or schemes that may be only asymptotically correct. The challenge is the … …Journal of Mathematics and Statistics, Vol. 10, Issue 4 · 5 Jan 2015 · 6,672 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleExact Permutation Algorithm for Paired Observations: The Challenge of R. A. FisherJ. I. Odiase, S. M. OgbonmwanThe major handicap of permutation test is the logical and computational requirement necessary to develop and implement the exact permutation scheme. This study provides an algorithm that systematically enumerates all the distinct permutations of the paired observations in an experiment without the possibility of repeating any of the permutations. The permutation algorithm presented completely breaks down the permutation problem for … …Journal of Mathematics and Statistics, Vol. 3, Issue 3 · 30 Sep 2007 · 6,866 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleModified Hill Cipher with Key Dependent Permutation and Circular RotationV.U.K. Sastry, V. JanakiIn this study, we have modified the Hill cipher, by including a permutation and circular rotation into the cipher. Here both the permutation and the rotation depend upon the key. From the cryptanalysis and the avalanche effect, discussed in this study, we notice that the strength of the cipher is significant. …Journal of Computer Science, Vol. 3, Issue 9 · 30 Sep 2007 · 6,518 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleKey Based Random Permutation (KBRP)Shakir M. Hussain, Naim M. AjlouniThis study introduces a method for generating a particular permutation P of a given size N out of N! permutations from a given key. This method computes a unique permutation for a specific size since it takes the same key; therefore, the same permutation can be computed each time the same key and size are applied. The name of random … …Journal of Computer Science, Vol. 2, Issue 5 · 31 May 2006 · 7,366 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleA Block Cipher using Feistal's Approach Involving Permutation and Mixing of the Plaintext and the Additive Inverse of Key MatrixAruna Varanasi, S. U. KumarIn this research, we have developed a block cipher for a block of size 112 bits by using an iterative method involving a permutation of the plaintext and the subkeys generated in each iteration. Here we have represented the plaintext as a matrix of f size 14×8, comprising binary bits. In the process of encryption, we have used a key … …Journal of Computer Science, Vol. 4, Issue 2 · 28 Feb 2008 · 7,109 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleCrypto-Watermarking of Images based on the Permutation on Z/pZ and the Wavelet Decompositions of Legall 5/3Younes Benlcouiri, Moulay Chrif Ismaili, Abdelmalek Azizi, Mohammed BenabdellahIn this work, we are interested in the insertion of the watermarking of digital images in the frequency domain. The algorithm proposed uses the transformed into wavelet Legall 5/3 on an image encrypted by swapping on the Z/pZ field, to perform the watermarking. By consequence, this introduces the concept of keys to the traditional methods of non-blind watermarking. The results … …Journal of Computer Science, Vol. 15, Issue 6 · 26 Jun 2019 · 7,451 accessesView PDFCite
Research ArticleOpen accessEvery word in the titlePERMUTATION OF HTTPI AND HTTPS IN WEB SERVICES AGAINST ATTACKS FOR SECURITY ENHANCEMENTS. Chakaravarthi, V. RamachandranThe Hyper Text Transfer Protocol (HTTP) protocol plays a vital role in Web Services Security. Though the HTTPs provide excellent security, they are not flexible enough to allow caches. HTTPi provides high integrity and low security whereas HTTPs provide low integrity and high security. The goal of WS activity is to build up set of technologies in order to direct … …Journal of Computer Science, Vol. 10, Issue 3 · 30 Nov 2013 · 6,884 accessesView PDFCite
Research ArticleOpen accessIn the keywordsA Flexible, Real-Time Algorithm for Simulating Correlated Random Fields and Its PropertiesMichael A. Kouritzin, Fraser Newton, Biao WuContemporary real-time problems like CAPTCHA generation and optical character recognition can be solved effectively using correlated random fields. These random fields should be produced on a graph in order that problems of any dimension and shape can be handled. However, traditional solutions are often too slow, inaccurate or both. Herein, the Quick Simulation Random Field algorithm to produce correlated random … …Journal of Mathematics and Statistics, Vol. 13, Issue 3 · 29 Sep 2017 · 7,069 accessesView PDFCite