A new hybrid coding scheme: homomorphic minimum bandwidth repairing codes
From MaRDI portal
Publication:1700979
DOI10.1007/s00607-017-0542-0zbMath1393.94929OpenAlexW2594502432WikidataQ122227243 ScholiaQ122227243MaRDI QIDQ1700979
Mehmet Emin Dalkilic, Elif Haytaoglu
Publication date: 22 February 2018
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00607-017-0542-0
Linear codes (general theory) (94B05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (2)
Cites Work
- Unnamed Item
- Theory of codes with maximum rank distance
- A new hybrid coding scheme: homomorphic minimum bandwidth repairing codes
- Self-repairing codes
- Polynomial Codes Over Certain Finite Fields
- Network Coding for Distributed Storage Systems
- Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction
This page was built for publication: A new hybrid coding scheme: homomorphic minimum bandwidth repairing codes