Infinite families of optimal linear codes and their applications to distributed storage systems
From MaRDI portal
Publication:2103140
DOI10.1007/s12190-022-01701-6zbMath1505.94104OpenAlexW4206974355MaRDI QIDQ2103140
Kezheng Zuo, Gaojun Luo, Hui Yan
Publication date: 13 December 2022
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12190-022-01701-6
Related Items (1)
Cites Work
- Unnamed Item
- Linear codes with two or three weights from quadratic bent functions
- Complete weight enumerators of some cyclic codes
- A construction of codes with linearity from two linear codes
- Optimal binary codes from trace codes over a non-chain ring
- Two and three weight codes over \(\mathbb {F}_p+u\mathbb {F}_p\)
- Few-weight codes from trace codes over a local ring
- Anticode-based locally repairable codes with high availability
- A new class of optimal linear codes with flexible parameters
- A coding theory construction of new systematic authentication codes
- Linear Codes With Two or Three Weights From Weakly Regular Bent Functions
- Hamming Weights of the Duals of Cyclic Codes With Two Zeros
- On the Locality of Codeword Symbols
- Secret sharing schemes from three classes of linear codes
- Cyclotomic Linear Codes of Order $3$
- Two-Weight Codes Punctured from Irreducible Cyclic Codes
- The Geometry of Two-Weight Codes
- Fundamentals of Error-Correcting Codes
- New binary linear codes which are dual transforms of good codes
- Two New Families of Two-Weight Codes
- Bounds and Constructions of Locally Repairable Codes: Parity-Check Matrix Approach
- Two or Few-Weight Trace Codes over ${\mathbb{F}_{q}}+u{\mathbb{F}_{q}}$
This page was built for publication: Infinite families of optimal linear codes and their applications to distributed storage systems
