  In this paper, we study three applications of recursion to problems in coding
and random permutations. First, we consider locally recoverable codes with
partial locality and use recursion to estimate the minimum distance of such
codes. Next we consider weighted lattice representative codes and use recursive
subadditive techniques to obtain convergence of the minimum code size. Finally,
we obtain a recursive relation involving cycle moments in random permutations
and as an illustration, evaluate recursions for the mean and variance.
