Method for recognition of parameters of error-correcting block-cyclic codes by a generator polynomial
From MaRDI portal
Publication:2043988
DOI10.1007/S10559-021-00338-WzbMATH Open1495.94132OpenAlexW3127027346MaRDI QIDQ2043988FDOQ2043988
Authors: S. N. Nikolaev, A. N. Romanov
Publication date: 4 August 2021
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10559-021-00338-w
Recommendations
- On the Shape of the General Error Locator Polynomial for Cyclic Codes
- On generator and parity-check polynomial matrices of generalized quasi-cyclic codes
- scientific article; zbMATH DE number 3345383
- General Error Locator Polynomials for Binary Cyclic Codes With <formula formulatype="inline"><tex>$t \le 2$</tex></formula> and <formula formulatype="inline"> <tex>$n < 63$</tex></formula>
- A correction on the determination of the weight enumerator polynomial of some irreducible cyclic codes
- A decoding procedure for multiple-error-correcting cyclic codes
- A new error-locating polynomial for decoding of BCH codes (Corresp.)
- Error detection with a class of cyclic codes
- A \(q\)-polynomial approach to cyclic codes
- scientific article; zbMATH DE number 3591864
matrixbitstreamcode generator polynomialerror-correcting block-cyclic coderemainder of polynomial division
Cites Work
Cited In (2)
This page was built for publication: Method for recognition of parameters of error-correcting block-cyclic codes by a generator polynomial
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2043988)