Girth-Based Sequential-Recovery LRCs
In this paper, we prove that a linear block code with girth <inline-formula> <tex-math notation="LaTeX">$2(t+1)$ </tex-math></inline-formula> is a <inline-formula> <tex-math notation="LaTeX">$t$ </tex-math></inline-formula>-sequenti...
Main Authors: | Zhi Jing, Hong-Yeop Song |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2022-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/9968006/ |
Similar Items
-
Some New Sequential-Recovery LRCs Based on Good Polynomials
by: Zhi Jing, et al.
Published: (2022-01-01) -
On the Girth of Tanner (3, 13) Quasi-Cyclic LDPC Codes
by: Hengzhou Xu, et al.
Published: (2019-01-01) -
A REDUCTION IN THE SEARCH SPACE OF QC-LDPC CODES WITH GIRTH 8
by: F. Amirzade, et al.
Published: (2020-01-01) -
A Note on the Girth of (3, 19)-Regular Tanner’s Quasi-Cyclic LDPC Codes
by: Manjie Zhou, et al.
Published: (2021-01-01) -
The 6-girth-thickness of the complete graph
by: Héctor Castañeda-López, et al.
Published: (2020-09-01)