Recursive methods for some problems in coding and random permutations
From MaRDI portal
Publication:831746
DOI10.1007/978-3-030-67899-9_30OpenAlexW3128041330MaRDI QIDQ831746FDOQ831746
Authors: Ghurumuruhan Ganesan 
Publication date: 24 March 2022
Full work available at URL: https://arxiv.org/abs/2012.10896
minimum distancerandom permutationsminimum sizecycle momentslattice identification codeslocally recoverable codespartial locality
Cites Work
- On the Locality of Codeword Symbols
- Title not available (Why is that?)
- On a new class of codes for identifying vertices in graphs
- Fundamentals of Error-Correcting Codes
- On the field of combinatory analysis
- On the locality of codeword symbols in non-linear codes
- Efficient construction of a small hitting set for combinatorial rectangles in high dimension
- The cycle structure of random permutations
- Ordered Cycle Lengths in a Random Permutation
- A lower bound for the hitting set size for combinatorial rectangles and an application
- Title not available (Why is that?)
- Codes for Distributed Storage
- Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction
- The number of cycles in random permutations without long cycles is asymptotically Gaussian
Cited In (1)
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 Q831746)
