Necessary and sufficient condition for the existence of symmetrical Reversible Variable Length Codes, based on Kraft's inequality

Reversible Variable Length Code is a class of variable length codes which are both prefix-free and suffix-free i.e. no codeword is a prefix and suffix of any other codeword. In this paper, we present a necessary and sufficient condition for the existence of symmetrical Reversible Variable Length Code over a D-ary code alphabet for a given bit length vector based on Kraft's inequality.