The following pages link to Vladimir Sidorenko (Q398967):
Displaying 49 items.
- On transform-domain error and erasure correction by Gabidulin codes (Q398969) (← links)
- Multitrial decoding of concatenated codes using fixed thresholds (Q415715) (← links)
- Row reduction applied to decoding of rank-metric and subspace codes (Q510489) (← links)
- Algebraic decoding of folded Gabidulin codes (Q510495) (← links)
- (Q764389) (redirect page) (← links)
- A linear algebraic approach to multisequence shift-register synthesis (Q764390) (← links)
- Single-trial decoding of concatenated codes using fixed or adaptive erasing (Q962241) (← links)
- Computation of distributions and their moments in the trellis (Q1001638) (← links)
- (Q1130099) (redirect page) (← links)
- Codes correcting a set of clusters of errors or erasures. (Q1130100) (← links)
- Soft decision maximum likelihood decoding of partial-unit-memory codes (Q1204661) (← links)
- Maximum-likelihood list decoding using trellises (Q1337929) (← links)
- The Euler characteristic of the minimal code trellis is maximum (Q1386633) (← links)
- Concatenation of convolutional codes and rank metric codes for multi-shot network coding (Q1696046) (← links)
- Improved syndrome decoding of lifted \(L\)-interleaved Gabidulin codes (Q1727368) (← links)
- On syndrome decoding of punctured Reed-Solomon and Gabidulin codes (Q1743273) (← links)
- A posteriori probability decoding of nonsystematically encoded block codes (Q1812356) (← links)
- Bounds on complexity of trellis decoding of linear block codes (Q1895472) (← links)
- Fast decoding of Gabidulin codes (Q1934220) (← links)
- Asymptotic single-trial strategies for GMD decoding with arbitrary error-erasure tradeoff (Q1945143) (← links)
- Capacity-achieving private information retrieval scheme with a smaller sub-packetization (Q2025372) (← links)
- Two classes of optimal LRCs with information \((r, t)\)-locality (Q2200511) (← links)
- Fast skew-feedback shift-register synthesis (Q2436582) (← links)
- On multi-trial Forney-Kovalev decoding of concatenated codes (Q2437957) (← links)
- Convolutional Codes in Rank Metric With Application to Random Network Coding (Q2977422) (← links)
- Minimal trellis design for linear codes based on the Shannon product (Q3129490) (← links)
- (Q3362486) (← links)
- (Q3838694) (← links)
- (Q3838719) (← links)
- (Q4094753) (← links)
- Decoding of convolutional codes using a syndrome trellis (Q4324147) (← links)
- (Q4501017) (← links)
- (Q4502633) (← links)
- On periodic (partial) unit memory codes with maximum free distance (Q4637807) (← links)
- Periodicity of one-dimensional tilings (Q4637812) (← links)
- (Q4664697) (← links)
- Array codes correcting a two-dimensional cluster of errors (Q4701182) (← links)
- On the rectangularity of nonlinear block codes (Q4701322) (← links)
- Singleton-type bounds for blot-correcting codes (Q4887086) (← links)
- (Q4945358) (← links)
- Collaborative Decoding of Interleaved Reed–Solomon Codes and Concatenated Code Designs (Q4975910) (← links)
- Decoding of Interleaved Alternant Codes (Q5032639) (← links)
- (Q5090198) (← links)
- Linearized Shift-Register Synthesis (Q5272379) (← links)
- Skew-Feedback Shift-Register Synthesis and Decoding Interleaved Gabidulin Codes (Q5281065) (← links)
- Syndrome Decoding of Reed–Solomon Codes Beyond Half the Minimum Distance Based on Shift-Register Synthesis (Q5281273) (← links)
- Coding and Cryptography (Q5899174) (← links)
- On new problems in asymmetric cryptography based on error-resistant coding (Q6173457) (← links)
- Secure and Reliable Key Agreement with Physical Unclonable Functions (Q6335649) (← links)
