Recursive methods for some problems in coding and random permutations

DOI10.1007/978-3-030-67899-9_30OpenAlexW3128041330MaRDI QIDQ831746

Ghurumuruhan Ganesan

Publication date: 24 March 2022

Full work available at URL: https://arxiv.org/abs/2012.10896

zbMATH Keywords

minimum distanceminimum sizerandom permutationscycle momentslattice identification codeslocally recoverable codespartial locality

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Unnamed Item
• Unnamed Item
• A lower bound for the hitting set size for combinatorial rectangles and an application
• The cycle structure of random permutations
• Efficient construction of a small hitting set for combinatorial rectangles in high dimension
• On the locality of codeword symbols in non-linear codes
• On the Locality of Codeword Symbols
• On a new class of codes for identifying vertices in graphs
• Fundamentals of Error-Correcting Codes
• Codes for Distributed Storage
• Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction
• On the field of combinatory analysis
• The number of cycles in random permutations without long cycles is asymptotically Gaussian
• Ordered Cycle Lengths in a Random Permutation

This page was built for publication: Recursive methods for some problems in coding and random permutations