A Novel Representation for Permutations

In this paper, we present a variable-length binary code for permutations of degree n , where n is a power of 2. The Lehmer code and its variants provide a bijection between permutations and the indexes in lexicographic ordering. They provide compression of permutations approaching Shannon bound at t...

Full description

Bibliographic Details

Published in:	IEEE transactions on information theory Vol. 67; no. 3; p. 1920
Main Authors:	Won-Ho Ri, Ok-Hyon Song
Format:	Journal Article
Language:	English
Published:	New York The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 01.03.2021
Subjects:	Binary codes Codes Decoding Enumeration Lookup tables Permutations
ISSN:	0018-9448, 1557-9654
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!