Permutation Encodings

Permutation Encodings is a formal method in combinatorics that represents permutations through structured symbolic or numerical sequences to systematically capture their order-theoretic properties and positional relationships.

65

Publications

2.9K

Citations

146

Authors

81

Institutions

Publications per year

2017–2026

10

Authors

146

  1. MC
    Maria Chroni

    University of Ioannina, Greece

    3 publications · 51 citations

    3

    h-index

  2. SD
    Stavros D. Nikolopoulos

    University of Ioannina, Greece

    3 publications · 51 citations

    3

    h-index

  3. HK
    Hari Kalva

    Florida Atlantic University, United States

    2 publications · 46 citations

    2

    h-index

  4. DĆ
    Dubravko Ćulibrk

    University of Novi Sad, Serbia

    2 publications · 46 citations

    2

    h-index

  5. SS
    Spyros S. Magliveras

    Florida Atlantic University, United States

    2 publications · 46 citations

    2

    h-index

1–5 of 146

Venues

  1. IEEE Transactions on Information Theory

    6 publications · 277 citations

    6

    h-index

  2. Discrete Mathematics

    3 publications · 61 citations

    3

    h-index

  3. Designs Codes and Cryptography

    3 publications · 257 citations

    3

    h-index

  4. Theoretical Computer Science

    2 publications · 69 citations

    2

    h-index

  5. Nonlinear Dynamics

    2 publications · 64 citations

    2

    h-index

1–5