VIDYA VIKAS INSTITUTE OF ENGINEERING & TECHNOLOGY,

MYSURU
DEPARTMENT OF MATHEMATICS

PEDAGOGY INTERVENTION–PI1-RESEARCH PAPER SURVEY FOR UG

Course Name DISCRETE MATHEMATICAL STRUCTURES

Course Code BCS405A

Semester 4TH Sem

Prof.ASHAWINI M.P.
Faculty In Charge
Dr. M. S. SUREKHA
Activity Name LITERATURE SURVEY

Student Name MANDARA D D

USN 4VM22IS022

Topic Real Time Application of Permutations

MARKS AWARDED
Particulars Max Marks Marks Obtained

Introduction of topic 05

Students involvement 02

Description of content 05

Source of reference 03

Report 10

Total 25

Signature of the Student Signature of the Faculty

 CONTENTS

SERIAL NO. TITLE

1 Title of Research Papers and Author

2 Description of Research Papers

3 Conclusion

4 References

2
 PERMUTATIONS
INTRODUCTION:

Permutations are a fundamental concept in combinatorics and mathematics that deal with the arrangement of
elements in a specific order. When we think about permutations, we are considering the different ways we can
order a set of items. This concept is widely used across various fields, including mathematics, computer
science, statistics, and more.

In essence, a permutation of a set is any ordered arrangement of its elements. For instance, consider the set
{1, 2, 3}. The different permutations of this set include (1, 2, 3), (1, 3, 2), (2, 1, 3), (2, 3, 1), (3, 1, 2), and (3,
2, 1). Each of these represents a unique ordering of the elements of the set.

A permutation of a set of n elements is one of the possible ways to arrange those elements. If the set has n
distinct elements, the total number of permutations is given by n! (n factorial), where: n!=n*(n−1)*(n−2)*…*1

For example, the number of permutations of a set of 4 elements (e.g., {A, B, C, D}) is: 4!=4×3×2×1=24

TYPES OF PERMUTATIONS:

1. Permutations of Distinct Items: All elements in the set are unique. The number of permutations is
straightforwardly n!
2. Permutations with Repeated Items: Some elements in the set are repeated. The formula for the
number of permutations in this case is adjusted to account for the repetitions:

𝑛!
𝑛1 ! ∗ 𝑛2 ! ∗ 𝑛3 ! … … . .∗ 𝑛𝑘 !

3
APPLICATIONS OF PERMUTATIONS:

1. Counting and Probability:Permutations are crucial in calculating probabilities, especially in scenarios

where the order of events matters.

 Card Games: In a standard deck of 52 cards, the number of possible permutations (shuffles) is ( 52!).
This is essential for understanding the randomness and fairness in card games.
 Lottery: In lottery draws where the order of numbers matters, permutations help in determining the
odds of winning.

2. Combinatorial Problems:Permutations are used to solve various combinatorial problems, helping to

determine the number of possible arrangements or sequences.

 Seating Arrangements: Calculating the number of ways to arrange a group of people in a row.
 Password Generation: Determining the number of possible passwords of a certain length using a set of
characters.

3. Cryptography:Permutations are fundamental in the field of cryptography, where they are used to create
complex encryption schemes and ensure data security.

 Block Ciphers: Algorithms like the Data Encryption Standard (DES) use permutations in their
encryption processes to obfuscate plaintext data.
 Permutation Ciphers: A simple encryption technique where the positions of characters in the plaintext
are permuted according to a fixed system.

4. Computer Science:In computer science, permutations are used in algorithms, data structures, and problem-
solving techniques.

 Sorting Algorithms: Permutations help in understanding and developing sorting algorithms, like
bubble sort and quicksort.
 Permutational Algorithms: Algorithms specifically designed to generate permutations, such as Heap's
algorithm and the Johnson-Trotter algorithm.

5.Game Theory and Puzzles:Permutations are used to analyze and solve puzzles and games, where the
arrangement of pieces or moves is crucial.

 Rubik’s Cube: Solving the Rubik’s Cube involves understanding the permutations of its pieces.

 Permutational Puzzles: Puzzles like the 15-puzzle and permutation chess problems.

