Recursive methods for some problems in coding and random permutations

DOI10.1007/978-3-030-67899-9_30MaRDI QIDQ831746zbMATH OpenOpenAlexFDO

Authors Ghurumuruhan Ganesan

Publication date 24 March 2022

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

zbMATH Keywords

minimum distancerandom permutationsminimum sizecycle momentslattice identification codeslocally recoverable codespartial locality

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

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

Cited in

(1)

• Recursive methods for some problems in coding and random permutations

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)