Cover Image

New EVENODD+ Codes with More Flexible Parameters and Lower Complexity

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Zhu, Panyu
Format:	Preprint
Published:	2024
Subjects:	Information Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

New Channel Coding Lower Bounds for Noisy Permutation Channels
by: Feng, Lugaoze, et al.
Published: (2024)

Two New Families of Local Asymptotically Minimax Lower Bounds in Parameter Estimation
by: Merhav, Neri
Published: (2024)

Reed-Solomon Codes over Cyclic Polynomial Ring with Lower Encoding/Decoding Complexity
by: Liu, Wenhao, et al.
Published: (2024)

Order Optimal Cascaded Code Distributed Computing With Low Complexity and Improved Flexibility
by: Zhang, Mingming, et al.
Published: (2023)

ORCAS Codes: A Flexible Generalization of Polar Codes with Low-Complexity Decoding
by: Zunker, Andreas, et al.
Published: (2025)

Balanced Low-Complexity and Flexible Error-Correction List Flip Decoding for Polar Codes
by: Lv, Yansong, et al.
Published: (2023)

New Quantum MDS Codes with Flexible Parameters from Hermitian Self-Orthogonal GRS Codes
by: Campion, Oisin, et al.
Published: (2025)

Polar Complexity: A New Descriptive Complexity with Applications to Source and Joint Source-Channel Coding
by: Yao, Xinyuanmeng, et al.
Published: (2026)

On the Parameters of Codes for Data Access
by: Kilic, Altan B., et al.
Published: (2024)

Lowering the Error Floor of Error Correction Code Transformer
by: Park, Taewoo, et al.
Published: (2025)

Repeated-Root Cyclic Codes with Optimal Parameters or Best Parameters Known
by: Chen, Hao, et al.
Published: (2024)

Improved Constructions and Lower Bounds for Maximally Recoverable Grid Codes
by: Brakensiek, Joshua, et al.
Published: (2025)

Exponential Lower Bounds for Locally Decodable and Correctable Codes for Insertions and Deletions
by: Blocki, Jeremiah, et al.
Published: (2021)

The Exact Parameters of A Family of BCH Codes
by: Sun, Zhonghua
Published: (2025)

Exponential Lower Bounds for 2-query Relaxed Locally Decodable Codes
by: Block, Alexander R., et al.
Published: (2026)

Locally Repairable Convertible Codes: Improved Lower Bound and General Construction
by: Ge, Songping, et al.
Published: (2025)

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

Simpler Gradient Methods for Blind Super-Resolution with Lower Iteration Complexity
by: Li, Jinsheng, et al.
Published: (2024)

Lower Bounds for Error Coefficients of Griesmer Optimal Linear Codes via Iteration
by: Guan, Chaofeng, et al.
Published: (2025)

Tight Lower Bounds on the Bandwidth Cost of MDS Convertible Codes in the Split Regime
by: Singhvi, Shubhransh, et al.
Published: (2025)

Self-Dual Cyclic Codes with Square-Root-Like Lower Bounds on Their Minimum Distances
by: Chen, Hao, et al.
Published: (2024)

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

Tight Lower Bounds on The Single-Error Detection Threshold for Analog Error-Correcting Codes
by: Jiang, Zhengyi, et al.
Published: (2026)

Low-Complexity PSCL Decoding of Polar Codes
by: Yao, Xinyuanmeng, et al.
Published: (2024)

Unified Error Correction Code Transformer with Low Complexity
by: Yan, Yongli, et al.
Published: (2024)

Dynamic Parameter Scheduling in Soft-Hard BPGD for Lossy Source Coding
by: Alinia, Masoumeh, et al.
Published: (2026)

Lowering Error Floors for Hard Decision Decoding of OFEC Code
by: Lagendijk, Jasper, et al.
Published: (2025)

New Quantum Codes from Evaluation and Matrix-Product Codes
by: Galindo, Carlos, et al.
Published: (2014)

Generalized Lagrange Coded Computing: A Flexible Computation-Communication Tradeoff for Resilient, Secure, and Private Computation
by: Zhu, Jinbao, et al.
Published: (2022)

Lower Bounds on Mutual Information for Linear Codes Transmitted over Binary Input Channels, and for Information Combining
by: Erez, Uri, et al.
Published: (2024)

The Voronoi Spherical CDF for Lattices and Linear Codes: New Bounds for Quantization and Coding
by: Ordentlich, Or
Published: (2025)

Optimal Locality and Parameter Tradeoffs for Subsystem Codes
by: Dai, Samuel, et al.
Published: (2025)

List Decoding and New Bicycle Code Constructions for Quantum LDPC Codes
by: Rabeti, Sheida, et al.
Published: (2025)

New Constructions of Reversible DNA Codes
by: Chen, Xueyan, et al.
Published: (2024)

Embracing Errors Is More Efficient Than Avoiding Them Through Constrained Coding for DNA Data Storage
by: Weindel, Franziska, et al.
Published: (2023)

Improvement of the Gilbert-Varshamov Bound for Linear Codes and Quantum Codes
by: Yuan, Chen, et al.
Published: (2026)

Lower Bounds on Pauli Manipulation Detection Codes
by: Ichikawa, Keiya, et al.
Published: (2025)

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

Low-Complexity Coding Techniques for Cloud Radio Access Networks
by: Ghaddar, Nadim, et al.
Published: (2024)

On the Worst-Case Complexity of Gibbs Decoding for Reed--Muller Codes
by: Xia, Xuzhe, et al.
Published: (2025)