lexico permutations in OFDM

Part 1
Divide the input bits into m sub-blocks. The possible maximum number of permutation sequences is m!. From m! possible sequences, compute q (q<=m) permutation sequences following the lexicographical notation. Note, using the factorial notation, it's possible to generate the kth permutation sequence without generating the (k-1)th permutation sequence.
Show different ways of selecting these q permutation sequences (Select adjacent permutations, select the permutations randomly, select the permutations in an interleaved manner e.g P1, P3, P5….
Perform Hermitian Symmetry, modulation, IFFT and compute the PAPR, select the permutation with least PAPR, add DC and clip (DCO OFDM). Send the side information Perform demodulation using the side information.
Results in form of CCDF curves and BER diagrams. Repeat the above but using input symbols after QAM modulation.

Part 2
Set a threshold PAPR, e.g 6,7,8,9,10 dB. Select the permutation sequence randomly, compute its PAPR and check if it's less than the threshold, if less then send otherwise continue until you have done up to Q permutation sequences (From Q, select the permutation with the least PAPR and send it). Show the results in form of CCDF, BER curves (for DCO OFDM). Simulations in Matlab.

Reference
https://stemhash.com/efficient-permutations-in-lexicographic-order/