4
 OLD RESEARCH PAPERS ON PERMUTATIONS

01.Permutation Matrix Modulation

Rahmat Faddli Siregar , Nandana Rajatheva , and Matti Latva-Aho

INTRODUCTION:

The paper presents a novel modulation scheme called Permutation Matrix Modulation (PMM) designed for
Multiple Input Multiple Output (MIMO) systems. The authors aim to enhance data transmission efficiency by
utilizing permutation matrices, which allow for the modulation of additional information bits without the need
for Channel State Information at the Transmitter (CSIT). This approach is particularly relevant in the context
of modern wireless communication systems, where maximizing data rates while minimizing hardware
complexity is crucial.

The introduction sets the stage by discussing the evolution of modulation techniques in MIMO systems,
particularly focusing on Spatial Modulation (SM) and Generalized Spatial Modulation (GSM). The authors
highlight the limitations of these existing methods, such as their reliance on CSIT and the potential
inefficiencies in utilizing inactive antennas. The introduction effectively establishes the need for a new
approach, leading to the proposal of PMM.

KEY OBSERVATIONS:

Achievable Rate Analysis: The authors derive a closed-form expression for the achievable rate of PMM under
a Gaussian Mixture Model (GMM) distribution. They demonstrate that PMM outperforms SM and GSM
across various SNR levels, providing a significant advancement in the field.

Detection Schemes: A new detection scheme based on zero-forcing (ZF) is proposed, and its performance is
compared with maximum likelihood (ML) detection. The authors provide a thorough analysis of the trade-
offs between SER performance and computational complexity, highlighting that while ML detection yields
better SER, ZF detection is more practical due to its lower complexity.

Optimization Problem: The paper formulates an optimization problem to maximize the achievable rate of
PMM. The authors show that even without CSIT, PMM can achieve performance close to that of MIMO
systems with full antenna activation, which is a significant finding.

5
METHODOLOGY:

The paper proposes Permutation Matrix Modulation (PMM) for MIMO systems, where information bits are
divided between Q-ary constellation symbols and permutation matrices. The achievable rate is analyzed under
a Gaussian Mixture Model, and optimal power allocation is determined. Two detection schemes, Zero-Forcing
and Maximum Likelihood, are evaluated, with simulations showing PMM's superior performance compared
to existing techniques in terms of rate and Symbol Error Rate (SER).

CONCLUSION:

The conclusion effectively summarizes the main findings and contributions of the paper. The authors reiterate
the advantages of PMM, including its ability to transmit more information bits efficiently and its practical
implementation benefits. They also express intentions to explore further applications of PMM, particularly in
scenarios lacking perfect CSIR and in multi-user systems. This forward-looking perspective adds value to the
paper, suggesting avenues for future research.

Overall, the paper makes a significant contribution to the field of wireless communication by introducing
PMM as a viable alternative to existing modulation schemes. The thorough analysis, clear presentation, and
practical implications of the research make it a valuable resource for both researchers and practitioners in the
field. The findings are well-supported by simulations and theoretical analysis, providing a solid foundation
for future work in this area.

Link:https://ieeexplore-ieee-org-vtuconsortia.knimbus.com/document/10002396/

6
 02.Permutation Entropy for Graph Signals
John Stewart Fabila-Carrasco , Chao Tan , and Javier Escudero

INTRODUCTION:
The paper titled "Permutation Entropy for Graph Signals" by John Stewart Fabila-Carrasco, Chao Tan, and
Javier Escudero introduces a novel approach to extend permutation entropy (PE) to graph signals, thus
enabling the measurement of signal irregularity on graphs.
Permutation entropy (PE) is a nonlinear metric originally designed to quantify the complexity of time series
by analyzing the order of neighboring values. Its applications span various fields, including biomedicine,
physics, and economics. Although PE has been extended to two-dimensional (2D) and three-dimensional (3D)
data, there was no prior development for signals on irregular domains, like graphs.

