ON THE BERLEKAMP — MASSEY ALGORITHM AND ITS APPLICATION FOR DECODING ALGORITHMS
From MaRDI portal
Publication:5089874
DOI10.18287/2541-7525-2021-27-1-44-61zbMath1495.94154OpenAlexW4286545247MaRDI QIDQ5089874
S. M. Ratseev, Anna Dmitrievna Lavrinenko, Ekaterina Alekseevna Stepanova
Publication date: 15 July 2022
Published in: Vestnik of Samara University. Natural Science Series (Search for Journal in Brave)
Full work available at URL: http://mathnet.ru/eng/vsgu646
Cites Work
- A New Algorithm for Decoding Reed-Solomon Codes
- On the equivalence between Berlekamp's and Euclid's algorithms (Corresp.)
- A method for solving key equation for decoding goppa codes
- Fundamentals of Error-Correcting Codes
- ON DECODING ALGORITHMS FOR GENERALIZED REED — SOLOMON CODES WITH ERRORS AND ERASURES
- ON DECODING ALGORITHMS FOR GENERALIZED REED — SOLOMON CODES WITH ERRORS AND ERASURES. II
- Shift-register synthesis and BCH decoding
- Unnamed Item
- Unnamed Item
This page was built for publication: ON THE BERLEKAMP — MASSEY ALGORITHM AND ITS APPLICATION FOR DECODING ALGORITHMS