Imagen de Portada

MSR Codes with Linear Field Size and Smallest Sub-packetization for Any Number of Helper Nodes

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Li, Guodong, Wang, Ningning, Hu, Sihuang, Ye, Min
Formato:	Preprint
Publicado:	2023
Materias:	Information Theory
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Lower Bounds on the Sub-Packetization of Optimal-Access MSR Codes for Multiple-Node Repair
por: Wang, Lewen, et al.
Publicado: (2025)

$\varepsilon$-MSR Codes for Any Set of Helper Nodes
por: Ramkumar, Vinayak, et al.
Publicado: (2024)

Constructing $(h,d)$ cooperative MSR codes with sub-packetization $(d-k+h)(d-k+1)^{\lceil n/2 \rceil}$
por: Zhang, Zihao, et al.
Publicado: (2024)

New Centralized MSR Codes With Small Sub-packetization
por: Zhang, Yaqian
Publicado: (2024)

Reducing The Sub-packetization Level of Optimal-Access Cooperative MSR Codes
por: Zhang, Yaqian, et al.
Publicado: (2026)

Rack-Aware MSR Codes with Linear Field Size and Smaller Sub-Packetization for Tolerating Multiple Erasures
por: Zhao, Hengming, et al.
Publicado: (2025)

Optimal Repair of $(k+2, k, 2)$ MDS Array Codes
por: Zhang, Zihao, et al.
Publicado: (2025)

Lower Bounds on Conversion Bandwidth for MDS Convertible Codes in Split Regime
por: Wang, Lewen, et al.
Publicado: (2025)

Coded Multi-User Information Retrieval with a Multi-Antenna Helper Node
por: Abolpour, Milad, et al.
Publicado: (2024)

Divisibility of Trace Codes
por: Huang, Hexiang, et al.
Publicado: (2026)

Generic Construction of Optimal-Access Binary MDS Array Codes with Smaller Sub-packetization
por: Ma, Lan, et al.
Publicado: (2025)

Efficient Repair of (k+2, k) Degraded Read Friendly MDS Array Codes With Sub-packetization 2
por: Li, Jie, et al.
Publicado: (2025)

Achieving Capacity of PIR with Private Side Information with Low Sub-packetization and without MDS Codes
por: Erhili, Leila, et al.
Publicado: (2024)

A Cooperative Repair Scheme for Zigzag MSR Codes in Distributed Storage Systems
por: Liu, Yajuan, et al.
Publicado: (2025)

Optimal $(2,δ)$ Locally Repairable Codes via Punctured Simplex Codes
por: Gao, Yuan, et al.
Publicado: (2023)

Trace Repair Never Loses to Classical Repair: Exact and Explicit Helper Nodes Selection
por: Kim, Wilton, et al.
Publicado: (2025)

Set Transformation: Trade-off Between Repair Bandwidth and Sub-packetization
por: Shi, Hao, et al.
Publicado: (2024)

Helper Data Schemes for Coded Modulation and Shaping in Physical Unclonable Functions
por: Fischer, Robert F. H.
Publicado: (2024)

Error Exponents for Oblivious Relaying and Connections to Source Coding with a Helper
por: Wu, Han, et al.
Publicado: (2025)

Helper-Assisted Coding for Gaussian Wiretap Channels: Deep Learning Meets PhySec
por: Rana, Vidhi, et al.
Publicado: (2026)

Relay Channels with Unreliable Helpers
por: Steinberg, Yossef
Publicado: (2024)

Linear Complexity Computation of Code Distance and Minimum Size of Trapping Sets for LDPC Codes with Bounded Treewidth
por: Peng, Qingqing, et al.
Publicado: (2025)

Bidirectional Piggybacking Design for Systematic Nodes with Sub-Packetization $l=2$
por: Wang, Ke
Publicado: (2025)

On the Maximum Size of Codes Under the Damerau-Levenshtein Metric
por: Ye, Zuo, et al.
Publicado: (2025)

SCL Decoding of Non-Binary Linear Block Codes
por: Lin, Jingyu, et al.
Publicado: (2025)

Explicit Representatives and Sizes of Cyclotomic Cosets and their Application to Cyclic Codes over Finite Fields
por: Zhu, Li, et al.
Publicado: (2024)

On the Minimum Depth of Circuits with Linear Number of Wires Encoding Good Codes
por: Drucker, Andrew, et al.
Publicado: (2024)

Improved Field Size Bounds for Higher Order MDS Codes
por: Brakensiek, Joshua, et al.
Publicado: (2022)

On Low Field Size Constructions of Access-Optimal Convertible Codes
por: Chopra, Saransh, et al.
Publicado: (2024)

Modulation and Estimation with a Helper
por: Khina, Anatoly, et al.
Publicado: (2023)

Integrated Sensing and Communication with Distributed Rate-Limited Helpers
por: Chen, Yiqi, et al.
Publicado: (2025)

A Sequential Computation Algorithm for the Center of the Smallest Enclosing Ball
por: Nakagawa, Kenji, et al.
Publicado: (2025)

List-Recovery of Random Linear Codes over Small Fields
por: Doron, Dean, et al.
Publicado: (2025)

The State-Dependent Channel with a Rate-Limited Cribbing Helper
por: Lapidoth, Amos, et al.
Publicado: (2024)

Covert Communication Over a Quantum MAC with a Helper
por: ZivariFard, Hassan, et al.
Publicado: (2025)

Optimal Online Bookmaking for Any Number of Outcomes
por: Tal, Hadar, et al.
Publicado: (2025)

On Construction of Linear (Euclidean) Hull Codes over Finite Extensions Binary Fields
por: Bhowmick, Sanjit, et al.
Publicado: (2025)

Smart Helper-Aided F-RANs: Improving Delay and Reducing Fronthaul Load
por: Mokhtarzadeh, Hesameddin, et al.
Publicado: (2023)

Helper-Friendly Latency-Bounded Mitigation Strategies against Reactive Jamming Adversaries
por: Hazra, Soumita, et al.
Publicado: (2025)

Linear Network Coding for Robust Function Computation and Its Applications in Distributed Computing
por: Wei, Hengjia, et al.
Publicado: (2024)