Recursive methods for some problems in coding and random permutations
From MaRDI portal
Publication:6356537
DOI10.1007/978-3-030-67899-9_30arXiv2012.10896MaRDI QIDQ6356537
Publication date: 20 December 2020
Abstract: 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.
This page was built for publication: Recursive methods for some problems in coding and random permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6356537)
