The following pages link to Antonia Wachter-Zeh (Q398964):
Displaying 48 items.
- List and unique error-erasure decoding of interleaved Gabidulin codes with interpolation techniques (Q398965) (← links)
- Efficient decoding of interleaved subspace and Gabidulin codes beyond their unique decoding radius using Gröbner bases (Q1620975) (← links)
- Fast operations on linearized polynomials and their applications in coding theory (Q1635282) (← links)
- Duplication-correcting codes (Q1727344) (← links)
- Improved decoding and error floor analysis of staircase codes (Q1727375) (← links)
- Fast decoding of Gabidulin codes (Q1934220) (← links)
- Almost affinely disjoint subspaces (Q1979948) (← links)
- LIGA: a cryptosystem based on the hardness of rank-metric list and interleaved decoding (Q2034992) (← links)
- Sum-rank product codes and bounds on the minimum distance (Q2123308) (← links)
- Information-set decoding with hints (Q2163764) (← links)
- Decoding interleaved Reed-Solomon codes beyond their joint error-correcting capability (Q2448071) (← links)
- Some Gabidulin Codes Cannot Be List Decoded Efficiently at any Radius (Q2976883) (← links)
- Optimal Ferrers Diagram Rank-Metric Codes (Q2976884) (← links)
- Codes for Partially Stuck-At Memory Cells (Q2976988) (← links)
- Convolutional Codes in Rank Metric With Application to Random Network Coding (Q2977422) (← links)
- List Decoding of Crisscross Errors (Q2979085) (← links)
- Vector Network Coding Based on Subspace Codes Outperforms Scalar Linear Network Coding (Q4569196) (← links)
- List Decoding of Insertions and Deletions (Q4682916) (← links)
- On the Gap Between Scalar and Vector Solutions of Generalized Combination Networks (Q4958249) (← links)
- Error Decoding of Locally Repairable and Partial MDS Codes (Q5003677) (← links)
- Partial MDS Codes With Regeneration (Q5032507) (← links)
- Criss-Cross Insertion and Deletion Correcting Codes (Q5032638) (← links)
- Decoding of Interleaved Alternant Codes (Q5032639) (← links)
- Randomized Decoding of Gabidulin Codes Beyond the Unique Decoding Radius (Q5041210) (← links)
- Variable-Length Bit Mapping and Error-Correcting Codes for Higher-Order Alphabet PUFs (Q5055970) (← links)
- Clustering-Correcting Codes (Q5080012) (← links)
- Adaptive Private Distributed Matrix Multiplication (Q5088412) (← links)
- Multiple Criss-Cross Insertion and Deletion Correcting Codes (Q5088506) (← links)
- Coding Over Sets for DNA Storage (Q5123860) (← links)
- Private Streaming With Convolutional Codes (Q5123865) (← links)
- Network-Coding Solutions for Minimal Combination Networks and Their Sub-Networks (Q5138856) (← links)
- Decoding Cyclic Codes up to a New Bound on the Minimum Distance (Q5271924) (← links)
- Codes Correcting a Burst of Deletions or Insertions (Q5280879) (← links)
- A Correction to “Some Gabidulin Codes Cannot be List Decoded Efficiently at any Radius” (Q5280913) (← links)
- Bounds on List Decoding of Rank-Metric Codes (Q5346252) (← links)
- Rank-Metric Codes and Their Applications (Q5863764) (← links)
- Coding and bounds for partially defective memory cells (Q6070355) (← links)
- Concatenated Codes for Multiple Reads of a DNA Sequence (Q6193569) (← links)
- The Noisy Drawing Channel: Reliable Data Storage in DNA Sequences (Q6197456) (← links)
- LowMS: a new rank metric code-based KEM without ideal structure (Q6489787) (← links)
- An analysis of the RankSign signature scheme with rank multipliers (Q6550573) (← links)
- \textsf{FuLeeca}: a Lee-based signature scheme (Q6550578) (← links)
- Insertion and deletion correction in polymer-based data storage (Q6574744) (← links)
- Function-correcting codes (Q6574837) (← links)
- Single-deletion single-substitution correcting codes (Q6575578) (← links)
- Error-correcting codes for nanopore sequencing (Q6576659) (← links)
- Clay and product-matrix MSR codes with locality (Q6584333) (← links)
- Zero knowledge protocols and signatures from the restricted syndrome decoding problem (Q6635771) (← links)
