Linearized decomposition codes and finite integer set coverings

DOI10.1016/J.DISC.2020.112069MaRDI QIDQ2198389zbMATH OpenOpenAlexFDO

Authors Ghurumuruhan Ganesan

Publication date 10 September 2020

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2020.112069

zbMATH Keywords

finite integer set coveringslinearized decomposition codesparallel erasure correction

Mathematics Subject Classification ID

Other types of codes (94B60)

Recommendations

• Efficient erasure correcting codes
• A Tight Rate Bound and Matching Construction for Locally Recoverable Codes With Sequential Recovery From Any Number of Multiple Erasures
• Hierarchical erasure correction of linear codes
• Random matrices and codes for the erasure channel
• Generic erasure correcting sets: bounds and constructions

Cites work

• Covering the integers by arithmetic sequences
• Exact coverings of the integers by arithmetic progressions
• scientific article; zbMATH DE number 607286 (Why is no real title available?)
• On the Locality of Codeword Symbols
• Theory of codes with maximum rank distance

Cited in

(8)

• Coprimitive sets and inextendable codes
• Hierarchical erasure correction of linear codes
• Connections between scattered linear sets and MRD-codes
• Linear inequalities for covering codes. I. Pair covering inequalities
• scientific article; zbMATH DE number 4097281 (Why is no real title available?)
• Constructions, families, and tables of binary linear covering codes
• Some decompositions of Bernoulli sets and codes
• Generic erasure correcting sets: bounds and constructions

This page was built for publication: Linearized decomposition codes and finite integer set coverings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2198389)