KEY OBSERVATIONS:
 Classical PE: Requires an input time series, choice of parameters (embedding dimension ( m ) and
time delay ( L )), computation of permutation patterns, and entropy value calculation. Most
modifications focus on these elements.
 Multivariate and Higher-dimensional PE: Extensions exist for multivariate time series and regular
domains (2D and 3D), but not for irregular domains.
 Graph Signal Processing (GSP): Studies data on irregular graphs, motivated by technological advances
that enable recording complex systems data.
 Extension of PE to Graphs: Introducing a novel method to compute permutation entropy for graph
signals (PEG), combining signal values with graph topology.
 Exploration of PEG: Analysis of how PEG depends on both the signal and the graph, providing
conditions to modify the graph while maintaining signal entropy.
 Application to Various Graphs: The method can be applied to signals on undirected, directed, and
weighted graphs.

METHODOLOGY:
The classical PE method is adapted for graph signals by considering neighboring vertices instead of successive
values. This adaptation allows the computation of PE on graphs, extending the entropy metric's applicability
beyond regular domains to any graph structure.
Experimental Results:
 Periodic vs. Synthesized Textures: PEG discriminates between synthetic and periodic textures,
aligning with existing methods for 2D data.

7
  Random Signals on Different Graph Structures: PEG distinguishes between different degrees of graph
regularity, demonstrating its sensitivity to the underlying graph structure.

CONCLUSION:
The paper presents a significant advancement in entropy metrics by generalizing PE to graph signals. This
development opens new possibilities for analyzing complex data on irregular domains, contributing to the
fields of signal processing and data analysis.This paper lays the groundwork for further research into entropy
metrics for graph signals and their applications in various scientific and engineering domains.

Link:https://ieeexplore-ieee-org-vtuconsortia.knimbus.com/document/9756895/

8
 03.A Fast Chaotic Image Encryption Scheme With Simultaneous
Permutation-Diffusion Operation
Lidong liu,Yuhang lei ,Dan wang

INTRODUCTION:
The paper "A Fast Chaotic Image Encryption Scheme With Simultaneous Permutation-Diffusion Operation"
proposes a novel image encryption method designed to enhance security and speed. The key innovations of
this scheme include the use of a Sine-Sine chaotic map for simultaneous permutation and diffusion of pixel
values, which significantly improves resistance to various types of attacks and reduces time complexity.

KEY OBSERVATIONS:
 The proposed scheme effectively resists separated attacks and chosen plaintext attacks. This is
achieved by coupling permutation and diffusion operations using the Sine-Sine chaotic map, which
ensures that the keystreams are dynamic and related to the plaintext.
 The encryption process is enhanced by making the initial values of the chaotic maps dependent on
previously encrypted pixels, generating unique keystreams for different plaintext images.
 The algorithm processes pixel values at the row and column levels rather than the pixel level,
significantly improving encryption speed.
 Comparative tests demonstrate that this scheme outperforms existing methods in terms of security
performance, encryption effect, and speed.
 The proposed scheme exhibits low time complexity and rapid encryption capabilities, making it
suitable for real-time and batch transmission of digital images.
 The scheme employs two types of chaotic maps: the 2D Hénon-Sine map and the Sine-Sine map,
which provide better ergodicity and randomness than traditional one-dimensional maps.
 The key space of the scheme is large enough to resist brute-force attacks, and statistical analyses show
that the cipher images have uniform distributions, making them robust against statistical attacks.
 The paper includes extensive simulation results and security analysis, proving the scheme’s robustness
against various types of attacks such as statistical, differential, chosen, and known plaintext attacks.
 The performance evaluation shows that the proposed method is faster than other state-of-the-art
encryption schemes, making it efficient for practical applications.

9
METHODOLOGY:
The methodology of the paper involves a novel image encryption scheme that combines the processes of
permutation and diffusion into a single step using a Sine-Sine chaotic map. The scheme encrypts images by
processing pixel values row-wise and column-wise, generating dynamic key streams that are dependent on
both the secret keys and the previously encrypted pixels. This approach improves encryption speed and
resistance to common attacks, making it suitable for real-time image transmission.

