Matrix structure, polynomial arithmetic, and erasure-resilient encoding/decoding

DOI10.1145/345542.345649MaRDI QIDQ3454773zbMATH OpenOpenAlexFDO

Authors Victor Y. Pan

Publication date 26 November 2015

Published in Proceedings of the 2000 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/345542.345649

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Decoding (94B35)

Recommendations

• Matrix structure and loss-resilient encoding/decoding
• A linear time erasure-resilient code with nearly optimal recovery
• Efficient erasure correcting codes
• scientific article; zbMATH DE number 1974618
• Fast systematic encoding of multiplicity codes

Cited in

(4)

• Erasure recovery matrices for encoder protection
• Fast systematic encoding of multiplicity codes
• A linear time erasure-resilient code with nearly optimal recovery
• Matrix structure and loss-resilient encoding/decoding

This page was built for publication: Matrix structure, polynomial arithmetic, and erasure-resilient encoding/decoding

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