Pages that link to "Item:Q1361883"
From MaRDI portal
The following pages link to Decoding of Reed Solomon codes beyond the error-correction bound (Q1361883):
Displaying 50 items.
- Factors of low individual degree polynomials (Q301529) (← links)
- On the error distance of extended Reed-Solomon codes (Q326319) (← links)
- List decoding of repeated codes (Q371249) (← links)
- Multi-trial Guruswami-Sudan decoding for generalised Reed-Solomon codes (Q398959) (← links)
- List and unique error-erasure decoding of interleaved Gabidulin codes with interpolation techniques (Q398965) (← links)
- Group homomorphisms as error correcting codes (Q490299) (← links)
- Variations on Muchnik's conditional complexity theorem (Q639853) (← links)
- List decodability at small radii (Q717148) (← links)
- List decoding of Hermitian codes using Gröbner bases (Q733508) (← links)
- Power error locating pairs (Q782853) (← links)
- On algorithms to find \(p\)-ordering (Q831740) (← links)
- Parameter choices and a better bound on the list size in the Guruswami-Sudan algorithm for algebraic geometry codes (Q849367) (← links)
- List decoding of Reed-Solomon codes from a Gröbner basis perspective (Q931140) (← links)
- Key equations for list decoding of Reed-Solomon codes and how to solve them (Q975823) (← links)
- Improvements on the Johnson bound for Reed-Solomon codes (Q1028479) (← links)
- On error distance of Reed-Solomon codes (Q1042798) (← links)
- Gröbner basis solutions of constrained interpolation problems (Q1611921) (← links)
- Fast operations on linearized polynomials and their applications in coding theory (Q1635282) (← links)
- A modified Guruswami-Sudan algorithm for decoding Reed-Solomon codes (Q1675777) (← links)
- Big data interpolation using functional representation (Q1745346) (← links)
- New constructions for IPP codes (Q1781000) (← links)
- Power decoding Reed-Solomon codes up to the Johnson radius (Q1783708) (← links)
- Noisy Chinese remaindering in the Lee norm (Q1827579) (← links)
- Scalable secure storage when half the system is faulty (Q1854529) (← links)
- On deep holes of standard Reed-Solomon codes (Q1934405) (← links)
- Asymptotic single-trial strategies for GMD decoding with arbitrary error-erasure tradeoff (Q1945143) (← links)
- Privacy-preserving verifiable delegation of polynomial and matrix functions (Q2023805) (← links)
- Explicit list-decodable codes with optimal rate for computationally bounded channels (Q2029777) (← links)
- On 2-dimensional insertion-deletion Reed-Solomon codes with optimal asymptotic error-correcting capability (Q2031639) (← links)
- Weight distributions for projective binary linear codes from Weil sums (Q2130887) (← links)
- On building fine-grained one-way functions from strong average-case hardness (Q2170063) (← links)
- List decoding of number field codes (Q2249795) (← links)
- Efficient systolic multiplications in composite fields for cryptographic systems (Q2321671) (← links)
- A note on good permutation codes from Reed-Solomon codes (Q2324769) (← links)
- On deep holes of generalized Reed-Solomon codes (Q2335176) (← links)
- Decoding interleaved Reed-Solomon codes over noisy channels (Q2373723) (← links)
- New lower bounds for the minimum distance of generalized algebraic geometry codes (Q2376565) (← links)
- Cryptanalyzing the polynomial-reconstruction based public-key system under optimal parameter choice (Q2384012) (← links)
- Reconstructive dispersers and hitting set generators (Q2391190) (← links)
- List-decoding Barnes-Wall lattices (Q2410678) (← links)
- On one-round reliable message transmission (Q2414041) (← links)
- On Reed-Solomon codes (Q2430341) (← links)
- Bounds on collaborative decoding of interleaved Hermitian codes and virtual extension (Q2436580) (← links)
- On multi-trial Forney-Kovalev decoding of concatenated codes (Q2437957) (← links)
- Polynomial root finding over local rings and application to error correcting codes (Q2441447) (← links)
- Decoding interleaved Reed-Solomon codes beyond their joint error-correcting capability (Q2448071) (← links)
- Gröbner basis approach to list decoding of algebraic geometry codes (Q2460910) (← links)
- Parameter choices on Guruswami-Sudan algorithm for polynomial reconstruction (Q2467321) (← links)
- Extractors from Reed-Muller codes (Q2496317) (← links)
- Computing minimal interpolation bases (Q2628323) (← links)