CONCLUSION:
The paper provides a comprehensive examination of the proposed encryption scheme, including theoretical
foundations, detailed descriptions of the chaotic maps used, and thorough experimental validations. The
findings indicate significant advancements in the field of image encryption, particularly in balancing security
and computational efficiency.
The authors plan to focus on improving the algorithm’s resistance to noise and occlusion attacks, as the current
scheme assumes lossless image transmission. Future research will address the design of an encryption
algorithm capable of handling images with noise or partial data loss during transmission.

Link:https://ieeexplore-ieee-org-vtuconsortia.knimbus.com/document/8984280/

10
 04.A Permutation-Based Model for Analysis of Resource Allocation
Overheads in Vehicular Ad Hoc Networks
Xin zhang, zhongyi shen ,and dacheng yang
INTRODUCTION:
The paper addresses the significant issue of resource allocation overheads in Vehicular Ad Hoc Networks
(VANETs), which is critical due to the dynamic and self-organizing nature of these networks. A novel
permutation-based model is proposed to analyze the theoretical limits of these overheads, treating the resource
allocation patterns as a permutation process. This approach helps in deriving the minimum bits required to
represent resource allocation information, offering a fresh perspective on optimizing network efficiency.
VANETs improve road safety and traffic efficiency by enabling vehicles to exchange status information
periodically. However, the distributed nature of resource allocation in VANETs introduces substantial
overhead due to the necessity of control messages. To address this, the paper proposes a permutation-based
model to analyze these overheads, particularly focusing on the theoretical limits and practical implications.

KEY OBSERVATIONS:
Existing research has extensively explored routing overheads in mobile ad hoc networks but often neglected
the initial resource allocation overheads in VANETs. Previous models tend to simplify scenarios, assuming
constant node numbers and ordered resource access, which does not reflect the complex, dynamic nature of
VANETs. This paper fills the gap by providing a comprehensive model that considers node distribution,
resource reuse, and dynamicity.

METHODOLOGY:
The paper introduces a permutation-based model for resource allocation in VANETs. Key features include:
 Node Distribution and Dynamicity: The model accounts for the geographical distribution of nodes and
their dynamic behavior.
 Bipartite Graph Representation: This is used to describe the resource reuse process among nodes.

CONCLUSION:
The paper presents a generalized methodology for analyzing resource allocation overheads in VANETs, which
is not limited to any specific protocol. It introduces a novel permutation-based model that considers practical
aspects such as node distribution and dynamicity. Future work will focus on extending this model to other
decentralized networks and further analyzing the trade-offs between system performance and overheads.

Link:https://ieeexplore-ieee-org-vtuconsortia.knimbus.com/document/8752221/

11
 05.Quantum Image Encryption Using Intra and Inter Bit Permutation
Based on Logistic Map
Xingbin liu,Di xiao,and Yanping xiang
INTRODUCTION:
This paper proposes a novel quantum image encryption scheme that uses intra and inter bit permutation
operations based on a logistic map. The scheme first represents the image in a quantum form using a novel
enhanced quantum representation (NEQR) model. Then, it applies intra bit permutation within each bit-plane
and inter bit permutation between different bit-planes to scramble the pixels. Finally, a chaotic diffusion
procedure is performed to further secure the image. The scheme is shown to be secure against various attacks,
including statistical analysis, key sensitivity, and chosen-plaintext attacks. The computational complexity of
the scheme is also analyzed and compared with classical image encryption algorithms .

KEY OBSERVATIONS:
 A novel quantum image encryption scheme using intra and inter bit permutation operations based on
a logistic map.
 The use of NEQR model to represent the image in a quantum form.
 The application of chaotic diffusion procedure to further secure the image.
 Analysis of the scheme's security against various attacks and computational complexity.

METHODOLOGY:
The paper uses a combination of theoretical analysis and numerical simulations to evaluate the performance
of the proposed scheme. The simulations are performed using Matlab and the results are compared with
existing classical image encryption algorithms.
The results show that the proposed scheme is secure against various attacks and has a lower computational
complexity compared to classical image encryption algorithms.

