Pages that link to "Item:Q1620975"
From MaRDI portal
The following pages link to Efficient decoding of interleaved subspace and Gabidulin codes beyond their unique decoding radius using Gröbner bases (Q1620975):
Displaying 12 items.
- List and unique error-erasure decoding of interleaved Gabidulin codes with interpolation techniques (Q398965) (← links)
- Row reduction applied to decoding of rank-metric and subspace codes (Q510489) (← links)
- Algebraic decoding of folded Gabidulin codes (Q510495) (← links)
- Improved syndrome decoding of lifted \(L\)-interleaved Gabidulin codes (Q1727368) (← links)
- On syndrome decoding of punctured Reed-Solomon and Gabidulin codes (Q1743273) (← links)
- Decoding interleaved Gabidulin codes using Alekhnovich's algorithm (Q1743304) (← links)
- List decoding subspace codes from insertions and deletions (Q2826055) (← links)
- A Gröbner-Bases Approach to Syndrome-Based Fast Chase Decoding of Reed–Solomon Codes (Q5088387) (← links)
- Rank-Metric Codes and Their Applications (Q5863764) (← links)
- Insdel codes from subspace and rank-metric codes (Q6080133) (← links)
- Fast Kötter-Nielsen-Høholdt interpolation over skew polynomial rings and its application in coding theory (Q6123057) (← links)
- Fast decoding of lifted interleaved linearized Reed-Solomon codes for multishot network coding (Q6587210) (← links)