Pages that link to "Item:Q4968711"

The following pages link to Network Coding for Distributed Storage Systems (Q4968711):

Displaying 46 items.

• A study of the performance of novel storage-centric repairable codes (Q258553) (← links)
• Galois geometries and coding theory (Q908053) (← links)
• Combinatorial repairability for threshold schemes (Q1692160) (← links)
• Anticode-based locally repairable codes with high availability (Q1696053) (← links)
• A new hybrid coding scheme: homomorphic minimum bandwidth repairing codes (Q1700979) (← links)
• AC-RRNS: anti-collusion secured data sharing scheme for cloud storage (Q1726264) (← links)
• Universal secure rank-metric coding schemes with optimal communication overheads (Q1733972) (← links)
• Architecture-aware coding for distributed storage: repairable block failure resilient codes (Q1784988) (← links)
• Codes for distributed storage from 3-regular graphs (Q2012057) (← links)
• Trade-off for heterogeneous distributed storage systems between storage and repair cost (Q2021836) (← links)
• Bounds on generalized FR codes using hypergraphs (Q2053179) (← links)
• Johnson graph codes (Q2099157) (← links)
• Linear programming bounds for distributed storage codes (Q2176298) (← links)
• On non-uniform Flower codes (Q2202904) (← links)
• A new minimize matrix computation coding method for distributed storage systems (Q2298412) (← links)
• Functional repair codes: a view from projective geometry (Q2329407) (← links)
• A new piggybacking design for systematic MDS storage codes (Q2334436) (← links)
• Self-repairing codes (Q2340045) (← links)
• A survey and refinement of repairable threshold schemes (Q2413291) (← links)
• Max-flow min-cut theorems on dispersion and entropy measures for communication networks (Q2417851) (← links)
• Recovery of quantum information from a node failure in a graph (Q2677615) (← links)
• Optimal Resource Allocation in Coordinated Multi-Cell Systems (Q2871542) (← links)
• MaxMinSum Steiner Systems for Access Balancing in Distributed Storage (Q3174717) (← links)
• DD-POR: Dynamic Operations and Direct Repair in Network Coding-Based Proof of Retrievability (Q3196428) (← links)
• Linear Batch Codes (Q3460471) (← links)
• Fractional Repetition and Erasure Batch Codes (Q3460483) (← links)
• Network Coding for Distributed Storage Systems (Q4968711) (← links)
• Construction of one special minimum storage regenerating code when α=2 (Q5046472) (← links)
• Multilinear Algebra for Distributed Storage (Q5157585) (← links)
• Codes for Distributed Storage (Q5863765) (← links)
• Fractional decoding of \(r\)-Hermitian codes (Q6063234) (← links)
• Correcting adversarial errors with generalized regenerating codes (Q6067849) (← links)
• A survey on GANs for computer vision: recent research, analysis and taxonomy (Q6101360) (← links)
• A class of minimum storage cooperative regenerating codes with low access property (Q6112194) (← links)
• Multilinear algebra for minimum storage regenerating codes: a generalization of the product-matrix construction (Q6115444) (← links)
• On additive MDS codes with linear projections (Q6136699) (← links)
• A characterization of optimal constacyclic locally repairable codes (Q6204325) (← links)
• Extremal regular graphs and hypergraphs related to fractional repetition codes (Q6564084) (← links)
• Clay and product-matrix MSR codes with locality (Q6584333) (← links)
• Extension-based constructions of locally repairable fractional repetition codes (Q6584762) (← links)
• MDS array codes with efficient repair and small sub-packetization level (Q6632062) (← links)
• On information-theoretic secure multiparty computation with local repairability (Q6635769) (← links)
• Constructing leakage-resilient Shamir's secret sharing: over composite order fields (Q6637528) (← links)
• Fractional decoding and the Rosenbloom-Tsfasman metric (Q6646804) (← links)
• Towards breaking the half-barrier of local leakage-resilient Shamir's secret sharing (Q6652971) (← links)
• Some new constructions of optimal and almost optimal locally repairable codes (Q6655742) (← links)