CONCLUSION:
The paper concludes that the proposed quantum image encryption scheme is a secure and efficient method for
protecting images against unauthorized access. The scheme's use of intra and inter bit permutation operations
and chaotic diffusion procedure makes it resistant to various attacks, and its lower computational complexity
makes it suitable for practical applications.

Link:https://ieeexplore-ieee-org-vtuconsortia.knimbus.com/document/8590698/

12
REFERENCES:
 A. I. Ibrahim, T. Kim, and D. J. Love, “On the achievable rate of generalized spatial modulation using
multiplexing under a Gaussian mixture model,” IEEE Trans. Commun., vol. 64, no. 4, pp. 1588–
1599,Apr. 2016.
 R. Y. Mesleh, H. Haas, S. Sinanovic, C. W. Ahn, and S. Yun, “Spatial modulation,” IEEE Trans. Veh.
Technol., vol. 57, no. 4, pp. 2228–2241,Jul. 2008.
 B. Girault, “Stationary graph signals using an isometric graph translation,”in Proc. 23rd Eur. Signal
Process. Conf., 2015, pp. 1516–1520.
 X. Li, G. Ouyang, and D. A. Richards, “Predictability analysis of absence seizureswith permutation
entropy,” Epilepsy Res., vol. 77, no. 1, pp. 70–74,2007.
 J. S. Fabila-Carrasco, C. Tan, and J. Escudero, “Multivariate permutation entropy, a cartesian graph
product approach,” arXiv:2203.00550. [Online].Available: https://arxiv.org/abs/2203.00550
 Y. Luo, R. Zhou, J. Liu, S. Qiu, and Y. Cao, ``An efcient and self-adapting colour-image encryption
algorithm based on chaos and interactions amongmultiple layers,'' Multimed Tools Appl., vol. 77, no.
20, pp. 2619126217,Oct. 2018.
 L. Liu, L. Zhang, D. Jiang, Y. Guan, and Z. Zhang, ``A simultaneous scrambling and diffusion color
image encryption algorithm based on Hop_eld chaotic neural network,'' IEEE Access, vol. 7, pp.
185796_185810, 2019.
 L. Liu, Y. Wang, L. Hou, and X. Feng, ``An easy encoding and low bit-error-rate chaos communication
system based on reverse-time chaotic oscillator,'' IET SignalProcess., vol. 11, pp. 869_876, 2017.
 H. A. Omar, W. Zhuang, and L. Li, ``VeMAC: A TDMA-based MAC protocol for reliable broadcast
in VANETs,'' IEEE Trans. Mobile Comput., vol. 12, no. 9, pp. 1724_1736, Sep. 2013.
 S. Cao andV. C. S. Lee, ``Anovel adaptive TDMA-basedMAC protocol for VANETs,'' IEEE Commun.
Lett., vol. 22, no. 3, pp. 614_617, Mar. 2018.
 F. Lyu, H. Zhu, H. Zhou, L. Qian, W. Xu, M. Li, and X. Shen, ``Momac: Mobility-aware and collision-
avoidance MAC for safety applications in VANETs,'' IEEE Trans. Veh. Technol., vol. 67, no. 11, pp.
10590_10602,Nov. 2018.
 K. A. Hafeez, L. Zhao, J.W. Mark, X. Shen, and Z. Niu, ``Distributed multichannel and mobility-
aware cluster-based MAC protocol for vehicular ad hoc networks,'' IEEE Trans. Veh. Technol., vol.
62, no. 8, pp. 3886_3902,Oct. 2013.
 C. Zhu, G. Wang, and K. Sun, ``Improved cryptanalysis and enhance- ments of an image encryption
scheme using combined 1D chaotic maps,'' Entropy, vol. 20, no. 11, 2018, Art. no. 843.
 C. Zhu and K. Sun, ``Cryptanalyzing and improving a novel color image encryption algorithm using
RT-enhanced chaotic tent maps,'' IEEE Access,vol. 6, pp. 1875918770, 2018.

13